LIPIcs, Volume 293, SoCG 2024

• Wolfgang Mulzer and Jeff M. Phillips LIPIcs, Volume 293, SoCG 2024, Complete Volume 10.4230/LIPIcs.SoCG.2024
• Wolfgang Mulzer and Jeff M. Phillips Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.SoCG.2024.0
• Zachary Abel, Hugo A. Akitaya, Scott Duke Kominers, Matias Korman, and Frederick Stock A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves 10.4230/LIPIcs.SoCG.2024.1
• Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, and Leonidas Theocharous Clustering with Few Disks to Minimize the Sum of Radii 10.4230/LIPIcs.SoCG.2024.2
• Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, and Rebeka Raffay On the Number of Digons in Arrangements of Pairwise Intersecting Circles 10.4230/LIPIcs.SoCG.2024.3
• Pankaj K. Agarwal, Esther Ezra, and Micha Sharir Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane 10.4230/LIPIcs.SoCG.2024.4
• Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, and Kusha Sareen Communication Complexity and Discrepancy of Halfplanes 10.4230/LIPIcs.SoCG.2024.5
• Ángel Javier Alonso, Michael Kerber, and Primoz Skraba Probabilistic Analysis of Multiparameter Persistence Decompositions into Intervals 10.4230/LIPIcs.SoCG.2024.6
• Shinwoo An and Eunjin Oh ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs 10.4230/LIPIcs.SoCG.2024.7
• Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner Eight-Partitioning Points in 3D, and Efficiently Too 10.4230/LIPIcs.SoCG.2024.8
• Boris Aronov, Mark de Berg, and Leonidas Theocharous A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ² 10.4230/LIPIcs.SoCG.2024.9
• Boris Aronov, Tsuri Farhana, Matthew J. Katz, and Indu Ramesh Discrete Fréchet Distance Oracles 10.4230/LIPIcs.SoCG.2024.10
• Dominique Attali, Hana Dal Poz Kouřimská, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, and Mathijs Wintraecken Tight Bounds for the Learning of Homotopy à la Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds 10.4230/LIPIcs.SoCG.2024.11
• Sayan Bandyapadhyay and Jie Xue An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching 10.4230/LIPIcs.SoCG.2024.12
• Willow Barkan, Huck Bennett, and Amir Nayyeri Topological k-Metrics 10.4230/LIPIcs.SoCG.2024.13
• Brannon Basilio, Chaeryn Lee, and Joseph Malionek Totally Geodesic Surfaces in Hyperbolic 3-Manifolds: Algorithms and Examples 10.4230/LIPIcs.SoCG.2024.14
• Ulrich Bauer and Fabian Roll Wrapping Cycles in Delaunay Complexes: Bridging Persistent Homology and Discrete Morse Theory 10.4230/LIPIcs.SoCG.2024.15
• Mark de Berg and Leonidas Theocharous A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon 10.4230/LIPIcs.SoCG.2024.16
• Sarita de Berg, Tillmann Miltzow, and Frank Staals Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain 10.4230/LIPIcs.SoCG.2024.17
• Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, and Manfred Scheucher Plane Hamiltonian Cycles in Convex Drawings 10.4230/LIPIcs.SoCG.2024.18
• Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, and Jules Wulms Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time 10.4230/LIPIcs.SoCG.2024.19
• Václav Blažej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, and Johannes Zink Constrained and Ordered Level Planarity Parameterized by the Number of Levels 10.4230/LIPIcs.SoCG.2024.20
• Jean-Daniel Boissonnat, Kunal Dutta, Soumik Dutta, and Siddharth Pritam On Edge Collapse of Random Simplicial Complexes 10.4230/LIPIcs.SoCG.2024.21
• Nicolas Bousquet, Lucas de Meyer, Théo Pierron, and Alexandra Wesolek Reconfiguration of Plane Trees in Convex Geometric Graphs 10.4230/LIPIcs.SoCG.2024.22
• Mathilde Bouvel, Valentin Feray, Xavier Goaoc, and Florent Koechlin A Canonical Tree Decomposition for Chirotopes 10.4230/LIPIcs.SoCG.2024.23
• Bruce Brewer, Gerth Stølting Brodal, and Haitao Wang Dynamic Convex Hulls for Simple Paths 10.4230/LIPIcs.SoCG.2024.24
• Karl Bringmann, Frank Staals, Karol Węgrzycki, and Geert van Wordragen Fine-Grained Complexity of Earth Mover’s Distance Under Translation 10.4230/LIPIcs.SoCG.2024.25
• Moritz Buchem, Paul Deuker, and Andreas Wiese Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically 10.4230/LIPIcs.SoCG.2024.26
• Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, and Sampson Wong Map-Matching Queries Under Fréchet Distance on Low-Density Spanners 10.4230/LIPIcs.SoCG.2024.27
• Denys Bulavka, Éric Colin de Verdière, and Niloufar Fuladi Computing Shortest Closed Curves on Non-Orientable Surfaces 10.4230/LIPIcs.SoCG.2024.28
• Rhuaidi Antonio Burke Practical Software for Triangulating and Simplifying 4-Manifolds 10.4230/LIPIcs.SoCG.2024.29
• Benjamin A. Burton and Finn Thompson Effective Computation of the Heegaard Genus of 3-Manifolds 10.4230/LIPIcs.SoCG.2024.30
• Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, and Christian Knauer Geometric Matching and Bottleneck Problems 10.4230/LIPIcs.SoCG.2024.31
• Luca Castelli Aleardi and Olivier Devillers SCARST: Schnyder Compact and Regularity Sensitive Triangulation Data Structure 10.4230/LIPIcs.SoCG.2024.32
• Timothy M. Chan, Pingan Cheng, and Da Wei Zheng Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane 10.4230/LIPIcs.SoCG.2024.33
• Timothy M. Chan and Isaac M. Hair Convex Polygon Containment: Improving Quadratic to Near Linear Time 10.4230/LIPIcs.SoCG.2024.34
• Timothy M. Chan, Qizheng He, and Jie Xue Enclosing Points with Geometric Objects 10.4230/LIPIcs.SoCG.2024.35
• Timothy M. Chan and Zhengcheng Huang Dynamic Geometric Connectivity in the Plane with Constant Query Time 10.4230/LIPIcs.SoCG.2024.36
• Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, and Cuong Than Optimal Euclidean Tree Covers 10.4230/LIPIcs.SoCG.2024.37
• Hsien-Chih Chang, Jie Gao, and Hung Le Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs 10.4230/LIPIcs.SoCG.2024.38
• Dror Chawin and Ishay Haviv Nearly Orthogonal Sets over Finite Fields 10.4230/LIPIcs.SoCG.2024.39
• Kyungjin Cho, Eunjin Oh, Haitao Wang, and Jie Xue Optimal Algorithm for the Planar Two-Center Problem 10.4230/LIPIcs.SoCG.2024.40
• Suyoung Choi, Hyeontae Jang, and Mathieu Vallée GPU Algorithm for Enumerating PL Spheres of Picard Number 4: Application to Toric Topology 10.4230/LIPIcs.SoCG.2024.41
• Jacobus Conradi, Benedikt Kolbe, Ioannis Psarros, and Dennis Rohde Fast Approximations and Coresets for (k,𝓁)-Median Under Dynamic Time Warping 10.4230/LIPIcs.SoCG.2024.42
• Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, and Manfred Scheucher An Improved Lower Bound on the Number of Pseudoline Arrangements 10.4230/LIPIcs.SoCG.2024.43
• Justin Curry, Washington Mio, Tom Needham, Osman Berat Okutan, and Florian Russold Stability and Approximations for Decorated Reeb Spaces 10.4230/LIPIcs.SoCG.2024.44
• Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, and Saurabh Ray Sweeping Arrangements of Non-Piercing Regions in the Plane 10.4230/LIPIcs.SoCG.2024.45
• Gábor Damásdi, Zichao Dong, Manfred Scheucher, and Ji Zeng Saturation Results Around the Erdős-Szekeres Problem 10.4230/LIPIcs.SoCG.2024.46
• Rathish Das, Omrit Filtser, Matthew J. Katz, and Joseph S.B. Mitchell Robustly Guarding Polygons 10.4230/LIPIcs.SoCG.2024.47
• Pierre Dehornoy, Corentin Lunel, and Arnaud de Mesmay Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect 10.4230/LIPIcs.SoCG.2024.48
• Tamal K. Dey and Tao Hou Computing Zigzag Vineyard Efficiently Including Expansions and Contractions 10.4230/LIPIcs.SoCG.2024.49
• Tamal K. Dey and Abhishek Rathod Cup Product Persistence and Its Efficient Computation 10.4230/LIPIcs.SoCG.2024.50
• Tamal K. Dey, Florian Russold, and Shreyas N. Samaga Efficient Algorithms for Complexes of Persistence Modules with Applications 10.4230/LIPIcs.SoCG.2024.51
• Michael Gene Dobbins, Andreas F. Holmsen, and Dohyeon Lee Colorful Intersections and Tverberg Partitions 10.4230/LIPIcs.SoCG.2024.52
• Herbert Edelsbrunner and János Pach Maximum Betti Numbers of Čech Complexes 10.4230/LIPIcs.SoCG.2024.53
• Friedrich Eisenbrand, Matthieu Haeberle, and Neta Singer An Improved Bound on Sums of Square Roots via the Subspace Theorem 10.4230/LIPIcs.SoCG.2024.54
• Alexandros Eskenazis Dimensionality of Hamming Metrics and Rademacher Type 10.4230/LIPIcs.SoCG.2024.55
• Arnold Filtser, Yuval Gitlitz, and Ofer Neiman Light, Reliable Spanners 10.4230/LIPIcs.SoCG.2024.56
• Jacob Focke, Florian Hörsch, Shaohua Li, and Dániel Marx Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern 10.4230/LIPIcs.SoCG.2024.57
• Emily Fox, Amir Nayyeri, Jonathan James Perry, and Benjamin Raichel Fréchet Edit Distance 10.4230/LIPIcs.SoCG.2024.58
• Jacob Fox, János Pach, and Andrew Suk A Structure Theorem for Pseudo-Segments and Its Applications 10.4230/LIPIcs.SoCG.2024.59
• Zhimeng Gao and Sariel Har-Peled Near Optimal Locality Sensitive Orderings in Euclidean Space 10.4230/LIPIcs.SoCG.2024.60
• Fabrizio Grandoni, Edin Husić, Mathieu Mari, and Antoine Tinguely Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions 10.4230/LIPIcs.SoCG.2024.61
• Joachim Gudmundsson, Martin P. Seybold, and Sampson Wong Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size 10.4230/LIPIcs.SoCG.2024.62
• Thijs van der Horst and Tim Ophelders Faster Fréchet Distance Approximation Through Truncated Smoothing 10.4230/LIPIcs.SoCG.2024.63
• Shaofeng H.-C. Jiang, Robert Krauthgamer, and Shay Sapir Moderate Dimension Reduction for k-Center Clustering 10.4230/LIPIcs.SoCG.2024.64
• Iyad Kanj and Salman Parsa On the Parameterized Complexity of Motion Planning for Rectangular Robots 10.4230/LIPIcs.SoCG.2024.65
• Chaya Keller and Shakhar Smorodinsky Zarankiewicz’s Problem via ε-t-Nets 10.4230/LIPIcs.SoCG.2024.66
• Sándor Kisfaludi-Bak, Jana Masaříková, Erik Jan van Leeuwen, Bartosz Walczak, and Karol Węgrzycki Separator Theorem and Algorithms for Planar Hyperbolic Graphs 10.4230/LIPIcs.SoCG.2024.67
• Sándor Kisfaludi-Bak and Geert van Wordragen A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space 10.4230/LIPIcs.SoCG.2024.68
• Hana Dal Poz Kouřimská, André Lieutier, and Mathijs Wintraecken The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms 10.4230/LIPIcs.SoCG.2024.69
• Uzu Lim Strange Random Topology of the Circle 10.4230/LIPIcs.SoCG.2024.70
• Hong Liu, Chong Shangguan, Jozef Skokan, and Zixiang Xu Beyond Chromatic Threshold via (p,q)-Theorem, and Blow-Up Phenomenon 10.4230/LIPIcs.SoCG.2024.71
• Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, and Meirav Zehavi A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs 10.4230/LIPIcs.SoCG.2024.72
• Sushovan Majhi Demystifying Latschev’s Theorem: Manifold Reconstruction from Noisy Data 10.4230/LIPIcs.SoCG.2024.73
• Tim Planken and Torsten Ueckerdt Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets 10.4230/LIPIcs.SoCG.2024.74
• Yohai Reani and Omer Bobrowski Morse Theory for the k-NN Distance Function 10.4230/LIPIcs.SoCG.2024.75
• Günter Rote, Moritz Rüber, and Morteza Saghafian Grid Peeling of Parabolas 10.4230/LIPIcs.SoCG.2024.76
• Patrick Schnider and Simon Weber A Topological Version of Schaefer’s Dichotomy Theorem 10.4230/LIPIcs.SoCG.2024.77
• Martin Tancer Pach’s Animal Problem Within the Bounding Box 10.4230/LIPIcs.SoCG.2024.78
• Haitao Wang and Jie Xue Algorithms for Halfplane Coverage and Related Problems 10.4230/LIPIcs.SoCG.2024.79
• Qingsong Wang, Guanqun Ma, Raghavendra Sridharamurthy, and Bei Wang Measure-Theoretic Reeb Graphs and Reeb Spaces 10.4230/LIPIcs.SoCG.2024.80
• Ernest van Wijland and Hang Zhou Faster Approximation Scheme for Euclidean k-TSP 10.4230/LIPIcs.SoCG.2024.81
• Xiaoyi Zhu, Yuxiang Tian, Lingxiao Huang, and Zengfeng Huang Space Complexity of Euclidean Clustering 10.4230/LIPIcs.SoCG.2024.82
• Alkan Atak, Kevin Buchin, Mart Hagedoorn, Jona Heinrichs, Karsten Hogreve, Guangping Li, and Patrick Pawelczyk Computing Maximum Polygonal Packings in Convex Polygons Using Best-Fit, Genetic Algorithms and ILPs (CG Challenge) 10.4230/LIPIcs.SoCG.2024.83
• Guilherme D. da Fonseca and Yan Gerard Shadoks Approach to Knapsack Polygonal Packing (CG Challenge) 10.4230/LIPIcs.SoCG.2024.84
• Martin Held Priority-Driven Nesting of Irregular Polygonal Shapes Within a Convex Polygonal Container Based on a Hierarchical Integer Grid (CG Challenge) 10.4230/LIPIcs.SoCG.2024.85
• Canhui Luo, Zhouxing Su, and Zhipeng Lü A General Heuristic Approach for Maximum Polygon Packing (CG Challenge) 10.4230/LIPIcs.SoCG.2024.86
• Dominique Attali, Hana Dal Poz Kouřimská, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, and Mathijs Wintraecken The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition) 10.4230/LIPIcs.SoCG.2024.87
• Marjolein Haagsman, Maarten Löffler, and Carola Wenk Computational Geometry Concept Videos: A Dual-Use Project in Education and Outreach (Media Exposition) 10.4230/LIPIcs.SoCG.2024.88
• Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, and Bettina Speckmann Optimal In-Place Compaction of Sliding Cubes (Media Exposition) 10.4230/LIPIcs.SoCG.2024.89
• Kacey Thien-Huu La, Jose E. Arbelo, and Christopher J. Tralie Visualizing Lucas’s Hamiltonian Paths Through the Associahedron 1-Skeleton (Media Exposition) 10.4230/LIPIcs.SoCG.2024.90
• Olivia X. Laske and Lori Ziegelmeier Image Triangulation Using the Sobel Operator for Vertex Selection (Media Exposition) 10.4230/LIPIcs.SoCG.2024.91
• Nithin Parepally, Ainesh Chatterjee, Auguste H. Gezalyan, Hongyang Du, Sukrit Mangla, Kenny Wu, Sarah Hwang, and David M. Mount Ipelets for the Convex Polygonal Geometry (Media Exposition) 10.4230/LIPIcs.SoCG.2024.92