CCCG 2019 Accepted Papers

Koji Ouchi and Ryuhei Uehara. Minimum Forcing Sets for Single-Vertex Crease Pattern
Chuzo Iwamoto and Tatsuya Ide. Nurimisaki and Sashigane are NP-complete
Martin L. Demaine, Robert Hearn, Jason S. Ku and Ryuhei Uehara. Rectangular Unfoldings of Polycubes
Thomas Schibler, Ambuj Singh and Subhash Suri. On Multi-Dimensional Team Formation
David Eppstein. Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings
Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore and Leonardo Martínez-Sandoval. Geometric Systems of Unbiased Representatives
Arun Kumar Das, Sandip Das and Joydeep Mukherjee. Largest Triangle inside a Terrain
Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara and Takeaki Uno. Simple Fold and Cut Problem for Line Segments
Mathijs Wintraecken and Gert Vegter. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds
Shimin Li, Zhongjiang Yan and Jingru Zhang. An Optimal Algorithm for Maintaining Connectivity of Wireless Network on a Line
Ali Gholami Rudi. Curve-Restricted Simplification of Monotone Polygonal Curves
Sayan Bandyapadhyay and Saeed Mehrabi. Constrained Orthogonal Segment Stabbing
Alejandro Flores-Velazco and David Mount. Guarantees on Nearest-Neighbor Condensation heuristics
Fabian Klute, Irene Parada, Takashi Horiyama, Matias Korman, Ryuhei Uehara and Katsuhisa Yamanaka. Efficient Segment Folding is Hard
Saad Quader and Alexander Russell. Graph Realization on a Random Embedding
Sepideh Aghamolaei, Mohammad Ghodsi and Seyyedhamid Miri. A MapReduce Algorithm for Metric Anonymity Problems
Loic Crombez, Guilherme D. Da Fonseca and Yan Gerard. Peeling Digital Potatoes
Bin Fu, Robert Schweller and Tim Wylie. Discrete Planar Map Matching
Ovidiu Daescu and Ka Yaw Teo. Computing Feasible Trajectories for an Articulated Probe in Three Dimensions
Sander Verdonschot. Flipping in Spirals
Prosenjit Bose and Thomas Shermer. Attraction-convexity and Normal Visibility
Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova and Christiane Schmidt. Folding Polyominoes with Holes into a Cube
Erik Krohn, Bengt J. Nilsson and Paweł Żyliński. A Note on Guarding Staircase Polygons
Ahmad Biniaz, Prosenjit Bose, Jean Cardinal and Michael Payne. Three-Coloring Three-Dimensional Uniform Hypergraphs
Therese Biedl, Ahmad Biniaz and Anna Lubiw. Minimum Ply Covering of Points with Disks and Squares
Hugo Akitaya, Leonie Ryvkin and Csaba Toth. Rock Climber Distance: Frogs versus Dogs
Morten Eskildsen, Matias Frank Jensen, Sebastian Kolby and Jesper Steensgaard. Maintaining a Centerpoint with Amortized Optimal Logarithmic Insertions
Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen Merkel and Anurag Murty Naredla. Reconstructing a Polyhedron between Polygons in Parallel Slices
Prosenjit Bose, Pilar Cano and Rodrigo I. Silveira. Affine invariant triangulations
Yeganeh Bahoo, Prosenjit Bose and Stephane Durocher. Watchtower for k-crossing Visibility
Tanmay Inamdar. Local Search for Geometric Partial Covering Problems
Kevin Buchin, Pedro Machado Manhães de Castro, Olivier Devillers and Menelaos Karavelas. Hardness results on Voronoi, Laguerre and Apollonius diagrams
Daniel Gibney, Sharma V. Thankachan, Arnab Ganguly and Rahul Shah. I/O Optimal Data Structures for Categorical Range Skyline Queries
Bengt J. Nilsson and Paweł Żyliński. The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains
Luis Polanco and Jose Perea. Coordinatizing Data With Lens Spaces and Persistent Cohomology
Alyxander Burns, Peter Klemperer, Jaemarie Solyst and Audrey St. John. Redundant Persistent Acyclic Formations for Vision-Based Control of Distributed Multi-Agent Formations
Jean Cardinal, Ruy Fabila-Monroy and Carlos Hidalgo-Toscano. Chirotopes of Random Points in Space are Realizable on a Small Integer Grid
Soroush Ebadian and Hamid Zarrabi-Zadeh. A Simple Randomized Algorithm for All Nearest Neighbors
Kian Mirjalali, Seyed Ali Tabatabaee and Hamid Zarrabi-Zadeh. Distributed Unit Clustering