Schedule
Download the book of abstracts
List of accepted papers
| Franz Aurenhammer, Günter Paulini and Bert Jüttler | Voronoi Diagrams for Parallel Halflines in 3D |
| Bernd Gärtner, Johannes Lengler and May Szedlak | Random Sampling with Removal |
| Boris Aronov, Matias Korman, Simon Pratt,André van Renssen and Marcel Roeloffzen | Time-Space Trade-offs for Triangulating a Simple Polygon |
| Jean-Lou De Carufel, Matthew Katz, Matias Korman, André van Renssen, Marcel Roeloffzen and Shakhar Smorodinsky | On Kinetic Range Spaces and their Applications |
| Roland Glück | Covering Polygons with Rectangles |
| Erel Segal-Halevi, Avinatan Hassidim and Yonatan Aumann | Fair and Square: Cake-Cutting in Two Dimensions |
| Martin Fink, John Hershberger, Nirman Kumar and Subhash Suri | Separability and Convexity of Probabilistic Point Sets |
| Mark de Berg, Joachim Gudmundsson and Mehran Mehr | Finding Plurality Points in R^d |
| Jean Cardinal, Michael S. Payne and Noam Solomon | Ramsey-type theorems for lines in 3-space |
| Laszlo Kozma and Tobias Mömke | A PTAS for Euclidean Maximum Scatter TSP |
| Fabian Dütsch | Two-Dimensional Closest Pair Algorithms in the VAT-Model |
| Ahmad Biniaz, Anil Maheshwari and Michiel Smid | Bottleneck Matchings and Hamiltonian Cycles in Higher-Order Gabriel Graphs |
| Gill Barequet and Mira Shalah | Improved Bounds on the Growth Constant of Polyiamonds |
| Bengt J. Nilsson and Eli Packer | An Approximation Algorithm for the Two-Watchman Route in a Simple Polygon |
| Supanut Chaidee and Kokichi Sugihara | Approximation of a Spherical Tessellation by the Laguerre Voronoi Diagram |
| Mark de Berg, Hans Bodlaender and Sándor Kisfaludi-Bak | Connected Dominating Set in Unit Disk Graphs is W[1]-hard |
| Patrick Schnider | Packing Plane Spanning Double Stars into Complete Geometric Graphs |
| Michael Hauer and Bert Jüttler | Detecting affine equivalences of planar rational curves |
| Mark de Berg, Aleksandar Markovic and Gerhard Woeginger | Colouring Contact Graphs of Squares and Rectilinear Polygons |
| Oswin Aichholzer, Thomas Hackl and Manfred Scheucher | Planar L-Shaped Point Set Embeddings of Trees |
| Edouard Bonnet and Tillmann Miltzow | Flip Distance to a Non-crossing Perfect Matching |
| Edouard Bonnet and Tillmann Miltzow | An Approximation Algorithm for the Art Gallery Problem |
| Stefan Funke, Thomas Mendel, Alexander Miller,Sabine Storandt and Maria Wiebe | Map Simplification with Topology Constraints: Exactly and in Practice |
| Marko Savić and Miloš Stojaković | Non-crossing Bottleneck Matchings of Points in Convex Position |
| Pawel Winter and Stephan S. Lorenzen | Bottleneck Distances and Steiner Trees in the Euclidean d-Space |
| Peyman Afshani, Don Sheehy and Yannik Stein | Approximating the Simplicial Depth in High Dimensions |
| Nodari Sitchinava and Darren Strash | Reconstructing a Unit-Length Orthogonally Convex Polygon from its Visibility Graph |
| Haim Kaplan, Wolfgang Mulzer, Liam Rodittyand Paul Seiferth | Dynamic Connectivity for Unit Disk Graphs |
| Narcis Coll, Marta Fort and J. Antoni Sellares | Computing the maximum overlap of a disk and a piecewise circular domain under translation |
| Emilio Di Giacomo, Giuseppe Liotta and Fabrizio Montecchiani | 1-bend Upward Planar Drawings of SP-digraphs with the Optimal Number of Slopes |
| Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze and Manfred Scheucher | Strongly Monotone Drawings of Planar Graphs |
| Merce Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell and Carlos Seara | Stabbing circles for some sets of Delaunay segments |
| Dan Halperin and Shahar Shamai | On the Separation of a Polyhedron from Its Single-Part Mold |
| Imre Bárány, Kevin Buchin, Michael Hoffmann and Anita Liebenau | An Improved Bound for Orthogeodesic Point Set Embeddings of Trees |
| Günther Eder, Martin Held and Peter Palfrader | Bisector Graphs for Min-/Max-Volume Roofs over Simple Polygons |
| Christian Knauer, David Kübel and Fabian Stehn | A New Modular Parametric Search Framework |
| Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr and Birgit Vogtenhuber | Holes in 2-convex point sets |
| Arthur van Goethem, Marc Van Kreveld, Maarten Löffler, Frank Staals and Bettina Speckmann | Grouping Time-varying Data for Interactive Exploration |
| Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans and André Schulz | Drawing trees and triangulations with few geometric primitives |
| Martin Held and Peter Palfrader | Additive Weights for Straight Skeletons |
| Jeff Sommars and Jan Verschelde | Computing Pretropisms for the Cyclic n-Roots Problem |
| Dániel Marx and Tillmann Miltzow | Peeling the Cactus: Subexponential-Time Algorithms for Counting Triangulations |
| Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara and Jorge Urrutia | Covering points with rotating polygons |
| Helmut Alt and Nadja Scharf | Approximating Smallest Containers for Packing Three-dimensional Convex Objects |
| Edouard Bonnet and Tillmann Miltzow | Parameterized Hardness of Art Gallery Problems |
| Kevin Buchin, Tim Ophelders and Bettina Speckmann | Computing the Fréchet Distance between Real-Valued Surfaces |
| Eyup Serdar Ayaz and Alper Ungor | Minimal Witness Sets For Art Gallery Problems |
| Tuong Nguyen, Isabelle Sivignon and Dominique Attali | Epsilon-covering is NP-complete |
| Peter Franek, Marek Krčál and Hubert Wagner | Robustness of Zero Set: Implementation |
| Moritz Baum, Thomas Bläsius, Andreas Gemsa,Ignaz Rutter and Franziska Wegner | Computing Minimum-Link Separating Polygons in Practice |
| Frédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles and Yannik Stein | Generalized Colorful Linear Programming and Further Applications |
| Rebvar Hosseini, Mehdi Khosravian, Mansoor Davoodi and Bahram Sadeghi Bigham | One Round Voronoi Game on Grids |
| Yeganeh Bahoo, Bahareh Banyassady, Prosenjit K. Bose, Stephane Durocher and Wolfgang Mulzer | Finding the k-Visibility Region of a Point in a Simple Polygon in the Memory-Constrained Model |
| Jonathan Lenchner, Donald Sheehy and Liu Yang | Characterizing the Distortion of Some Simple Euclidean Embeddings |
| Mohammadali Abam, Sharareh Alipour, Mohammad Ghodsi and Mohammad Mahdian | Visibility Testing and Counting for Uncertain Segments |
| Marc Van Kreveld, Maarten Löffler, Frank Staals and Lionov Wiratma | A Refined Definition for Groups of Moving Entities and its Computation |
| Kevin Buchin, Maike Buchin, Maximilian Konzack, Wolfgang Mulzer and André Schulz | Fine-Grained Analysis of Problems on Curves |
| Quirijn W. Bouts, Irina Kostitsyna, Marc Van Kreveld, Wouter Meulemans, Willem Sonke and Kevin Verbeek | Mapping polygons to the grid with small Hausdorff and Fréchet distance |
| Maarten Löffler, Frank Staals and Jerome Urhausen | New Results on Trajectory Grouping under Geodesic Distance |
| Konstanty Junosza-Szaniawski, Paweł Rzążewski, Joanna Sokół and Krzysztof Węsek | Coloring and L(2,1)-labeling of unit disk intersection graphs |
| Maike Buchin and Stef Sijben | Discrete Fréchet Distance for Uncertain Points |
| Joachim Gudmundsson, Irina Kostitsyna,Maarten Löffler, Vera Sacristán and Rodrigo I. Silveira | Beaconless geocast protocols are interesting, even in 1D |
| Charilaos Tzovas, Anna Karasoulou and Ioannis Emiris | Approximating Multidimensional Subset Sum and the Minkowski Decomposition of Polygons |
| Ioannis Emiris, Anna Karasoulou, Eleni Tzanaki and Zafeirakis Zafeirakopoulos | On the space of Minkowski summands of a convex polytope |
| Anika Rounds, Maarten Löffler, Hugo Akitaya and Greg Aloupis | Trash Compaction |