Table of Contents

• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Combinatorial Discrepancy for Boxes via the gamma_2 NormJirí Matousek, Aleksandar Nikolov. 1-15 [doi]
• Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global SignalsAaron Becker, Erik D. Demaine, Sándor P. Fekete, Hamed Mohtasham Shad, Rose Morris-Wright. 16-18 [doi]
• Automatic Proofs for Formulae Enumerating Proper PolycubesGill Barequet, Mira Shalah. 19-22 [doi]
• Visualizing Sparse FiltrationsNicholas J. Cavanna, Mahmoodreza Jahanseir, Donald R. Sheehy. 23-25 [doi]
• Visualizing Quickest Visibility MapsTopi Talvitie. 26-28 [doi]
• Sylvester-Gallai for Arrangements of SubspacesZeev Dvir, Guangda Hu. 29-43 [doi]
• Computational Aspects of the Colorful Carathéodory TheoremWolfgang Mulzer, Yannik Stein. 44-58 [doi]
• Semi-algebraic Ramsey NumbersAndrew Suk. 59-73 [doi]
• A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum SetOliver Roche-Newton. 74-80 [doi]
• A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex PolytopesMenelaos I. Karavelas, Eleni Tzanaki. 81-95 [doi]
• Two Proofs for Shallow PackingsKunal Dutta, Esther Ezra, Arijit Ghosh. 96-110 [doi]
• Shortest Path in a Polygon using Sublinear SpaceSariel Har-Peled. 111-125 [doi]
• Optimal Morphs of Convex DrawingsPatrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli. 126-140 [doi]
• 1-String B_2-VPG Representation of Planar GraphsTherese C. Biedl, Martin Derka. 141-155 [doi]
• Spanners and Reachability Oracles for Directed Transmission GraphsHaim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth. 156-170 [doi]
• Recognition and Complexity of Point Visibility GraphsJean Cardinal, Udo Hoffmann. 171-185 [doi]
• Geometric Spanners for Points Inside a Polygonal DomainMohammad Ali Abam, Marjan Adeli, Hamid Homapour, Pooya Zafar Asadollahpoor. 186-197 [doi]
• An Optimal Algorithm for the Separating Common Tangents of Two PolygonsMikkel Abrahamsen. 198-208 [doi]
• A Linear-Time Algorithm for the Geodesic Center of a Simple PolygonHee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh. 209-223 [doi]
• On the Smoothed Complexity of Convex HullsOlivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse. 224-238 [doi]
• Finding All Maximal Subsequences with Hereditary PropertiesDrago Bokal, Sergio Cabello, David Eppstein. 240-254 [doi]
• Riemannian Simplices and TriangulationsRamsay Dyer, Gert Vegter, Mathijs Wintraecken. 255-269 [doi]
• An Edge-Based Framework for Enumerating 3-Manifold TriangulationsBenjamin A. Burton, William Pettersson. 270-284 [doi]
• Order on Order TypesAlexander Pilz, Emo Welzl. 285-299 [doi]
• Limits of Order TypesXavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec. 300-314 [doi]
• Combinatorial Redundancy DetectionKomei Fukuda, Bernd Gärtner, May Szedlák. 315-328 [doi]
• Effectiveness of Local Search for Geometric OptimizationVincent Cohen-Addad, Claire Mathieu. 329-343 [doi]
• On the Shadow Simplex Method for Curved PolyhedraDaniel Dadush, Nicolai Hähnle. 345-359 [doi]
• Pattern Overlap Implies Runaway Growth in Hierarchical Tile SystemsHo-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho. 360-373 [doi]
• Space Exploration via Proximity SearchSariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel. 374-389 [doi]
• Star Unfolding from a Geodesic CurveStephen Kiazyk, Anna Lubiw. 390-404 [doi]
• The Dirac-Motzkin Problem on Ordinary Lines and the Orchard Problem (Invited Talk)Ben Jospeh Green. 405-405 [doi]
• On the Beer Index of Convexity and Its VariantsMartin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak. 406-420 [doi]
• Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art GalleriesFrank Hoffmann 0002, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert. 421-435 [doi]
• Low-Quality Dimension Reduction and High-Dimensional Approximate Nearest NeighborEvangelos Anagnostopoulos, Ioannis Z. Emiris, Ioannis Psarros. 436-450 [doi]
• Restricted Isometry Property for General p-NormsZeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn. 451-460 [doi]
• Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb GraphsUlrich Bauer, Elizabeth Munch, Yusu Wang. 461-475 [doi]
• On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability ResultXavier Goaoc, Isaac Mabillard, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner. 476-490 [doi]
• Comparing Graphs via Persistence DistortionTamal K. Dey, Dayu Shi, Yusu Wang. 491-506 [doi]
• Bounding Helly Numbers via Betti NumbersXavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner. 507-521 [doi]
• Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem RevisitedOrit E. Raz, Micha Sharir, Frank de Zeeuw. 522-536 [doi]
• Bisector Energy and Few Distinct DistancesBen Lund, Adam Sheffer, Frank de Zeeuw. 537-552 [doi]
• Incidences between Points and Lines in Three DimensionsMicha Sharir, Noam Solomon. 553-568 [doi]
• The Number of Unit-Area Triangles in the Plane: Theme and VariationsOrit E. Raz, Micha Sharir. 569-583 [doi]
• On the Number of Rich Lines in Truly High Dimensional SetsZeev Dvir, Sivakanth Gopi. 584-598 [doi]
• Realization Spaces of Arrangements of Convex BodiesMichael Gene Dobbins, Andreas Holmsen, Alfredo Hubard. 599-614 [doi]
• Computing Teichmüller Maps between PolygonsMayank Goswami, Xianfeng Gu, Vamsi Pingali, Gaurish Telang. 615-629 [doi]
• On-line Coloring between Two LinesStefan Felsner, Piotr Micek, Torsten Ueckerdt. 630-641 [doi]
• Building Efficient and Compact Data Structures for Simplicial ComplexesJean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas. 642-656 [doi]
• Shortest Path to a Segment and Quickest Visibility QueriesEsther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie. 658-673 [doi]
• Trajectory Grouping Structure under Geodesic DistanceIrina Kostitsyna, Marc J. van Kreveld, Maarten Löffler, Bettina Speckmann, Frank Staals. 674-688 [doi]
• From Proximity to Utility: A Voronoi Partition of Pareto OptimaHsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel. 689-703 [doi]
• Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice CoveringsDaniel Dadush. 704-718 [doi]
• Optimal Deterministic Algorithms for 2-d and 3-d Shallow CuttingsTimothy M. Chan, Konstantinos Tsakalidis. 719-732 [doi]
• A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three DimensionsTimothy M. Chan. 733-738 [doi]
• Approximability of the Discrete Fréchet DistanceKarl Bringmann, Wolfgang Mulzer. 739-753 [doi]
• The Hardness of Approximation of Euclidean k-MeansPranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop. 754-767 [doi]
• A Fire Fighter's ProblemRolf Klein, Elmar Langetepe, Christos Levcopoulos. 768-780 [doi]
• Approximate Geometric MST Range QueriesSunil Arya, David M. Mount, Eunhui Park. 781-795 [doi]
• Maintaining Contour Trees of Dynamic TerrainsPankaj K. Agarwal, Thomas Mølhave, Morten Revsbæk, Issam Safa, Yusu Wang, Jungwoo Yang. 796-811 [doi]
• Hyperorthogonal Well-Folded Hilbert CurvesArie Bos, Herman J. Haverkort. 812-826 [doi]
• Topological Analysis of Scalar Fields with OutliersMickaël Buchet, Frédéric Chazal, Tamal K. Dey, Fengtao Fan, Steve Y. Oudot, Yusu Wang. 827-841 [doi]
• On Computability and Triviality of Well GroupsPeter Franek, Marek Krcál. 842-856 [doi]
• Geometric Inference on Kernel Density EstimatesJeff M. Phillips, Bei Wang, Yan Zheng. 857-871 [doi]
• Modeling Real-World Data Sets (Invited Talk)Susanne Albers. 872-872 [doi]