Table of Contents

• Convex Polygon Containment: Improving Quadratic to Near Linear TimeTimothy M. Chan, Isaac M. Hair. [doi]
• A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ²Boris Aronov, Mark de Berg, Leonidas Theocharous. [doi]
• An Improved Lower Bound on the Number of Pseudoline ArrangementsFernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher. [doi]
• Robustly Guarding PolygonsRathish Das, Omrit Filtser, Matthew J. Katz, Joseph S. B. Mitchell. [doi]
• Dynamic Convex Hulls for Simple PathsBruce Brewer, Gerth Stølting Brodal, Haitao Wang 0001. [doi]
• Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the PlaneTimothy M. Chan, Pingan Cheng, Da-Wei Zheng. [doi]
• Algorithms for Halfplane Coverage and Related ProblemsHaitao Wang 0001, Jie Xue 0003. [doi]
• Discrete Fréchet Distance OraclesBoris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh. [doi]
• Nearly Orthogonal Sets over Finite FieldsDror Chawin, Ishay Haviv. [doi]
• On the Parameterized Complexity of Motion Planning for Rectangular RobotsIyad Kanj, Salman Parsa. [doi]
• Constrained and Ordered Level Planarity Parameterized by the Number of LevelsVáclav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff 0001, Johannes Zink 0001. [doi]
• Light, Reliable SpannersArnold Filtser, Yuval Gitlitz, Ofer Neiman. [doi]
• Strange Random Topology of the CircleUzu Lim. [doi]
• Priority-Driven Nesting of Irregular Polygonal Shapes Within a Convex Polygonal Container Based on a Hierarchical Integer Grid (CG Challenge)Martin Held. [doi]
• Faster Fréchet Distance Approximation Through Truncated SmoothingThijs van der Horst, Tim Ophelders. [doi]
• Sweeping Arrangements of Non-Piercing Regions in the PlaneSuryendu Dalal, Rahul Gangopadhyay, Rajiv Raman 0001, Saurabh Ray. [doi]
• Shadoks Approach to Knapsack Polygonal Packing (CG Challenge)Guilherme Dias da Fonseca, Yan Gerard. [doi]
• A Structure Theorem for Pseudo-Segments and Its ApplicationsJacob Fox, János Pach, Andrew Suk. [doi]
• Computing Shortest Closed Curves on Non-Orientable SurfacesDenys Bulavka, Éric Colin de Verdière, Niloufar Fuladi. [doi]
• Geometric Matching and Bottleneck ProblemsSergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer. [doi]
• Computing Zigzag Vineyard Efficiently Including Expansions and ContractionsTamal K. Dey, Tao Hou. [doi]
• Beyond Chromatic Threshold via (p, q)-Theorem, and Blow-Up PhenomenonHong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu. [doi]
• Maximum Betti Numbers of Čech ComplexesHerbert Edelsbrunner, János Pach. [doi]
• Plane Hamiltonian Cycles in Convex DrawingsHelena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, Manfred Scheucher. [doi]
• Enclosing Points with Geometric ObjectsTimothy M. Chan, Qizheng He, Jie Xue 0003. [doi]
• Optimal In-Place Compaction of Sliding Cubes (Media Exposition)Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann. [doi]
• Stability and Approximations for Decorated Reeb SpacesJustin Curry, Washington Mio, Tom Needham, Osman Berat Okutan, Florian Russold. [doi]
• Dimensionality of Hamming Metrics and Rademacher TypeAlexandros Eskenazis. [doi]
• Eight-Partitioning Points in 3D, and Efficiently TooBoris Aronov, Abdul Basit 0001, Indu Ramesh, Gianluca Tasinato, Uli Wagner 0001. [doi]
• Separator Theorem and Algorithms for Planar Hyperbolic GraphsSándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki. [doi]
• On Edge Collapse of Random Simplicial ComplexesJean-Daniel Boissonnat, Kunal Dutta, Soumik Dutta, Siddharth Pritam. [doi]
• Practical Software for Triangulating and Simplifying 4-ManifoldsRhuaidi Antonio Burke. [doi]
• Optimal Euclidean Tree CoversHsien-Chih Chang, Jonathan Conroy, Hung Le 0001, Lazar Milenkovic, Shay Solomon, Cuong Than. [doi]
• GPU Algorithm for Enumerating PL Spheres of Picard Number 4: Application to Toric TopologySuyoung Choi, Hyeontae Jang, Mathieu Vallée 0002. [doi]
• Map-Matching Queries Under Fréchet Distance on Low-Density SpannersKevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov 0001, Sampson Wong. [doi]
• Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand PatternJacob Focke, Florian Hörsch, Shaohua Li 0005, Dániel Marx. [doi]
• SCARST: Schnyder Compact and Regularity Sensitive Triangulation Data StructureLuca Castelli Aleardi, Olivier Devillers. [doi]
• Ipelets for the Convex Polygonal Geometry (Media Exposition)Nithin Parepally, Ainesh Chatterjee, Auguste H. Gezalyan, Hongyang Du, Sukrit Mangla, Kenny Wu, Sarah Hwang, David M. Mount. [doi]
• Communication Complexity and Discrepancy of HalfplanesManasseh Ahmed, Tsun Ming Cheung, Hamed Hatami, Kusha Sareen. [doi]
• Image Triangulation Using the Sobel Operator for Vertex Selection (Media Exposition)Olivia X. Laske, Lori Ziegelmeier. [doi]
• Efficient Algorithms for Complexes of Persistence Modules with ApplicationsTamal K. Dey, Florian Russold, Shreyas N. Samaga. [doi]
• Totally Geodesic Surfaces in Hyperbolic 3-Manifolds: Algorithms and ExamplesBrannon Basilio, Chaeryn Lee, Joseph Malionek. [doi]
• Morse Theory for the k-NN Distance FunctionYohai Reani, Omer Bobrowski. [doi]
• Optimal Algorithm for the Planar Two-Center ProblemKyungjin Cho, Eunjin Oh 0001, Haitao Wang 0001, Jie Xue 0003. [doi]
• A Coreset for Approximate Furthest-Neighbor Queries in a Simple PolygonMark de Berg, Leonidas Theocharous. [doi]
• Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the PlanePankaj K. Agarwal, Esther Ezra, Micha Sharir. [doi]
• Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update TimeSujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms. [doi]
• On the Number of Digons in Arrangements of Pairwise Intersecting CirclesEyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay. [doi]
• An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many MatchingSayan Bandyapadhyay, Jie Xue 0003. [doi]
• Demystifying Latschev's Theorem: Manifold Reconstruction from Noisy DataSushovan Majhi. [doi]
• Reconfiguration of Plane Trees in Convex Geometric GraphsNicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek. [doi]
• Approximating the Geometric Knapsack Problem in Near-Linear Time and DynamicallyMoritz Buchem, Paul Deuker, Andreas Wiese. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear SizeJoachim Gudmundsson, Martin P. Seybold, Sampson Wong. [doi]
• Measure-Theoretic Reeb Graphs and Reeb SpacesQingsong Wang, Guanqun Ma, Raghavendra Sridharamurthy, Bei Wang 0001. [doi]
• A Canonical Tree Decomposition for ChirotopesMathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin. [doi]
• Near Optimal Locality Sensitive Orderings in Euclidean SpaceZhimeng Gao, Sariel Har-Peled. [doi]
• ETH-Tight Algorithm for Cycle Packing on Unit Disk GraphsShinwoo An, Eunjin Oh 0001. [doi]
• A Topological Version of Schaefer's Dichotomy TheoremPatrick Schnider, Simon Weber 0001. [doi]
• A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of MovesZachary Abel, Hugo A. Akitaya, Scott Duke Kominers, Matias Korman, Frederick Stock. [doi]
• Visualizing Lucas's Hamiltonian Paths Through the Associahedron 1-Skeleton (Media Exposition)Kacey Thien-Huu La, Jose E. Arbelo, Christopher J. Tralie. [doi]
• Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of DirectionsFabrizio Grandoni 0001, Edin Husic, Mathieu Mari, Antoine Tinguely. [doi]
• Tight Bounds for the Learning of Homotopy à la Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian ManifoldsDominique Attali, Hana Dal Poz Kourimská, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, Mathijs Wintraecken. [doi]
• Computational Geometry Concept Videos: A Dual-Use Project in Education and Outreach (Media Exposition)Marjolein Haagsman, Maarten Löffler, Carola Wenk. [doi]
• Faster Approximation Scheme for Euclidean k-TSPErnest van Wijland, Hang Zhou 0001. [doi]
• Topological k-MetricsWillow Barkan-Vered, Huck Bennett, Amir Nayyeri. [doi]
• Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk GraphsHsien-Chih Chang, Jie Gao 0001, Hung Le 0001. [doi]
• Cup Product Persistence and Its Efficient ComputationTamal K. Dey, Abhishek Rathod. [doi]
• Wrapping Cycles in Delaunay Complexes: Bridging Persistent Homology and Discrete Morse TheoryUlrich Bauer, Fabian Roll. [doi]
• Moderate Dimension Reduction for k-Center ClusteringShaofeng H.-C. Jiang, Robert Krauthgamer, Shay Sapir. [doi]
• Fréchet Edit DistanceEmily Fox, Amir Nayyeri, Jonathan James Perry, Benjamin Raichel. [doi]
• Computing Maximum Polygonal Packings in Convex Polygons Using Best-Fit, Genetic Algorithms and ILPs (CG Challenge)Alkan Atak, Kevin Buchin, Mart Hagedoorn, Jona Heinrichs, Karsten Hogreve, Guangping Li 0001, Patrick Pawelczyk. [doi]
• An Improved Bound on Sums of Square Roots via the Subspace TheoremFriedrich Eisenbrand, Matthieu Haeberle, Neta Singer. [doi]
• Saturation Results Around the Erdős-Szekeres ProblemGábor Damásdi, Zichao Dong, Manfred Scheucher, Ji Zeng. [doi]
• Colorful Intersections and Tverberg PartitionsMichael Gene Dobbins, Andreas F. Holmsen, Dohyeon Lee. [doi]
• Effective Computation of the Heegaard Genus of 3-ManifoldsBenjamin A. Burton, Finn Thompson. [doi]
• A 1.9999-Approximation Algorithm for Vertex Cover on String GraphsDaniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Jie Xue 0003, Meirav Zehavi. [doi]
• Dynamic Geometric Connectivity in the Plane with Constant Query TimeTimothy M. Chan, Zhengcheng Huang. [doi]
• Space Complexity of Euclidean ClusteringXiaoyi Zhu, Yuxiang Tian, Lingxiao Huang, Zengfeng Huang. [doi]
• Clustering with Few Disks to Minimize the Sum of RadiiMikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, Leonidas Theocharous. [doi]
• Grid Peeling of ParabolasGünter Rote, Moritz Rüber, Morteza Saghafian. [doi]
• The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition)Dominique Attali, Hana Dal Poz Kourimská, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, Mathijs Wintraecken. [doi]
• Probabilistic Analysis of Multiparameter Persistence Decompositions into IntervalsÁngel Javier Alonso, Michael Kerber, Primoz Skraba. [doi]
• Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting SetsTim Planken, Torsten Ueckerdt. [doi]
• Hopf Arborescent Links, Minor Theory, and Decidability of the Genus DefectPierre Dehornoy, Corentin Lunel, Arnaud de Mesmay. [doi]
• Pach's Animal Problem Within the Bounding BoxMartin Tancer. [doi]
• Fine-Grained Complexity of Earth Mover's Distance Under TranslationKarl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen. [doi]
• The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient DiffeomorphismsHana Dal Poz Kourimská, André Lieutier, Mathijs Wintraecken. [doi]
• Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal DomainSarita de Berg, Tillmann Miltzow, Frank Staals. [doi]
• A General Heuristic Approach for Maximum Polygon Packing (CG Challenge)Canhui Luo, Zhouxing Su, Zhipeng Lü. [doi]
• Zarankiewicz's Problem via ε-t-NetsChaya Keller, Shakhar Smorodinsky. [doi]
• A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic SpaceSándor Kisfaludi-Bak, Geert van Wordragen. [doi]