LIPIcs, Volume 77, SoCG 2017

• Boris Aronov and Matthew J. Katz LIPIcs, Volume 77, SoCG'17, Complete Volume 10.4230/LIPIcs.SoCG.2017
• Boris Aronov and Matthew J. Katz Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors 10.4230/LIPIcs.SoCG.2017.0
• Vanessa Robins The Geometry and Topology of Crystals: From Sphere-Packing to Tiling, Nets, and Knots (Invited Talk) 10.4230/LIPIcs.SoCG.2017.1
• Micha Sharir The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk) 10.4230/LIPIcs.SoCG.2017.2
• Mikkel Abrahamsen, Anna Adamaszek, and Tillmann Miltzow Irrational Guards are Sometimes Needed 10.4230/LIPIcs.SoCG.2017.3
• Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, and Ali D. Mehrabi Minimum Perimeter-Sum Partitions in the Plane 10.4230/LIPIcs.SoCG.2017.4
• Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, and Ali D. Mehrabi Range-Clustering Queries 10.4230/LIPIcs.SoCG.2017.5
• Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, and Christian Wulff-Nilsen Best Laid Plans of Lions and Men 10.4230/LIPIcs.SoCG.2017.6
• Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, and Allen Xiao Faster Algorithms for the Geometric Transportation Problem 10.4230/LIPIcs.SoCG.2017.7
• Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, and Birgit Vogtenhuber A Superlinear Lower Bound on the Number of 5-Holes 10.4230/LIPIcs.SoCG.2017.8
• Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, and Fabrizio Montecchiani A Universal Slope Set for 1-Bend Planar Drawings 10.4230/LIPIcs.SoCG.2017.9
• Sunil Arya, Guilherme D. da Fonseca, and David M. Mount Near-Optimal epsilon-Kernel Construction and Related Problems 10.4230/LIPIcs.SoCG.2017.10
• Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, and Meirav Zehavi Exact Algorithms for Terrain Guarding 10.4230/LIPIcs.SoCG.2017.11
• Martin Balko, Josef Cibulka, and Pavel Valtr Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences 10.4230/LIPIcs.SoCG.2017.12
• Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, and Noam Solomon Subquadratic Algorithms for Algebraic Generalizations of 3SUM 10.4230/LIPIcs.SoCG.2017.13
• Lukas Barth, Benjamin Niedermann, Ignaz Rutter, and Matthias Wolf Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings 10.4230/LIPIcs.SoCG.2017.14
• Abdul Basit, Zeev Dvir, Shubhangi Saraf, and Charles Wolf On the Number of Ordinary Lines Determined by Sets in Complex Space 10.4230/LIPIcs.SoCG.2017.15
• Michael A. Bekos, Michael Kaufmann, and Chrysanthi N. Raftopoulou On Optimal 2- and 3-Planar Graphs 10.4230/LIPIcs.SoCG.2017.16
• Daniel Binham, Pedro Machado Manhaes de Castro, and Antoine Vigneron Reachability in a Planar Subdivision with Direction Constraints 10.4230/LIPIcs.SoCG.2017.17
• Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, and Pawel Rzazewski Fine-Grained Complexity of Coloring Unit Disks and Balls 10.4230/LIPIcs.SoCG.2017.18
• Jean-Daniel Boissonnat, Mael Rouxel-Labbé, and Mathijs Wintraecken Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams 10.4230/LIPIcs.SoCG.2017.19
• Édouard Bonnet and Tillmann Miltzow An Approximation Algorithm for the Art Gallery Problem 10.4230/LIPIcs.SoCG.2017.20
• Prosenjit Bose, Irina Kostitsyna, and Stefan Langerman Self-Approaching Paths in Simple Polygons 10.4230/LIPIcs.SoCG.2017.21
• Karl Bringmann, Sergio Cabello, and Michael T. M. Emmerich Maximum Volume Subset Selection for Anchored Boxes 10.4230/LIPIcs.SoCG.2017.22
• Mickael Buchet, Tamal K. Dey, Jiayuan Wang, and Yusu Wang Declutter and Resample: Towards Parameter Free Denoising 10.4230/LIPIcs.SoCG.2017.23
• Karthik C. S. and Arpan Saha Ham Sandwich is Equivalent to Borsuk-Ulam 10.4230/LIPIcs.SoCG.2017.24
• Mathieu Carrière and Steve Oudot Local Equivalence and Intrinsic Metrics between Reeb Graphs 10.4230/LIPIcs.SoCG.2017.25
• Timothy M. Chan Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry 10.4230/LIPIcs.SoCG.2017.26
• Timothy M. Chan Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back 10.4230/LIPIcs.SoCG.2017.27
• Timothy M. Chan and Konstantinos Tsakalidis Dynamic Orthogonal Range Searching on the RAM, Revisited 10.4230/LIPIcs.SoCG.2017.28
• Yi-Jun Chang and Hsu-Chun Yen On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs 10.4230/LIPIcs.SoCG.2017.29
• Siu-Wing Cheng and Man-Kit Lau Adaptive Planar Point Location 10.4230/LIPIcs.SoCG.2017.30
• Man-Kwun Chiu and Matias Korman High Dimensional Consistent Digital Segments 10.4230/LIPIcs.SoCG.2017.31
• Gui Citovsky, Tyler Mayer, and Joseph S. B. Mitchell TSP With Locational Uncertainty: The Adversarial Model 10.4230/LIPIcs.SoCG.2017.32
• Giordano Da Lozzo, Anthony D'Angelo, and Fabrizio Frati On Planar Greedy Drawings of 3-Connected Planar Graphs 10.4230/LIPIcs.SoCG.2017.33
• Erik D. Demaine and Tomohiro Tachi Origamizer: A Practical Algorithm for Folding Any Polyhedron 10.4230/LIPIcs.SoCG.2017.34
• Vincent Despré and Francis Lazarus Computing the Geometric Intersection Number of Curves 10.4230/LIPIcs.SoCG.2017.35
• Tamal K. Dey, Facundo Mémoli, and Yusu Wang Topological Analysis of Nerves, Reeb Spaces, Mappers, and Multiscale Mappers 10.4230/LIPIcs.SoCG.2017.36
• Anne Driemel and Francesco Silvestri Locality-Sensitive Hashing of Curves 10.4230/LIPIcs.SoCG.2017.37
• Kunal Dutta, Arijit Ghosh, Bruno Jartoux, and Nabil H. Mustafa Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning 10.4230/LIPIcs.SoCG.2017.38
• Herbert Edelsbrunner and Hubert Wagner Topological Data Analysis with Bregman Divergences 10.4230/LIPIcs.SoCG.2017.39
• Khaled Elbassioni Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension 10.4230/LIPIcs.SoCG.2017.40
• Esther Ezra and Micha Sharir A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM 10.4230/LIPIcs.SoCG.2017.41
• Chenglin Fan and Benjamin Raichel Computing the Fréchet Gap Distance 10.4230/LIPIcs.SoCG.2017.42
• Jacob Fox, János Pach, and Andrew Suk Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension 10.4230/LIPIcs.SoCG.2017.43
• Iordan Iordanov and Monique Teillaud Implementing Delaunay Triangulations of the Bolza Surface 10.4230/LIPIcs.SoCG.2017.44
• Assimakis Kattis and Aleksandar Nikolov Lower Bounds for Differential Privacy from Gaussian Width 10.4230/LIPIcs.SoCG.2017.45
• Michael Kerber, Robert Tichy, and Mario Weitzer Constrained Triangulations, Volumes of Polytopes, and Unit Equations 10.4230/LIPIcs.SoCG.2017.46
• Balázs Keszegh and Dömötör Pálvölgyi Proper Coloring of Geometric Hypergraphs 10.4230/LIPIcs.SoCG.2017.47
• Maarten Kleinhans, Marc van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, and Kevin Verbeek Computing Representative Networks for Braided Rivers 10.4230/LIPIcs.SoCG.2017.48
• Anna Lubiw, Zuzana Masárová, and Uli Wagner A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations 10.4230/LIPIcs.SoCG.2017.49
• Assaf Naor A Spectral Gap Precludes Low-Dimensional Embeddings 10.4230/LIPIcs.SoCG.2017.50
• Eunjin Oh and Hee-Kap Ahn Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons 10.4230/LIPIcs.SoCG.2017.51
• Eunjin Oh and Hee-Kap Ahn Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon 10.4230/LIPIcs.SoCG.2017.52
• Srinivasan Parthasarathy, David Sivakoff, Minghao Tian, and Yusu Wang A Quest to Unravel the Metric Structure Behind Perturbed Networks 10.4230/LIPIcs.SoCG.2017.53
• Alexander Pilz, Emo Welzl, and Manuel Wettstein From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices 10.4230/LIPIcs.SoCG.2017.54
• Saladi Rahul Approximate Range Counting Revisited 10.4230/LIPIcs.SoCG.2017.55
• Alexandre Rok and Bartosz Walczak Coloring Curves That Cross a Fixed Curve 10.4230/LIPIcs.SoCG.2017.56
• Michael Kerber and Hannah Schreiber Barcodes of Towers and a Streaming Algorithm for Persistent Homology 10.4230/LIPIcs.SoCG.2017.57
• Anastasios Sidiropoulos and Vijay Sridhar Algorithmic Interpretations of Fractal Dimension 10.4230/LIPIcs.SoCG.2017.58
• János Pach, Gábor Tardos, and Géza Tóth Disjointness Graphs of Segments 10.4230/LIPIcs.SoCG.2017.59
• Haitao Wang Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane 10.4230/LIPIcs.SoCG.2017.60
• Haitao Wang Quickest Visibility Queries in Polygonal Domains 10.4230/LIPIcs.SoCG.2017.61
• Aaron T. Becker, Mustapha Debboun, Sándor P. Fekete, Dominik Krupke, and An Nguyen Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution) 10.4230/LIPIcs.SoCG.2017.62
• Sander Beekhuis, Kevin Buchin, Thom Castermans, Thom Hurks, and Willem Sonke Ruler of the Plane - Games of Geometry (Multimedia Contribution) 10.4230/LIPIcs.SoCG.2017.63
• Kevin Buchin, Jinhee Chun, Maarten Löffler, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto, and Taichi Shiitada Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution) 10.4230/LIPIcs.SoCG.2017.64
• Chao Chen, Dimitris Metaxas, Yusu Wang, and Pengxiang Wu Cardiac Trabeculae Segmentation: an Application of Computational Topology (Multimedia Contribution) 10.4230/LIPIcs.SoCG.2017.65
• Michael Joswig, Georg Loho, Benjamin Lorenz, and Rico Raber MatchTheNet - An Educational Game on 3-Dimensional Polytopes (Multimedia Contribution) 10.4230/LIPIcs.SoCG.2017.66
• Frank Nielsen and Laetitia Shao On Balls in a Hilbert Polygonal Geometry (Multimedia Contribution) 10.4230/LIPIcs.SoCG.2017.67