default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st CCCG 2019: Edmonton, Alberta, Canada
- Zachary Friggstad, Jean-Lou De Carufel:
Proceedings of the 31st Canadian Conference on Computational Geometry, CCCG 2019, August 8-10, 2019, University of Alberta, Edmonton, Alberta, Canada. 2019
Paul Erdős Memorial Lecture
- Vida Dujmovic:
Graph Drawing via Layered Partitions. CCCG 2019: 1
Session 1A
- Morten Eskildsen, Matias Frank Jensen, Sebastian Kolby, Jesper Steensgaard:
Maintaining a Centerpoint in the Plane with Amortized Optimal Logarithmic Insertions. CCCG 2019: 2-8 - Daniel Gibney, Sharma V. Thankachan, Arnab Ganguly, Rahul Shah:
I/O Optimal Data Structures for Categorical Range Skyline Queries. CCCG 2019: 9-16
Session 1B
- David Eppstein:
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. CCCG 2019: 17-22 - Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne:
Three-Coloring Three-Dimensional Uniform Hypergraphs. CCCG 2019: 23-28 - Alyxander Burns, Peter Klemperer, Jaemarie Solyst, Audrey St. John:
Redundant Persistent Acyclic Formations for Vision-Based Control of Distributed Multi-Agent Formations. CCCG 2019: 29-37
Session 2A
- Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval:
Geometric Systems of Unbiased Representatives. CCCG 2019: 38-43 - Jean Cardinal, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid. CCCG 2019: 44-48 - Luis Polanco, Jose A. Perea:
Coordinatizing Data With Lens Spaces and Persistent Cohomology. CCCG 2019: 49-58
Session 2B
- Ovidiu Daescu, Ka Yaw Teo:
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CCCG 2019: 59-70 - Bengt J. Nilsson, Pawel Zylinski:
The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains. CCCG 2019: 71-77 - Shimin Li, Zhongjiang Yan, Jingru Zhang:
An Optimal Algorithm for Maintaining Connectivity of Wireless Network on a Line. CCCG 2019: 78-84
Distinguished Lecture
- Joseph O'Rourke:
Unfolding Polyhedra. CCCG 2019: 85
Session 3A
- Alejandro Flores-Velazco, David M. Mount:
Guarantees on Nearest-Neighbor Condensation heuristics. CCCG 2019: 87-93 - Soroush Ebadian, Hamid Zarrabi-Zadeh:
A Simple Randomized Algorithm for All Nearest Neighbors. CCCG 2019: 94-98 - Kevin Buchin, Pedro Machado Manhães de Castro, Olivier Devillers, Menelaos Karavelas:
Hardness results on Voronoi, Laguerre and Apollonius diagrams. CCCG 2019: 99-104
Session 3B
- Matt Gibson, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Pawel Zylinski:
A Note on Guarding Staircase Polygons. CCCG 2019: 105-109 - Prosenjit Bose, Thomas C. Shermer:
Attraction-convexity and Normal Visibility. CCCG 2019: 110-116 - Sepideh Aghamolaei, Mohammad Ghodsi, Seyyedhamid Miri:
A MapReduce Algorithm for Metric Anonymity Problems. CCCG 2019: 117-123
Session 4A
- Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Peeling Digital Potatoes. CCCG 2019: 124-132 - Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Largest Triangle inside a Terrain. CCCG 2019: 133-138 - Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla:
Reconstructing a Polyhedron between Polygons in Parallel Slices. CCCG 2019: 139-145 - Thomas Schibler, Ambuj K. Singh, Subhash Suri:
On Multi-Dimensional Team Formation. CCCG 2019: 146-152
Session 4B
- Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Simple Fold and Cut Problem for Line Segments. CCCG 2019: 153-158 - Martin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara:
Rectangular Unfoldings of Polycubes. CCCG 2019: 159-163 - Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding Polyominoes with Holes into a Cube. CCCG 2019: 164-170 - Koji Ouchi, Ryuhei Uehara:
Minimum Forcing Sets for Single-Vertex Crease Pattern. CCCG 2019: 171-176
Session 5A
- Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Ecient Segment Folding is Hard. CCCG 2019: 177-183 - Chuzo Iwamoto, Tatsuya Ide:
Nurimisaki and Sashigane are NP-complete. CCCG 2019: 184-194 - Sayan Bandyapadhyay, Saeed Mehrabi:
Constrained Orthogonal Segment Stabbing. CCCG 2019: 195-202
Session 5B
- Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher:
Watchtower for k-crossing Visibility. CCCG 2019: 203-209 - Hugo A. Akitaya, Leonie Ryvkin, Csaba D. Tóth:
Rock Climber Distance: Frogs versus Dogs. CCCG 2019: 210-217 - Bin Fu, Robert T. Schweller, Tim Wylie:
Discrete Planar Map Matching. CCCG 2019: 218-224
Ferran Hurtado Memorial Lecture
- Mark de Berg:
ETH-Tight Algorithms for Geometric Network Problems Using Geometric Separators. CCCG 2019: 225
Session 6A
- Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum Ply Covering of Points with Disks and Squares. CCCG 2019: 226-235 - Kian Mirjalali, Seyed Ali Tabatabaee, Hamid Zarrabi-Zadeh:
Distributed Unit Clustering. CCCG 2019: 236-241 - Tanmay Inamdar:
Local Search for Geometric Partial Covering Problems. CCCG 2019: 242-249
Session 6B
- Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Ane invariant triangulations. CCCG 2019: 250-256 - Sander Verdonschot:
Flipping in Spirals. CCCG 2019: 257-262 - Saad Quader, Alexander Russell:
Graph Realization on a Random Embedding. CCCG 2019: 263-274 - Mathijs Wintraecken, Gert Vegter:
The extrinsic nature of the Hausdor distance of optimal triangulations of manifolds. CCCG 2019: 275-279
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 2024-11-07 20:41 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:
