dblp: CCCG 2021 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

33rd CCCG 2021, Saskatoon, Saskatchewan, Canada

• 

• 

• 

• 

• 
  jump to

  • Session 1
  • Session 3
  • Session 4
  • Session 6
  • Presentation of the Best Student Paper
  • Session 7B
  • Session 8B

• 

• > Home > Conferences and Workshops > CCCG

SPARQL queries

⚠

Please note that none of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries won't return any results.

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

• 
  Meng He, Don Sheehy:
  Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021, August 10-12, 2021, Dalhousie University, Halifax, Nova Scotia, Canada. 2021

Session 1

• 
  • 
  • 
  • 
  • 
    Nathan van Beusekom, Kevin Buchin, Hidde Koerts, Wouter Meulemans, Benjamin Rodatz, Bettina Speckmann:
    Near-Delaunay Metrics. CCCG 2021: 1-11
• 
  • 
  • 
  • 
  • 
    Annika Bonerath, Jan-Henrik Haunert, Joseph S. B. Mitchell, Benjamin Niedermann:
    Shortcut Hulls: Vertex-restricted Outer Simplications of Polygons. CCCG 2021: 12-23
• 
  • 
  • 
  • 
  • 
    Olivier Devillers, Charles Duménil:
    Stochastic Analysis of Empty-Region Graphs. CCCG 2021: 24-35
• 
  • 
  • 
  • 
  • 
    Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon:
    Rearranging a Sequence of Points onto a Line. CCCG 2021: 36-46
• 
  • 
  • 
  • 
  • 
    Maarten Löffler, Jérôme Urhausen:
    Mapping Points to the Grid with Bounded Hausdor Distance. CCCG 2021: 47-55

Session 2

• 
  • 
  • 
  • 
  • 
    David Eppstein, Daniel Frishberg, Martha C. Osegueda:
    Angles of Arc-Polygons and Lombardi Drawings of Cacti. CCCG 2021: 56-64
• 
  • 
  • 
  • 
  • 
    Michelle Tran:
    Practical Methods for the Embroidery Problem. CCCG 2021: 65-71
• 
  • 
  • 
  • 
  • 
    Oswin Aichholzer:
    Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315. CCCG 2021: 72-77
• 
  • 
  • 
  • 
  • 
    Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
    Generalized LR-Drawings of Trees. CCCG 2021: 78-88

Session 3

• 
  • 
  • 
  • 
  • 
    Martin Dvorak, Sara Nicholson:
    Massively Winning Congurations in the Convex Grabbing Game on the Plane. CCCG 2021: 89-96
• 
  • 
  • 
  • 
  • 
    Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno:
    Yin-Yang Puzzles are NP-complete. CCCG 2021: 97-106
• 
  • 
  • 
  • 
  • 
    Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
    Constant Delay Lattice Train Schedules. CCCG 2021: 107-113
• 
  • 
  • 
  • 
  • 
    Austin Barr, Calvin Chung, Aaron Williams:
    Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together). CCCG 2021: 114-125

The Memorial Lecture of Paul Erdös

• 
  • 
  • 
  • 
  • 
    Pankaj K. Agarwal:
    Flood Risk Analysis on Terrains. CCCG 2021: 126

Session 4

• 
  • 
  • 
  • 
  • 
    Hannes Frey, Lucas Böltz:
    Automatically Testing Containedness between Geometric Graph Classes defined by Inclusion, Exclusion and Transfer Axioms. CCCG 2021: 127-138
• 
  • 
  • 
  • 
  • 
    Princy Jain, Haitao Wang:
    Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint. CCCG 2021: 139-148
• 
  • 
  • 
  • 
  • 
    Jean Cardinal, Justin Dallant, John Iacono:
    Approximability of (Simultaneous) Class Cover for Boxes. CCCG 2021: 149-156
• 
  • 
  • 
  • 
  • 
    Justin Dallant, Patrick Schnider:
    Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. CCCG 2021: 157-166
• 
  • 
  • 
  • 
  • 
    Peyman Afshani, Rasmus Killmann:
    Rectangle Stabbing and Orthogonal Range Reporting Lower Bounds in Moderate Dimensions. CCCG 2021: 167-174

Session 5

• 
  • 
  • 
  • 
  • 
    Maike Buchin, Leonie Selbach:
    Decomposing Polygons into Fat Components. CCCG 2021: 175-184
• 
  • 
  • 
  • 
  • 
    Allan Sapucaia, André A. Ciré, Pedro J. de Rezende, Cid C. de Souza:
    Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips. CCCG 2021: 185-194
• 
  • 
  • 
  • 
  • 
    Miguel Bosch Calvo, Steven Kelk:
    An Improved Kernel for the Flip Distance Problem on Simple Convex Polygons. CCCG 2021: 195-199
• 
  • 
  • 
  • 
  • 
    Mincheol Kim, Hee-Kap Ahn:
    Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles. CCCG 2021: 200-210

Session 6

• 
  • 
  • 
  • 
  • 
    Haitao Wang, Yiming Zhao:
    An Optimal Algorithm for L1 Shortest Paths in Unit-Disk Graphs. CCCG 2021: 211-218
• 
  • 
  • 
  • 
  • 
    Sangram Kishor Jena, Gautam K. Das:
    Total Domination in Geometric Unit Disk Graphs. CCCG 2021: 219-227
• 
  • 
  • 
  • 
  • 
    Ahmad Biniaz, Prosenjit Bose, Yunkai Wang:
    Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks. CCCG 2021: 228-236
• 
  • 
  • 
  • 
  • 
    Bogdan Armaselu:
    Extensions of the Maximum Bichromatic Separating Rectangle Problem. CCCG 2021: 237-247

The Joint Memorial Lecture of Ferran Hurtado and Godfried Toussaint

• 
  • 
  • 
  • 
  • 
    Elisabetta A. Matsumoto:
    Twisted Topological Tangles or: the Knot Theory of Knitting. CCCG 2021: 248

Presentation of the Best Student Paper

• 
  • 
  • 
  • 
  • 
    Andrew Nathenson:
    Axis-Aligned Square Contact Representations. CCCG 2021: 249-259

Session 7A

• 
  • 
  • 
  • 
  • 
    Eva Bolle, Linda Kleist:
    Folding Polyiamonds into Octahedra. CCCG 2021: 260-270
• 
  • 
  • 
  • 
  • 
    Hugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull, Christiane Schmidt:
    Folding Points to a Point and Lines to a Line. CCCG 2021: 271-278
• 
  • 
  • 
  • 
  • 
    Joseph O'Rourke, Costin Vîlcu:
    Cut Locus Realizations on Convex Polyhedra. CCCG 2021: 279-285
• 
  • 
  • 
  • 
  • 
    Mirela Damian, Robin Y. Flatland:
    Unfolding a New Class of Orthographs of Arbitrary Genus. CCCG 2021: 286-296

Session 7B

• 
  • 
  • 
  • 
  • 
    Tetsuya Araki, Hiroyuki Miyata, Shin-Ichi Nakano:
    Dispersion on Intervals. CCCG 2021: 297-302
• 
  • 
  • 
  • 
  • 
    Pawan K. Mishra, Gautam K. Das:
    Approximation Algorithms for the Euclidean Dispersion Problems. CCCG 2021: 303-311
• 
  • 
  • 
  • 
  • 
    Ovidiu Daescu, Ka Yaw Teo:
    The Discrete Median and Center Line Segment Problems in the Plane. CCCG 2021: 312-319
• 
  • 
  • 
  • 
  • 
    Thore Thießen, Jan Vahrenhold:
    Oblivious Median Slope Selection. CCCG 2021: 320-331

Session 8A

• 
  • 
  • 
  • 
  • 
    Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang:
    Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. CCCG 2021: 332-342
• 
  • 
  • 
  • 
  • 
    Vincent Bian, Erik D. Demaine, Rachana Madhukara:
    Edge-Unfolding Prismatoids: Tall or Rectangular Base. CCCG 2021: 343-347
• 
  • 
  • 
  • 
  • 
    Sharareh Alipour:
    On Guarding Polygons with Holes. CCCG 2021: 348-350
• 
  • 
  • 
  • 
  • 
    Ritesh Seth, Anil Maheshwari, Subhas C. Nandy:
    An Acrophobic Guard Watchtower Problem on Terrains. CCCG 2021: 351-361

Session 8B

• 
  • 
  • 
  • 
  • 
    Vishwanath R. Singireddy, Manjanna Basappa:
    Constrained Obnoxious Facility Location on a Line Segment. CCCG 2021: 362-367
• 
  • 
  • 
  • 
  • 
    Travis Gagie, Sebastian Wild:
    Succinct Euler-Tour Trees. CCCG 2021: 368-376
• 
  • 
  • 
  • 
  • 
    Aster Greenblatt, Oscar I. Hernandez, Robert A. Hearn, Yichao Hou, Hiro Ito, Minwoo Kang, Aaron Williams, Andrew Winslow:
    Turning Around and Around: Motion Planning through Thick and Thin Turnstiles. CCCG 2021: 377-387
• 
  • 
  • 
  • 
  • 
    Azadeh Tabatabaei, Farehe Soheil, Mohammad Aletaha, Mohammad Ghodsi:
    Integer Cow-path Problem and Simple Robot Street Search. CCCG 2021: 388-398

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: