Accepted Papers
Download a zip file containing all papers.
- Eyal Ackerman. A note on 1-planar graphs
- Aviv Adler, Mark De Berg, Dan Halperin and Kiril Solovey. Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons
- Carlos Alegría-Galicia, David Orden, Carlos Seara and Jorge Urrutia. On the O-hull of planar point sets
- Sander Alewijnse, Quirijn Bouts, Alex Ten Brink and Kevin Buchin. Distribution-Sensitive Construction of the Greedy Spanner
- Sander Alewijnse, Kevin Buchin, Maike Buchin, Stef Sijben and Michel Westenberg. Model-based Segmentation and Classification of Trajectories
- Esther Arkin, Alon Efrat, Joseph Mitchell and Eli Packer. Hybrid Algorithms for Scheduling Sensors for Guarding Polygonal Domains
- Boris Aronov, Mark De Berg, David Eppstein, Marcel Roeloffzen and Bettina Speckmann. Distance-Sensitive Point Location Made Easy
- Gill Barequet and Evanthia Papadopoulou. On Farthest-Site Voronoi Diagrams of Line Segments and Lines in Three and Higher Dimensions
- Gill Barequet, Guenter Rote and Mira Shalah. $\lambda>4$
- Or Bartal and Leo Joskowicz. Euclidean Minimum Spanning Tree With Dependent Uncertainties
- Rinat Ben-Avraham, Orit E. Raz, Micha Sharir and Igor Tubis. Local Minima of the Hausdorff RMS-distance Under Translation
- Boaz Ben-Moshe, Nir Shvalb, Shamil Ploit and Guilad Suissa. Air Brush --- a Geometric Imaging Device for the Visually Impaired
- Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser and Peter Palfrader. Straight Skeletons of Monotone Polygons
- Therese Biedl, Stefan Huber and Peter Palfrader. Stable Roommates for Weighted Straight Skeletons
- Cecilia Bohler, Rolf Klein and Chih-Hung Liu. Forest-Like Abstract Voronoi Diagrams in Linear Time
- Kevin Buchin, Rafael Cano, Pedro J. de Rezende, Cid de Souza and Bettina Speckmann. Sea Regions for Rectangular Cartograms
- Kevin Buchin, Irina Kostitsyna, Maarten Löffler and Rodrigo Silveira. Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
- Francisc Bungiu, Michael Hemmer, John Hershberger, Kan Huang and Alexander Kröller. Efficient Computation of Visibility Polygons
- Benjamin Burton, Éric Colin de Verdière and Arnaud De Mesmay. On the Complexity of Immersed Normal Surfaces
- Sergio Cabello, Otfried Cheong and Lena Schlipf. Finding Largest Rectangles in Convex Polygons
- Louis Cuel, Jacques-Olivier Lachaud, Quentin Mérigot and Boris Thibert. Robust Normal Estimation using Order-k Voronoi Covariance
- Michael Gene Dobbins and Heuna Kim. Packing Segments in a Convex 3-Polytope is NP-hard
- Ramsay Dyer, Gert Vegter and Mathijs Wintraecken. Intrinsic simplices on Riemannian manifolds
- Ioannis Emiris and Vissarion Fisikopoulos. Efficient Random-Walk Methods for Approximating Polytope Volume
- Ioannis Emiris and Ioannis Psarros. Nearest Neighbor Search in Lower Dimensional Flats
- William Evans, Stefan Felsner, Stephen Kobourov and Torsten Ueckerdt. Graphs admitting d-realizers: tree-decompositions and box-representations
- William Evans, David Kirkpatrick, Maarten Löffler and Frank Staals. Query Strategies for Minimizing the Ply of the Potential Locations of Entities Moving with Different Speeds
- Sándor Fekete, Stephan Friedrichs and Michael Hemmer. Complexity of the General Chromatic Art Gallery Problem
- Clinton Freeman, David L. Millman and Jack Snoeyink. Gift Wrapping the Integer Hull in the Plane
- Andreas Gemsa, Benjamin Niedermann and Martin Nöllenburg. Label Placement in Road Maps
- Panos Giannopoulos, Maximilian Konzack and Wolfgang Mulzer. Low-Crossing Spanning Trees: an Alternative Proof and Experiments
- Sathish Govindarajan and Gabriel Nivasch. A variant of the Hadwiger-Debrunner (p,q)-problem in the plane
- Ivaylo Ilinkin. Experimental Evaluation of Parametric Search Algorithms
- Rafel Jaume and Matthias Henze. Bottleneck Partial-Matching Voronoi Diagrams
- Leo Joskowicz and Yonathan Myers. Topological Stability and Convex Hull with Dependent Uncertainties
- Haim Kaplan, Wolfgang Mulzer, Liam Roditty and Paul Seiferth. Reachability Oracles for Disk Transmission Graphs
- Balázs Keszegh. Covering Paths and Trees for Planar Grids
- Elena Khramtcova and Evanthia Papadopoulou. A Simple RIC for the Hausdorff Voronoi Diagram of Non-crossing Clusters
- Christian Knauer and Fabian Stehn. Elastic Shape Matching is NP-hard for Point Sets under Hausdorff Distance
- Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz and Birgit Vogtenhuber. Minimum Dual Diameter Triangulations
- Maarten Löffler, Maria Saumell and Rodrigo Silveira. A faster algorithm to compute the visibility map of a 1.5D terrain
- Tillmann Miltzow, Michael Hoffmann and Vincent Kusters. Separating Balls with a Hyperplane
- Wolfgang Mulzer and Yannik Stein. Complexity of Finding Nearest Colorful Polytopes
- Bengt J. Nilsson and Pawel Zylinski. How to Keep an Eye on a Few Small Things
- Orit E. Raz, Micha Sharir and Jozsef Solymosi. On triple intersections of three families of unit circles
- Andreas Reimer and Maxim Rylov. Point-feature lettering of high cartographic quality: A multi-criteria model with practical implementation
- Günter Rote. Lexicographic Fréchet Matchings
- Micha Sharir and Noam Solomon. Incidences between points and lines in R^4
- Birgit Strodthoff and Bert Juettler. Computation of Layered Reeb Graphs
- Peter L. Varkonyi. The secret of gambling with irregular dice: estimating the face statistics of polyhedra
- Birgit Vogtenhuber, Oswin Aichholzer, Thomas Hackl, Alexander Pilz, Sarah Lutteropp and Tamara Mchedlidze. Monotone Simultaneous Embedding of Directed Paths
