Table of Contents

• A New Lower Bound for Semigroup Orthogonal Range SearchingPeyman Afshani. [doi]
• A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition)Maarten Löffler. [doi]
• Computing Persistent Homology of Flag Complexes via Strong CollapsesJean-Daniel Boissonnat, Siddharth Pritam. [doi]
• An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial LiftingXavier Goaoc, Andreas Holmsen, Cyril Nicaud. [doi]
• Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric MatricesRadoslav Fulek, Jan Kyncl. [doi]
• Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition)Gill Barequet, Gil Ben-Shachar. [doi]
• Rods and Rings: Soft Subdivision Planner for R^3 x S^2Ching-Hsiang Hsu, Yi-Jen Chiang, Chee Yap. [doi]
• Independent Range Sampling, Revisited AgainPeyman Afshani, Jeff M. Phillips. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Dynamic Planar Point Location in External MemoryJ. Ian Munro, Yakov Nekrich. [doi]
• Chunk Reduction for Multi-Parameter Persistent HomologyUlderico Fugacci, Michael Kerber. [doi]
• Exact Computation of the Matching Distance on 2-Parameter Persistence ModulesMichael Kerber, Michael Lesnick, Steve Oudot. [doi]
• DTM-Based FiltrationsHirokazu Anai, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hiroya Inakoshi, Raphaël Tinarrage, Yuhei Umeda. [doi]
• Searching for the Closest-Pair in a Query TranslateJie Xue, Yuan Li, Saladi Rahul, Ravi Janardan. [doi]
• On the Complexity of the k-Level in Arrangements of PseudoplanesMicha Sharir, Chen Ziv. [doi]
• The One-Way Communication Complexity of Dynamic Time Warping DistanceVladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang. [doi]
• Counting Polygon Triangulations is HardDavid Eppstein. [doi]
• 3-Manifold Triangulations with Small TreewidthKristóf Huszár, Jonathan Spreer. [doi]
• The Crossing Tverberg TheoremRadoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner 0001. [doi]
• On the Chromatic Number of Disjointness Graphs of CurvesJános Pach, István Tomon. [doi]
• Upward Book Embeddings of st-GraphsCarla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani. [doi]
• Dual Circumference and Collinear SetsVida Dujmovic, Pat Morin. [doi]
• Dynamic Geometric Data Structures via Shallow CuttingsTimothy M. Chan. [doi]
• Cubic Planar Graphs That Cannot Be Drawn On Few LinesDavid Eppstein. [doi]
• When Convexity Helps Collapsing ComplexesDominique Attali, André Lieutier, David Salinas. [doi]
• Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk GraphsHaitao Wang 0001, Jie Xue. [doi]
• Topologically Trivial Closed Walks in Directed Surface GraphsJeff Erickson 0001, Yipu Wang. [doi]
• On Grids in Point-Line Arrangements in the PlaneMozhgan Mirzaei, Andrew Suk. [doi]
• Smallest k-Enclosing Rectangle RevisitedTimothy M. Chan, Sariel Har-Peled. [doi]
• Connecting the Dots (with Minimum Crossings)Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh 0001, Meirav Zehavi. [doi]
• Efficient Algorithms for Geometric Partial MatchingPankaj K. Agarwal, Hsien-Chih Chang, Allen Xiao. [doi]
• On Weak epsilon-Nets and the Radon NumberShay Moran, Amir Yehudayoff. [doi]
• Circumscribing Polygons and Polygonizations for Disjoint Line SegmentsHugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth. [doi]
• The Unbearable Hardness of UnknottingArnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer. [doi]
• Morphing Contact Representations of GraphsPatrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli. [doi]
• Topological Data Analysis in Information SpaceHerbert Edelsbrunner, Ziga Virk, Hubert Wagner. [doi]
• General Techniques for Approximate Incidences and Their Application to the Camera Posing ProblemDror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl. [doi]
• Semi-Algebraic Colorings of Complete GraphsJacob Fox, János Pach, Andrew Suk. [doi]
• Packing Disks into Disks with Optimal Worst-Case DensitySándor P. Fekete, Phillip Keldenich, Christian Scheffer. [doi]
• A Geometric Data Structure from Neuroscience (Invited Talk)Sanjoy Dasgupta. [doi]
• Some Geometric and Computational Challenges Arising in Structural Molecular Biology (Invited Talk)Bruce Randall Donald. [doi]
• A Spanner for the Day AfterKevin Buchin, Sariel Har-Peled, Dániel Oláh. [doi]
• Ham-Sandwich Cuts and Center Transversals in SubspacesPatrick Schnider. [doi]
• Optimal Algorithm for Geodesic Farthest-Point Voronoi DiagramsLuis Barba. [doi]
• Polyline Simplification has Cubic ComplexityKarl Bringmann, Bhaskar Ray Chaudhury. [doi]
• On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert SpacesMathieu Carrière, Ulrich Bauer. [doi]
• Algorithms for Metric Learning via Contrastive EmbeddingsDiego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos. [doi]
• Convex Polygons in Cartesian ProductsJean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot. [doi]
• A Product Inequality for Extreme DistancesAdrian Dumitrescu. [doi]
• Computing Shapley Values in the PlaneSergio Cabello, Timothy M. Chan. [doi]
• Preconditioning for the Geometric Transportation ProblemAndrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov. [doi]
• Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet DistanceKarl Bringmann, Marvin Künnemann, André Nusser. [doi]
• Maintaining the Union of Unit Discs Under Insertions with Near-Optimal OverheadPankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer. [doi]
• Probabilistic Smallest Enclosing Ball in High Dimensions via Subgradient SamplingAmer Krivosija, Alexander Munteanu. [doi]
• Efficient Algorithms for Ortho-Radial Graph DrawingBenjamin Niedermann, Ignaz Rutter, Matthias Wolf 0004. [doi]
• A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric SettingsNathaniel Lahn, Sharath Raghvendra. [doi]
• Journey to the Center of the Point SetSariel Har-Peled, Mitchell Jones. [doi]
• Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera. [doi]
• The VC Dimension of Metric Balls Under Fréchet and Hausdorff DistancesAnne Driemel, Jeff M. Phillips, Ioannis Psarros. [doi]
• An Efficient Algorithm for Generalized Polynomial Partitioning and Its ApplicationsPankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl. [doi]
• Preprocessing Ambiguous Imprecise PointsIvor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann. [doi]
• Fréchet View - A Tool for Exploring Fréchet Distance Algorithms (Multimedia Exposition)Peter Schäfer. [doi]
• Distribution-Sensitive Bounds on Relative Approximations of Geometric RangesYufei Tao, Yu Wang. [doi]
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, Christian Scheffer. [doi]
• Almost Tight Lower Bounds for Hard Cutting Problems in Embedded GraphsVincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay. [doi]
• A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal DomainsHaitao Wang 0001. [doi]
• Lower Bounds for Electrical Reduction on SurfacesHsien-Chih Chang, Marcos Cossarini, Jeff Erickson 0001. [doi]