Computational Geometry

All Items

• 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

• A Theory of Spherical Diagrams

  Giovanni Viglietta

  2:1-2:24

• A Note on Reachability and Distance Oracles for Transmission Graphs

  Mark de Berg

  4:1-4:15

• A SAT Attack on Erdős-Szekeres Numbers in R^d and the Empty Hexagon Theorem

  Manfred Scheucher

  2:1-2:13

• Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves

  Frederik Brüning, Hugo Akitaya, Erin Chambers, Anne Driemel

  1:1-1:48

• The Complexity of Sharing a Pizza

  Patrick Schnider

  4:1-4:19

• Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem

  Justin Dallant, Patrick Schnider

  5:1-5:27

• Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points

  Ahmad Biniaz, Anil Maheshwari, Michiel Smid

  3:1-3:18

• Obstructing Classification via Projection

  Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek

  2:1-2:21