Table of Contents

• Topological Data Analysis with Bregman DivergencesHerbert Edelsbrunner, Hubert Wagner. [doi]
• The Geometry and Topology of Crystals: From Sphere-Packing to Tiling, Nets, and Knots (Invited Talk)Vanessa Robins. [doi]
• On the Number of Ordinary Lines Determined by Sets in Complex SpaceAbdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf. [doi]
• Best Laid Plans of Lions and MenMikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen. [doi]
• A Quest to Unravel the Metric Structure Behind Perturbed NetworksSrinivasan Parthasarathy, David Sivakoff, Minghao Tian, Yusu Wang. [doi]
• Irrational Guards are Sometimes NeededMikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow. [doi]
• On Bend-Minimized Orthogonal Drawings of Planar 3-GraphsYi-Jun Chang, Hsu-Chun Yen. [doi]
• Lower Bounds for Differential Privacy from Gaussian WidthAssimakis Kattis, Aleksandar Nikolov. [doi]
• Locality-Sensitive Hashing of CurvesAnne Driemel, Francesco Silvestri. [doi]
• A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUMEsther Ezra, Micha Sharir. [doi]
• Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-DimensionKhaled Elbassioni. [doi]
• On Balls in a Hilbert Polygonal Geometry (Multimedia Contribution)Frank Nielsen, Laetitia Shao. [doi]
• Range-Clustering QueriesMikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi. [doi]
• Faster Algorithms for the Geometric Transportation ProblemPankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao. [doi]
• On Optimal 2- and 3-Planar GraphsMichael A. Bekos, Michael Kaufmann 0001, Chrysanthi N. Raftopoulou. [doi]
• A Superlinear Lower Bound on the Number of 5-HolesOswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber. [doi]
• Towards a Topology-Shape-Metrics Framework for Ortho-Radial DrawingsLukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf. [doi]
• On Planar Greedy Drawings of 3-Connected Planar GraphsGiordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati. [doi]
• Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution)Kevin Buchin, Jinhee Chun, Maarten Löffler, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto, Taichi Shiitada. [doi]
• Covering Lattice Points by Subspaces and Counting Point-Hyperplane IncidencesMartin Balko, Josef Cibulka, Pavel Valtr. [doi]
• Disjointness Graphs of SegmentsJános Pach, Gábor Tardos, Géza Tóth. [doi]
• Coloring Curves That Cross a Fixed CurveAlexandre Rok, Bartosz Walczak. [doi]
• Adaptive Planar Point LocationSiu-Wing Cheng, Man-Kit Lau. [doi]
• Declutter and Resample: Towards Parameter Free DenoisingMickaël Buchet, Tamal K. Dey, Jiayuan Wang, Yusu Wang. [doi]
• Origamizer: A Practical Algorithm for Folding Any PolyhedronErik D. Demaine, Tomohiro Tachi. [doi]
• Exact Algorithms for Terrain GuardingPradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi. [doi]
• Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike BackTimothy M. Chan. [doi]
• Computing Representative Networks for Braided RiversMaarten Kleinhans, Marc J. van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek. [doi]
• MatchTheNet - An Educational Game on 3-Dimensional Polytopes (Multimedia Contribution)Michael Joswig, Georg Loho, Benjamin Lorenz, Rico Raber. [doi]
• From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few VerticesAlexander Pilz, Emo Welzl, Manuel Wettstein. [doi]
• Algorithmic Interpretations of Fractal DimensionAnastasios Sidiropoulos, Vijay Sridhar. [doi]
• Ruler of the Plane - Games of Geometry (Multimedia Contribution)Sander Beekhuis, Kevin Buchin, Thom Castermans, Thom Hurks, Willem Sonke. [doi]
• An Approximation Algorithm for the Art Gallery ProblemÉdouard Bonnet, Tillmann Miltzow. [doi]
• Fine-Grained Complexity of Coloring Unit Disks and BallsCsaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski. [doi]
• Constrained Triangulations, Volumes of Polytopes, and Unit EquationsMichael Kerber, Robert Tichy, Mario Weitzer. [doi]
• Local Equivalence and Intrinsic Metrics between Reeb GraphsMathieu Carrière, Steve Oudot. [doi]
• Proper Coloring of Geometric HypergraphsBalázs Keszegh, Dömötör Pálvölgyi. [doi]
• Erdös-Hajnal Conjecture for Graphs with Bounded VC-DimensionJacob Fox, János Pach, Andrew Suk. [doi]
• Ham Sandwich is Equivalent to Borsuk-UlamKarthik C. S., Arpan Saha. [doi]
• Near-Optimal epsilon-Kernel Construction and Related ProblemsSunil Arya, Guilherme Dias da Fonseca, David M. Mount. [doi]
• Approximate Range Counting RevisitedSaladi Rahul. [doi]
• Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial PartitioningKunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa. [doi]
• The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk)Micha Sharir. [doi]
• A Universal Slope Set for 1-Bend Planar DrawingsPatrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani. [doi]
• Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution)Aaron T. Becker, Mustapha Debboun, Sándor P. Fekete, Dominik Krupke, An Nguyen. [doi]
• High Dimensional Consistent Digital SegmentsMan-Kwun Chiu, Matias Korman. [doi]
• Implementing Delaunay Triangulations of the Bolza SurfaceIordan Iordanov, Monique Teillaud. [doi]
• Minimum Perimeter-Sum Partitions in the PlaneMikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi. [doi]
• A Spectral Gap Precludes Low-Dimensional EmbeddingsAssaf Naor. [doi]
• Reachability in a Planar Subdivision with Direction ConstraintsDaniel Binham, Pedro Machado Manhaes de Castro, Antoine Vigneron. [doi]
• Maximum Volume Subset Selection for Anchored BoxesKarl Bringmann, Sergio Cabello, Michael T. M. Emmerich. [doi]
• Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple PolygonEunjin Oh 0001, Hee-Kap Ahn. [doi]
• Topological Analysis of Nerves, Reeb Spaces, Mappers, and Multiscale MappersTamal K. Dey, Facundo Mémoli, Yusu Wang. [doi]
• A Proof of the Orbit Conjecture for Flipping Edge-Labelled TriangulationsAnna Lubiw, Zuzana Masárová, Uli Wagner. [doi]
• TSP With Locational Uncertainty: The Adversarial ModelGui Citovsky, Tyler Mayer, Joseph S. B. Mitchell. [doi]
• Applications of Chebyshev Polynomials to Low-Dimensional Computational GeometryTimothy M. Chan. [doi]
• Self-Approaching Paths in Simple PolygonsProsenjit Bose, Irina Kostitsyna, Stefan Langerman. [doi]
• Dynamic Geodesic Convex Hulls in Dynamic Simple PolygonsEunjin Oh 0001, Hee-Kap Ahn. [doi]
• Anisotropic Triangulations via Discrete Riemannian Voronoi DiagramsJean-Daniel Boissonnat, Mael Rouxel-Labbé, Mathijs Wintraecken. [doi]
• Quickest Visibility Queries in Polygonal DomainsHaitao Wang. [doi]
• Cardiac Trabeculae Segmentation: an Application of Computational Topology (Multimedia Contribution)Chao Chen, Dimitris N. Metaxas, Yusu Wang, Pengxiang Wu. [doi]
• Dynamic Orthogonal Range Searching on the RAM, RevisitedTimothy M. Chan, Konstantinos Tsakalidis. [doi]
• Subquadratic Algorithms for Algebraic Generalizations of 3SUMLuis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon. [doi]
• Barcodes of Towers and a Streaming Algorithm for Persistent HomologyMichael Kerber, Hannah Schreiber. [doi]
• Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors [doi]
• Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the PlaneHaitao Wang. [doi]
• Computing the Geometric Intersection Number of CurvesVincent Despré, Francis Lazarus. [doi]
• Computing the Fréchet Gap DistanceChenglin Fan, Benjamin Raichel. [doi]