CCCG 2021 Accepted Papers

  • Peyman Afshani and Rasmus Killmann. Rectangle Stabbing and Orthogonal Range Reporting Lower Bounds in Moderate Dimensions
  • Eva Vanessa Bolle and Linda Kleist. Folding Polyiamonds into Octahedra
  • Joseph O’Rourke and Costin Vilcu. Cut Locus Realizations on Convex Polyhedra
  • Haitao Wang and Yiming Zhao. An Optimal Algorithm for L_1 Shortest Paths in Unit-Disk Graphs
  • Maike Buchin and Leonie Selbach. Decomposing Polygons into Fat Components
  • David Eppstein, Daniel Frishberg and Martha C Osegueda. Angles of Arc-Polygons and Lombardi Drawings of Cacti
  • Hugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull and Christiane Schmidt. Folding points to a point and lines to a line
  • Miguel Bosch and Steven Kelk. An improved kernel for the flip distance problem on simple convex polygons
  • Olivier Devillers and Charles Duménil. Stochastic Analysis of Empty-Region Graphs
  • Ovidiu Daescu and Ka Yaw Teo. The Discrete Median and Center Line Segment Problems in the Plane
  • Mirela Damian and Robin Flatland. Unfolding a New Class of Polycube Graphs of Arbitrary Genus
  • Tetsuya Araki, Hiroyuki Miyata and Shin-Ichi Nakano. Dispersion on Intervals
  • Hannes Frey and Lucas Böltz. Automatically Testing Containedness Between Geometric Graph Classes Defined by Inclusion, Exclusion and Transfer Axioms
  • Sharareh Alipour. On guarding polygons with holes
  • Martin Dvorak and Sara Nicholson. Massively Winning Configurations in the Convex Grabbing Game on the Plane
  • Pawan K. Mishra and Gautam K Das. Approximation Algorithms For The Euclidean Dispersion Problems
  • Hill Darryl, Jean-Lou De Carufel, Luís Fernando Schultz Xavier Da Silveira, Sasanka Roy and Anil Maheshwari. Constant Delay Lattice Train Schedules
  • Princy Jain and Haitao Wang. Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint
  • Sangram Kishor Jena and Gautam K Das. Total Domination in Geometric Unit Disk Graphs
  • Ahmad BiniazProsenjit Bose and Yunkai Wang. Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks
  • Oswin Aichholzer. Another Small but Long Step for Crossing Numbers: cr(13)=225 and cr(14)=315
  • Erik Demaine, Martin Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara and Hanyu Zhang. Any Regular Polyhedron Can Transform to Another by O(1) Refoldings
  • Michelle Tran. Practical Methods for the Embroidery Problem
  • Annika Bonerath, Jan-Henrik Haunert, Joseph S. B. Mitchell and Benjamin Niedermann. Shortcut Hulls: Vertex-restricted Outer Simplifications of Polygons
  • Therese Biedl, Giuseppe Liotta, Jayson Lynch and Fabrizio Montecchiani. Generalized LR-drawings of trees
  • Thore Thießen and Jan Vahrenhold. Oblivious Median Slope Selection
  • Ritesh Seth, Anil Maheshwari and Subhas Nandy. An Acrophobic Guard Watchtower Problem on Terrains
  • Travis Gagie. Compact Euler Tours of Trees with Small Maximum Degree
  • Vishwanath Reddy Singireddy and Manjanna B. Constrained Obnoxious Facility Location on a Line Segment
  • Allan Sapucaia, Andre A. Cire, Pedro J. de Rezende and Cid C. de Souza. Convex Bichromatic Quadrangulation of Point Sets
  • Rachana Madhukara, Vincent Bian and Erik Demaine. Edge-Unfolding Prismatoids: Tall or Rectangular Base
  • Andrew Nathenson. Axis-Aligned Square Contact Representations
  • Nathan van Beusekom, Kevin Buchin, Hidde Koerts, Wouter Meulemans, Benjamin Rodatz and Bettina Speckmann. Near-Delaunay Metrics
  • Maarten Löffler and Jérôme Urhausen. Mapping Points to the Grid with Bounded Hausdorff Distance
  • Erik D. Demaine, Jayson Lynch, Mikhail Rudoy and Yushi Uno. Yin-Yang Puzzles are NP-complete
  • Bogdan Armaselu. Extensions of the Maximum Bichromatic Separating Rectangle Problem
  • Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae and Sang Duk Yoon. Rearranging a Sequence of Points onto a Line
  • Mincheol Kim and Hee-Kap Ahn. Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles
  • Justin Dallant and Patrick Schnider. Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner (p, q)-theorem
  • Jean CardinalJustin Dallant and John Iacono. Approximability of (Simultaneous) Class Cover for Boxes
  • Austin Barr, Calvin Chung and Aaron Williams. Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together)
  • Aster Greenblatt, Robert Hearn, Oscar Hernandez, Yichao Hou, Hiro Ito, Joshua Kang, Aaron Williams and Andrew Winslow. Turning Around and Around: Motion Planning through Thick and Thin Turnstiles
  • Azadeh Tabatabaei, Farehe Soheil, Mohammad Aletaha and Mohammad Ghodsi. Integer Cow-path Problem and Simple Robot Street Search
Scroll to Top