default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd CCCG 2020, Saskatoon, Saskatchewan, Canada
- J. Mark Keil, Debajyoti Mondal:
Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon, Saskatchewan, Canada. 2020
Paul Erdős Memorial Lecture
- Erik D. Demaine:
Tribute to Godfried Toussaint. CCCG 2020: 1
Session 1A
- Ahmad Biniaz, Zhikai Lin:
Minimum Ply Covering of Points with Convex Shapes. CCCG 2020: 2-5 - Hongyao Huang, Benjamin Raichel:
Convex Hull Complexity of Uncertain Points. CCCG 2020: 6-14 - Georgiy Klimenko, Benjamin Raichel, Gregory Van Buskirk:
Sparse Convex Hull Coverage. CCCG 2020: 15-25 - Daniel Lokshtanov, Chinmay Sonar, Subhash Suri, Jie Xue:
Fair Covering of Points by Balls. CCCG 2020: 26-32 - Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid:
Covering Points with Pairs of Concentric Disks. CCCG 2020: 33-38 - Sima Hajiaghaei Shanjani:
Hardness of Approximation for Red-Blue Covering. CCCG 2020: 39-48
Session 1B
- David Caballero, Angel A. Cantu, Timothy Gomez, Austin Luchsinger, Robert T. Schweller, Tim Wylie:
Relocating Units in Robot Swarms with Uniform Control Signals is PSPACE-Complete. CCCG 2020: 49-55 - David Caballero, Angel A. Cantu, Timothy Gomez, Austin Luchsinger, Robert T. Schweller, Tim Wylie:
Building Patterned Shapes in Robot Swarms with Uniform Control Signals. CCCG 2020: 56-62 - Man-Kwun Chiu, Erik D. Demaine, Jenny Diomidova, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy:
New Results in Sona Drawing: Hardness and TSP Separation. CCCG 2020: 63-72 - Jared Ray Coleman, Evangelos Kranakis, Oscar Morales-Ponce, Jaroslav Opatrny, Jorge Urrutia, Birgit Vogtenhuber:
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots. CCCG 2020: 73-79 - Mansoor Davoodi, Hosein Enamzadeh, Ashkan Safari:
Path Planning in a Weighted Planar Subdivision Under the Manhattan Metric. CCCG 2020: 80-86 - Christian Scheffer:
Scheduling Three Trains is NP-Complete. CCCG 2020: 87-93
Ferran Hurtado Memorial Lecture
- Jeff Erickson:
Chasing Puppies. CCCG 2020: 94
Session 2A
- Kingston Yao Czajkowski, Erik D. Demaine, Martin L. Demaine, Kim Eppling, Robby Kraft, Klara Mundilova, Levi Smith:
Folding Small Polyominoes into a Unit Cube. CCCG 2020: 95-100 - Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke:
Some Polycubes Have No Edge Zipper Unfolding. CCCG 2020: 101-105 - Erik D. Demaine, Martin L. Demaine, David Eppstein:
Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CCCG 2020: 106-113 - Kristin DeSplinter, Satyan L. Devadoss, Jordan Readyhough, Bryce Wimberly:
Nets of higher-dimensional cubes. CCCG 2020: 114-120 - Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara:
Efficient Folding Algorithms for Regular Polyhedra. CCCG 2020: 121-127 - Joseph O'Rourke:
Vertex-Transplants on a Convex Polyhedron. CCCG 2020: 128-133
Session 2B
- Siu-Wing Cheng, Otfried Cheong, Taegyoung Lee:
Fitting a Graph to One-Dimensional Data. CCCG 2020: 134-140 - Hsien-Chih Chang, Tim Ophelders:
Planar Emulators for Monge Matrices. CCCG 2020: 141-147 - Ben Chugg, William S. Evans, Kelvin Wong:
Simultaneous Visibility Representations of Undirected Pairs of Graphs. CCCG 2020: 148-159 - J. Mark Keil, Debajyoti Mondal, Ehsan Moradi:
Finding a Maximum Clique in a Grounded 1-Bend String Graph. CCCG 2020: 160-166 - Vincent Despré, Michaël Rao, Stéphan Thomassé:
Testing Balanced Splitting Cycles in Complete Triangulations. CCCG 2020: 167-173 - Haitao Wang, Yiming Zhao:
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Pathsin a Metric Space. CCCG 2020: 174-180
Godfried Toussaint Memorial Lecture
Session 3A
- Sergey Bereg, Mohammadreza Haghpanah:
Computing the Caratheodory Number of a Point. CCCG 2020: 182-188 - Ovidiu Daescu, Ka Yaw Teo:
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CCCG 2020: 189-198 - David Eppstein:
Dynamic Products of Ranks. CCCG 2020: 199-205 - Abrar Kazi, Michiel Smid:
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares. CCCG 2020: 206-213 - Ming Ouyang:
Parallel topological sweep. CCCG 2020: 214-220 - Donald R. Sheehy:
One Hop Greedy Permutations. CCCG 2020: 221-225
Session 3B
- Davood Bakhshesh, Mohammad Farshi:
A Degree 3 Plane 5.19-Spanner for Points in Convex Position. CCCG 2020: 226-232 - Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, Arezoo Sajadpour:
Non-Crossing Matching of Online Points. CCCG 2020: 233-239 - Kevin Buchin, Herman J. Haverkort, Hidde Koerts:
Restricted-Weight Minimum-Dilation Spanners on Three Points. CCCG 2020: 240-248 - Maike Buchin, Bernhard Kilgus:
Fréchet Distance Between Two Point Sets. CCCG 2020: 249-257 - Gábor Damásdi, Dömötör Pálvölgyi:
Realizing m-uniform four-chromatic hypergraphs with disks. CCCG 2020: 258-265 - Neeldhara Misra, Harshil Mittal, Aditi Sethia:
Red-Blue Point Separation for Points on a Circle. CCCG 2020: 266-272
Session 4A
- Péter Ágoston:
A lower bound on the number of colours needed to nicely colour a sphere. CCCG 2020: 273-284 - Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Csaba D. Tóth:
2048 Without Merging. CCCG 2020: 285-291 - Kyle Clarkson, Will Evans:
External Exploration of a Convex Polygon. CCCG 2020: 292-299 - Ovidiu Daescu, Hemant Malik:
City Guarding with Limited Field of View. CCCG 2020: 300-311 - Omid Gheibi, Hamid Zarrabi-Zadeh:
Blind Voronoi Game. CCCG 2020: 312-316 - Jonathan Lenchner, Eli Packer:
Line Segment Visibility: Theoretical and Experimental Results. CCCG 2020: 317-325
Session 4B
- Sariel Har-Peled, Mitchell Jones:
Some Geometric Applications of Anti-Chains. CCCG 2020: 326-331 - Frederik Brinck Jensen, Aadi Joshi, Saurabh Ray:
Discrete Helly type theorems. CCCG 2020: 332-335 - Brittany Terese Fasy, Benjamin Holmgren, Bradley McCoy, David L. Millman:
If You Must Choose Among Your Children, Pick the Right One. CCCG 2020: 336-344 - Kirk P. Gardner, Donald R. Sheehy:
A Simple Algorithm for kNN Sampling in General Metrics. CCCG 2020: 345-351 - Alejandro Flores-Velazco:
Social Distancing is Good for Points too! CCCG 2020: 352-358
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.
last updated on 2025-11-23 19:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
