Computational Geometry

All Items

• Every Combinatorial Polyhedron Can Unfold with Overlap

  Joseph O'Rourke

  2:1-2:19

• On the Budgeted Hausdorff Distance Problem

  Sariel Har-Peled, Benjamin Raichel

  3:1-3:8

• Dynamic Convex Hulls under Window-Sliding Updates

  Haitao Wang

  3:1-3:14

• Outside-Obstacle Representations with All Vertices on the Outer Face

  Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff

  2:1-2:21

• Algorithms for Minimizing the Movements of Spreading Points in Linear Domains

  Shimin Li, Haitao Wang

  1:1-1:15

• Arrangements of Pseudocircles: On Digons and Triangles

  Stefan Felsner, Sandro Roch, Manfred Scheucher

  11:1-11:18

• Sparsifying Disk Intersection Graphs for Reliable Connectivity

  Eliot Robson, Sariel Har-Peled

  10:1-10:13

• The Tripartite-Circle Crossing Number of Graphs With Two Small Partition Classes

  Charles Camacho, Silvia Fernández-Merchant, Marija Jelić Milutinović, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White

  9:1-9:21

• StreamTable: An Area Proportional Visualization for Tables with Flowing Streams

  Jared Albert Espenant, Debajyoti Mondal

  8:1-8:18

• Optimal Algorithms for Separating a Polyhedron from its Single-Part Mold

  Prosenjit Bose, Efi Fogel, Tzvika Geft, Dan Halperin, Shahar Shamai

  7:1-7:19

• On the Number of Compositions of Two Polycubes

  Andrei Asinowski, Gill Barequet, Gil Ben-Shachar, Martha Carolina Osegueda, Günter Rote

  4:1-4:18

• Aspect Ratio Universal Rectangular Layouts

  Stefan Felsner, Andrew Nathenson, Csaba D. Toth

  3:1-3:24

• Geometric Spanning Trees Minimizing the Wiener Index

  Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph Mitchell

  2:1-2:15

• (1+ε)-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension

  Jacobus Conradi, Anne Driemel, Benedikt Kolbe

  6:1-6:22

• Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs

  Oswin Aichholzer, Joachim Orthaber, Birgit Vogtenhuber

  5:1-5:30

• Edge Sparsification for Geometric Tour Problems

  Sándor Fekete, Phillip Keldenich, Dominik Krupke, Eike Niehs

  1:1-1:23

• Bicolored Order Types

  Oswin Aichholzer, Anna Brötzner

  3:1-3:17

• Partitioning Axis-Parallel Lines in 3D

  Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson

  9:1-9:20

• On the Complexity of Recognizing Nerves of Convex Sets

  Patrick Schnider, Simon Weber

  2:1-2:8

• A Note on the Flip Distance between Non-crossing Spanning Trees

  Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron

  8:1-8:7

• Planar L-Drawings of Directed Graphs

  Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff

  7:1-7:15

• A Bound for Delaunay Flip Algorithms on Flat Tori

  Loïc Dubois

  6:1-6:13

• Pushing Blocks by Sweeping Lines

  Hugo Akitaya, Maarten Löffler, Giovanni Viglietta

  6:1-6:28

• Locked and Unlocked Smooth Embeddings of Surfaces

  David Eppstein

  5:1-5:20

• Morphing Planar Graph Drawings Through 3D

  Kevin Buchin, Will Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff

  5:1-5:18