@Proceedings{chambers_et_al:LIPIcs.SoCG.2023, title = {{LIPIcs, Volume 258, SoCG 2023, Complete Volume}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {1--1058}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023}, URN = {urn:nbn:de:0030-drops-178498}, doi = {10.4230/LIPIcs.SoCG.2023}, annote = {Keywords: LIPIcs, Volume 258, SoCG 2023, Complete Volume} } @InProceedings{chambers_et_al:LIPIcs.SoCG.2023.0, author = {Chambers, Erin W. and Gudmundsson, Joachim}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.0}, URN = {urn:nbn:de:0030-drops-178501}, doi = {10.4230/LIPIcs.SoCG.2023.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} } @InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2023.1, author = {Abrahamsen, Mikkel and Kleist, Linda and Miltzow, Tillmann}, title = {{Geometric Embeddability of Complexes Is \exists\mathbb{R}-Complete}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {1:1--1:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.1}, URN = {urn:nbn:de:0030-drops-178518}, doi = {10.4230/LIPIcs.SoCG.2023.1}, annote = {Keywords: simplicial complex, geometric embedding, linear embedding, hypergraph, recognition, existential theory of the reals} } @InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2023.2, author = {Abrahamsen, Mikkel and Walczak, Bartosz}, title = {{Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {2:1--2:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.2}, URN = {urn:nbn:de:0030-drops-178523}, doi = {10.4230/LIPIcs.SoCG.2023.2}, annote = {Keywords: geometric intersection graph, convex disk, homothet, similarity} } @InProceedings{afshani_et_al:LIPIcs.SoCG.2023.3, author = {Afshani, Peyman and Cheng, Pingan}, title = {{Lower Bounds for Intersection Reporting Among Flat Objects}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {3:1--3:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.3}, URN = {urn:nbn:de:0030-drops-178536}, doi = {10.4230/LIPIcs.SoCG.2023.3}, annote = {Keywords: Computational Geometry, Intersection Searching, Data Structure Lower Bounds} } @InProceedings{agarwal_et_al:LIPIcs.SoCG.2023.4, author = {Agarwal, Pankaj K. and Har-Peled, Sariel}, title = {{Computing Instance-Optimal Kernels in Two Dimensions}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {4:1--4:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.4}, URN = {urn:nbn:de:0030-drops-178544}, doi = {10.4230/LIPIcs.SoCG.2023.4}, annote = {Keywords: Coreset, approximation, kernel} } @InProceedings{agarwal_et_al:LIPIcs.SoCG.2023.5, author = {Agarwal, Pankaj K. and Ezra, Esther}, title = {{Line Intersection Searching Amid Unit Balls in 3-Space}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.5}, URN = {urn:nbn:de:0030-drops-178559}, doi = {10.4230/LIPIcs.SoCG.2023.5}, annote = {Keywords: Intersection searching, cylindrical range searching, partition trees, union of cylinders} } @InProceedings{aichholzer_et_al:LIPIcs.SoCG.2023.6, author = {Aichholzer, Oswin and Chiu, Man-Kwun and Hoang, Hung P. and Hoffmann, Michael and Kyn\v{c}l, Jan and Maus, Yannic and Vogtenhuber, Birgit and Weinberger, Alexandra}, title = {{Drawings of Complete Multipartite Graphs up to Triangle Flips}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.6}, URN = {urn:nbn:de:0030-drops-178563}, doi = {10.4230/LIPIcs.SoCG.2023.6}, annote = {Keywords: Simple drawings, simple topological graphs, complete graphs, multipartite graphs, k-partite graphs, bipartite graphs, Gioan’s Theorem, triangle flips, Reidemeister moves} } @InProceedings{alonso_et_al:LIPIcs.SoCG.2023.7, author = {Alonso, \'{A}ngel Javier and Kerber, Michael}, title = {{Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.7}, URN = {urn:nbn:de:0030-drops-178570}, doi = {10.4230/LIPIcs.SoCG.2023.7}, annote = {Keywords: Multiparameter persistent homology, Clustering, Decomposition of persistence modules, Elder Rule} } @InProceedings{ambrus_et_al:LIPIcs.SoCG.2023.8, author = {Ambrus, Gergely and Balko, Martin and Frankl, N\'{o}ra and Jung, Attila and Nasz\'{o}di, M\'{a}rton}, title = {{On Helly Numbers of Exponential Lattices}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.8}, URN = {urn:nbn:de:0030-drops-178584}, doi = {10.4230/LIPIcs.SoCG.2023.8}, annote = {Keywords: Helly numbers, exponential lattices, Diophantine approximation} } @InProceedings{arya_et_al:LIPIcs.SoCG.2023.9, author = {Arya, Sunil and Mount, David M.}, title = {{Optimal Volume-Sensitive Bounds for Polytope Approximation}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.9}, URN = {urn:nbn:de:0030-drops-178592}, doi = {10.4230/LIPIcs.SoCG.2023.9}, annote = {Keywords: Approximation algorithms, convexity, Macbeath regions} } @InProceedings{bandyapadhyay_et_al:LIPIcs.SoCG.2023.10, author = {Bandyapadhyay, Sayan and Fomin, Fedor V. and Inamdar, Tanmay}, title = {{Coresets for Clustering in Geometric Intersection Graphs}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.10}, URN = {urn:nbn:de:0030-drops-178605}, doi = {10.4230/LIPIcs.SoCG.2023.10}, annote = {Keywords: k-median, k-means, clustering, coresets, geometric graphs} } @InProceedings{bandyapadhyay_et_al:LIPIcs.SoCG.2023.11, author = {Bandyapadhyay, Sayan and Lochet, William and Saurabh, Saket and Xue, Jie}, title = {{Minimum-Membership Geometric Set Cover, Revisited}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.11}, URN = {urn:nbn:de:0030-drops-178610}, doi = {10.4230/LIPIcs.SoCG.2023.11}, annote = {Keywords: geometric set cover, geometric optimization, approximation algorithms} } @InProceedings{bandyapadhyay_et_al:LIPIcs.SoCG.2023.12, author = {Bandyapadhyay, Sayan and Lochet, William and Saurabh, Saket}, title = {{FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.12}, URN = {urn:nbn:de:0030-drops-178628}, doi = {10.4230/LIPIcs.SoCG.2023.12}, annote = {Keywords: Clustering, FPT-approximation} } @InProceedings{brentzen_et_al:LIPIcs.SoCG.2023.13, author = {B{\ae}rentzen, J. Andreas and Christensen, Rasmus Emil and G{\ae}de, Emil Toftegaard and Rotenberg, Eva}, title = {{Multilevel Skeletonization Using Local Separators}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.13}, URN = {urn:nbn:de:0030-drops-178637}, doi = {10.4230/LIPIcs.SoCG.2023.13}, annote = {Keywords: Algorithm engineering, experimentation and implementation, shape skeletonization, curve skeletons, multilevel algorithm} } @InProceedings{bauer_et_al:LIPIcs.SoCG.2023.14, author = {Bauer, Ulrich and Schmahl, Maximilian}, title = {{Efficient Computation of Image Persistence}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {14:1--14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.14}, URN = {urn:nbn:de:0030-drops-178643}, doi = {10.4230/LIPIcs.SoCG.2023.14}, annote = {Keywords: Persistent homology, image persistence, barcode computation} } @InProceedings{bauer_et_al:LIPIcs.SoCG.2023.15, author = {Bauer, Ulrich and Lenzen, Fabian and Lesnick, Michael}, title = {{Efficient Two-Parameter Persistence Computation via Cohomology}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.15}, URN = {urn:nbn:de:0030-drops-178656}, doi = {10.4230/LIPIcs.SoCG.2023.15}, annote = {Keywords: Persistent homology, persistent cohomology, two-parameter persistence, clearing} } @InProceedings{deberg_et_al:LIPIcs.SoCG.2023.16, author = {de Berg, Sarita and van Kreveld, Marc and Staals, Frank}, title = {{The Complexity of Geodesic Spanners}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {16:1--16:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.16}, URN = {urn:nbn:de:0030-drops-178669}, doi = {10.4230/LIPIcs.SoCG.2023.16}, annote = {Keywords: spanner, simple polygon, polygonal domain, geodesic distance, complexity} } @InProceedings{bergold_et_al:LIPIcs.SoCG.2023.17, author = {Bergold, Helena and Felsner, Stefan and Scheucher, Manfred}, title = {{An Extension Theorem for Signotopes}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {17:1--17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.17}, URN = {urn:nbn:de:0030-drops-178676}, doi = {10.4230/LIPIcs.SoCG.2023.17}, annote = {Keywords: arrangement of pseudolines, extendability, Levi’s extension lemma, arrangement of pseudohyperplanes, signotope, oriented matroid, partial order, Boolean satisfiability (SAT)} } @InProceedings{bhore_et_al:LIPIcs.SoCG.2023.18, author = {Bhore, Sujoy and Ganian, Robert and Khazaliya, Liana and Montecchiani, Fabrizio and N\"{o}llenburg, Martin}, title = {{Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.18}, URN = {urn:nbn:de:0030-drops-178689}, doi = {10.4230/LIPIcs.SoCG.2023.18}, annote = {Keywords: orthogonal drawings, bend minimization, extension problems, parameterized complexity} } @InProceedings{biniaz:LIPIcs.SoCG.2023.19, author = {Biniaz, Ahmad}, title = {{Improved Bounds for Covering Paths and Trees in the Plane}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {19:1--19:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.19}, URN = {urn:nbn:de:0030-drops-178696}, doi = {10.4230/LIPIcs.SoCG.2023.19}, annote = {Keywords: planar point sets, covering paths, covering trees, rainbow polygons} } @InProceedings{buchet_et_al:LIPIcs.SoCG.2023.20, author = {Buchet, Micka\"{e}l and B. Dornelas, Bianca and Kerber, Michael}, title = {{Sparse Higher Order \v{C}ech Filtrations}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {20:1--20:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.20}, URN = {urn:nbn:de:0030-drops-178709}, doi = {10.4230/LIPIcs.SoCG.2023.20}, annote = {Keywords: Sparsification, k-fold cover, Higher order \v{C}ech complexes} } @InProceedings{burton_et_al:LIPIcs.SoCG.2023.21, author = {Burton, Benjamin A. and He, Alexander}, title = {{Finding Large Counterexamples by Selectively Exploring the Pachner Graph}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.21}, URN = {urn:nbn:de:0030-drops-178712}, doi = {10.4230/LIPIcs.SoCG.2023.21}, annote = {Keywords: Computational topology, 3-manifolds, Triangulations, Counterexamples, Heuristics, Implementation, Pachner moves, Bistellar flips} } @InProceedings{cardinal_et_al:LIPIcs.SoCG.2023.22, author = {Cardinal, Jean and Sharir, Micha}, title = {{Improved Algebraic Degeneracy Testing}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.22}, URN = {urn:nbn:de:0030-drops-178723}, doi = {10.4230/LIPIcs.SoCG.2023.22}, annote = {Keywords: Degeneracy testing, k-SUM problem, incidence bounds, Hocroft’s problem, polynomial method, algebraic decision trees} } @InProceedings{chan_et_al:LIPIcs.SoCG.2023.23, author = {Chan, Timothy M. and Huang, Zhengcheng}, title = {{Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.23}, URN = {urn:nbn:de:0030-drops-178738}, doi = {10.4230/LIPIcs.SoCG.2023.23}, annote = {Keywords: Hop spanners, geometric intersection graphs, string graphs, fat objects, separators, shallow cuttings} } @InProceedings{chan:LIPIcs.SoCG.2023.24, author = {Chan, Timothy M.}, title = {{Minimum L\underline∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee’s Measure Problem}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {24:1--24:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.24}, URN = {urn:nbn:de:0030-drops-178741}, doi = {10.4230/LIPIcs.SoCG.2023.24}, annote = {Keywords: Hausdorff distance, geometric optimization, Klee’s measure problem, fine-grained complexity} } @InProceedings{clause_et_al:LIPIcs.SoCG.2023.25, author = {Clause, Nate and Dey, Tamal K. and M\'{e}moli, Facundo and Wang, Bei}, title = {{Meta-Diagrams for 2-Parameter Persistence}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {25:1--25:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.25}, URN = {urn:nbn:de:0030-drops-178754}, doi = {10.4230/LIPIcs.SoCG.2023.25}, annote = {Keywords: Multiparameter persistence modules, persistent homology, M\"{o}bius inversion, barcodes, computational topology, topological data analysis} } @InProceedings{delecroix_et_al:LIPIcs.SoCG.2023.26, author = {Delecroix, Vincent and Ebbens, Matthijs and Lazarus, Francis and Yakovlev, Ivan}, title = {{Algorithms for Length Spectra of Combinatorial Tori}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {26:1--26:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.26}, URN = {urn:nbn:de:0030-drops-178765}, doi = {10.4230/LIPIcs.SoCG.2023.26}, annote = {Keywords: graphs on surfaces, length spectrum, polyhedral norm} } @InProceedings{despre_et_al:LIPIcs.SoCG.2023.27, author = {Despr\'{e}, Vincent and Kolbe, Benedikt and Parlier, Hugo and Teillaud, Monique}, title = {{Computing a Dirichlet Domain for a Hyperbolic Surface}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.27}, URN = {urn:nbn:de:0030-drops-178771}, doi = {10.4230/LIPIcs.SoCG.2023.27}, annote = {Keywords: Hyperbolic geometry, Topology, Voronoi diagram, Algorithm} } @InProceedings{eiben_et_al:LIPIcs.SoCG.2023.28, author = {Eiben, Eduard and Ganian, Robert and Kanj, Iyad}, title = {{The Parameterized Complexity of Coordinated Motion Planning}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.28}, URN = {urn:nbn:de:0030-drops-178784}, doi = {10.4230/LIPIcs.SoCG.2023.28}, annote = {Keywords: coordinated motion planning, multi-agent path finding, parameterized complexity, disjoint paths on grids} } @InProceedings{eppstein:LIPIcs.SoCG.2023.29, author = {Eppstein, David}, title = {{Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29}, URN = {urn:nbn:de:0030-drops-178790}, doi = {10.4230/LIPIcs.SoCG.2023.29}, annote = {Keywords: polygonalization, non-crossing structures, output-sensitive algorithms} } @InProceedings{espenant_et_al:LIPIcs.SoCG.2023.30, author = {Espenant, Jared and Keil, J. Mark and Mondal, Debajyoti}, title = {{Finding a Maximum Clique in a Disk Graph}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {30:1--30:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.30}, URN = {urn:nbn:de:0030-drops-178803}, doi = {10.4230/LIPIcs.SoCG.2023.30}, annote = {Keywords: Maximum clique, Disk graph, Time complexity, APX-hardness} } @InProceedings{felsner_et_al:LIPIcs.SoCG.2023.31, author = {Felsner, Stefan and Schrezenmaier, Hendrik and Schr\"{o}der, Felix and Steiner, Raphael}, title = {{Linear Size Universal Point Sets for Classes of Planar Graphs}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.31}, URN = {urn:nbn:de:0030-drops-178814}, doi = {10.4230/LIPIcs.SoCG.2023.31}, annote = {Keywords: Graph drawing, Universal point set, One-sided Hamiltonian, 2-page book embedding, Separating decomposition, Quadrangulation, 2-tree, Subcubic planar graph} } @InProceedings{fernique_et_al:LIPIcs.SoCG.2023.32, author = {Fernique, Thomas and Pchelina, Daria}, title = {{When Ternary Triangulated Disc Packings Are Densest: Examples, Counter-Examples and Techniques}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {32:1--32:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.32}, URN = {urn:nbn:de:0030-drops-178827}, doi = {10.4230/LIPIcs.SoCG.2023.32}, annote = {Keywords: Disc packing, density, interval arithmetic} } @InProceedings{filtser:LIPIcs.SoCG.2023.33, author = {Filtser, Arnold}, title = {{Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {33:1--33:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.33}, URN = {urn:nbn:de:0030-drops-178839}, doi = {10.4230/LIPIcs.SoCG.2023.33}, annote = {Keywords: Locality sensitive ordering, nearest neighbor search, high dimensional Euclidean space, doubling dimension, planar and minor free graphs, path reporting low hop spanner, fault tolerant spanner, reliable spanner, light spanner} } @InProceedings{galby_et_al:LIPIcs.SoCG.2023.34, author = {Galby, Esther and Munaro, Andrea and Yang, Shizhou}, title = {{Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {34:1--34:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.34}, URN = {urn:nbn:de:0030-drops-178840}, doi = {10.4230/LIPIcs.SoCG.2023.34}, annote = {Keywords: Independent packings, intersection graphs, polynomial-time approximation schemes, tree-independence number} } @InProceedings{gezalyan_et_al:LIPIcs.SoCG.2023.35, author = {Gezalyan, Auguste H. and Mount, David M.}, title = {{Voronoi Diagrams in the Hilbert Metric}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {35:1--35:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.35}, URN = {urn:nbn:de:0030-drops-178851}, doi = {10.4230/LIPIcs.SoCG.2023.35}, annote = {Keywords: Voronoi diagrams, Hilbert metric, convexity, randomized algorithms} } @InProceedings{gorbachev_et_al:LIPIcs.SoCG.2023.36, author = {Gorbachev, Egor and K\"{u}nnemann, Marvin}, title = {{Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {36:1--36:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.36}, URN = {urn:nbn:de:0030-drops-178861}, doi = {10.4230/LIPIcs.SoCG.2023.36}, annote = {Keywords: Fine-grained complexity theory, non-combinatorial lower bounds, computational geometry, clique detection} } @InProceedings{gulen_et_al:LIPIcs.SoCG.2023.37, author = {G\"{u}len, Aziz Burak and M\'{e}moli, Facundo and Wan, Zhengchao and Wang, Yusu}, title = {{A Generalization of the Persistent Laplacian to Simplicial Maps}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {37:1--37:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.37}, URN = {urn:nbn:de:0030-drops-178877}, doi = {10.4230/LIPIcs.SoCG.2023.37}, annote = {Keywords: combinatorial Laplacian, persistent Laplacian, Schur complement, persistent homology, persistent Betti number} } @InProceedings{rooshoefgeest_et_al:LIPIcs.SoCG.2023.38, author = {Roos Hoefgeest, Pepijn and Slot, Lucas}, title = {{The Christoffel-Darboux Kernel for Topological Data Analysis}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {38:1--38:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.38}, URN = {urn:nbn:de:0030-drops-178889}, doi = {10.4230/LIPIcs.SoCG.2023.38}, annote = {Keywords: Topological Data Analysis, Geometric Inference, Christoffel-Darboux Kernels, Persistent Homology, Wasserstein Distance, Semi-Algebraic Sets} } @InProceedings{hoffmann_et_al:LIPIcs.SoCG.2023.39, author = {Hoffmann, Michael and M. Reddy, Meghana}, title = {{The Number of Edges in Maximal 2-Planar Graphs}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {39:1--39:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.39}, URN = {urn:nbn:de:0030-drops-178894}, doi = {10.4230/LIPIcs.SoCG.2023.39}, annote = {Keywords: k-planar graphs, local crossing number, saturated graphs, beyond-planar graphs} } @InProceedings{holm_et_al:LIPIcs.SoCG.2023.40, author = {Holm, Jacob and van der Hoog, Ivor and Rotenberg, Eva}, title = {{Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {40:1--40:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.40}, URN = {urn:nbn:de:0030-drops-178909}, doi = {10.4230/LIPIcs.SoCG.2023.40}, annote = {Keywords: dynamic graphs, planarity, connectivity} } @InProceedings{hubard_et_al:LIPIcs.SoCG.2023.41, author = {Hubard, Alfredo and Suk, Andrew}, title = {{Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {41:1--41:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.41}, URN = {urn:nbn:de:0030-drops-178917}, doi = {10.4230/LIPIcs.SoCG.2023.41}, annote = {Keywords: Disjoint faces, simple topological graphs, topological Heilbronn problems} } @InProceedings{huszar_et_al:LIPIcs.SoCG.2023.42, author = {Husz\'{a}r, Krist\'{o}f and Spreer, Jonathan}, title = {{On the Width of Complicated JSJ Decompositions}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {42:1--42:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.42}, URN = {urn:nbn:de:0030-drops-178920}, doi = {10.4230/LIPIcs.SoCG.2023.42}, annote = {Keywords: computational 3-manifold topology, fixed-parameter tractability, generalized Heegaard splittings, JSJ decompositions, pathwidth, treewidth, triangulations} } @InProceedings{ito_et_al:LIPIcs.SoCG.2023.43, author = {Ito, Takehiro and Iwamasa, Yuni and Kobayashi, Yusuke and Maezawa, Shun-ichi and Nozaki, Yuta and Okamoto, Yoshio and Ozeki, Kenta}, title = {{Reconfiguration of Colorings in Triangulations of the Sphere}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {43:1--43:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.43}, URN = {urn:nbn:de:0030-drops-178936}, doi = {10.4230/LIPIcs.SoCG.2023.43}, annote = {Keywords: Graph coloring, Triangulation of the sphere, Combinatorial reconfiguration} } @InProceedings{jain_et_al:LIPIcs.SoCG.2023.44, author = {Jain, Rahul and Ricci, Marco and Rollin, Jonathan and Schulz, Andr\'{e}}, title = {{On the Geometric Thickness of 2-Degenerate Graphs}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {44:1--44:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.44}, URN = {urn:nbn:de:0030-drops-178946}, doi = {10.4230/LIPIcs.SoCG.2023.44}, annote = {Keywords: Degeneracy, geometric thickness, geometric arboricity} } @InProceedings{kerber_et_al:LIPIcs.SoCG.2023.45, author = {Kerber, Michael and S\"{o}ls, Matthias}, title = {{The Localized Union-Of-Balls Bifiltration}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {45:1--45:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.45}, URN = {urn:nbn:de:0030-drops-178953}, doi = {10.4230/LIPIcs.SoCG.2023.45}, annote = {Keywords: Topological Data Analysis, Multi-Parameter Persistence, Persistent Local Homology} } @InProceedings{khan_et_al:LIPIcs.SoCG.2023.46, author = {Khan, Arindam and Lonkar, Aditya and Rahul, Saladi and Subramanian, Aditya and Wiese, Andreas}, title = {{Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {46:1--46:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.46}, URN = {urn:nbn:de:0030-drops-178967}, doi = {10.4230/LIPIcs.SoCG.2023.46}, annote = {Keywords: Geometric Set Cover, Hitting Set, Rectangles, Squares, Hyperrectangles, Online Algorithms, Dynamic Data Structures} } @InProceedings{le_et_al:LIPIcs.SoCG.2023.47, author = {Le, Hung and Milenkovi\'{c}, Lazar and Solomon, Shay}, title = {{Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {47:1--47:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.47}, URN = {urn:nbn:de:0030-drops-178976}, doi = {10.4230/LIPIcs.SoCG.2023.47}, annote = {Keywords: Euclidean spanners, Ackermann functions, convex functions, hop-diameter} } @InProceedings{loffler_et_al:LIPIcs.SoCG.2023.48, author = {L\"{o}ffler, Maarten and Ophelders, Tim and Silveira, Rodrigo I. and Staals, Frank}, title = {{Shortest Paths in Portalgons}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {48:1--48:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.48}, URN = {urn:nbn:de:0030-drops-178980}, doi = {10.4230/LIPIcs.SoCG.2023.48}, annote = {Keywords: Polyhedral surfaces, shortest paths, geodesic distance, Delaunay triangulation} } @InProceedings{lubiw_et_al:LIPIcs.SoCG.2023.49, author = {Lubiw, Anna and Naredla, Anurag Murty}, title = {{The Geodesic Edge Center of a Simple Polygon}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {49:1--49:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.49}, URN = {urn:nbn:de:0030-drops-178994}, doi = {10.4230/LIPIcs.SoCG.2023.49}, annote = {Keywords: geodesic center of polygon, farthest edges, farthest-segment Voronoi diagram} } @InProceedings{lunel_et_al:LIPIcs.SoCG.2023.50, author = {Lunel, Corentin and de Mesmay, Arnaud}, title = {{A Structural Approach to Tree Decompositions of Knots and Spatial Graphs}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {50:1--50:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.50}, URN = {urn:nbn:de:0030-drops-179002}, doi = {10.4230/LIPIcs.SoCG.2023.50}, annote = {Keywords: Knots, Spatial Graphs, Tree Decompositions, Tangle, Representativity} } @InProceedings{memoli_et_al:LIPIcs.SoCG.2023.51, author = {M\'{e}moli, Facundo and Zhou, Ling}, title = {{Ephemeral Persistence Features and the Stability of Filtered Chain Complexes}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {51:1--51:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.51}, URN = {urn:nbn:de:0030-drops-179014}, doi = {10.4230/LIPIcs.SoCG.2023.51}, annote = {Keywords: filtered chain complexes, Vietoris-Rips complexes, barcode, bottleneck distance, matching distance, Gromov-Hausdorff distance} } @InProceedings{papadopoulou:LIPIcs.SoCG.2023.52, author = {Papadopoulou, Evanthia}, title = {{Abstract Voronoi-Like Graphs: Extending Delaunay’s Theorem and Applications}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {52:1--52:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.52}, URN = {urn:nbn:de:0030-drops-179024}, doi = {10.4230/LIPIcs.SoCG.2023.52}, annote = {Keywords: Voronoi-like graph, abstract Voronoi diagram, Delaunay’s theorem, Voronoi tree, linear-time randomized algorithm, constraint Delaunay triangulation} } @InProceedings{psarros_et_al:LIPIcs.SoCG.2023.53, author = {Psarros, Ioannis and Rohde, Dennis}, title = {{Random Projections for Curves in High Dimensions}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {53:1--53:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.53}, URN = {urn:nbn:de:0030-drops-179030}, doi = {10.4230/LIPIcs.SoCG.2023.53}, annote = {Keywords: polygonal curves, time series, dimension reduction, Johnson-Lindenstrauss lemma, Fr\'{e}chet distance} } @InProceedings{qi_et_al:LIPIcs.SoCG.2023.54, author = {Qi, Benjamin and Qi, Richard}, title = {{New Approximation Algorithms for Touring Regions}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {54:1--54:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.54}, URN = {urn:nbn:de:0030-drops-179047}, doi = {10.4230/LIPIcs.SoCG.2023.54}, annote = {Keywords: shortest paths, convex bodies, fat objects, disks} } @InProceedings{schnider_et_al:LIPIcs.SoCG.2023.55, author = {Schnider, Patrick and Sober\'{o}n, Pablo}, title = {{Combinatorial Depth Measures for Hyperplane Arrangements}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {55:1--55:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.55}, URN = {urn:nbn:de:0030-drops-179055}, doi = {10.4230/LIPIcs.SoCG.2023.55}, annote = {Keywords: Depth measures, Hyperplane arrangements, Regression depth, Tverberg theorem} } @InProceedings{scoccola_et_al:LIPIcs.SoCG.2023.56, author = {Scoccola, Luis and Perea, Jose A.}, title = {{FibeRed: Fiberwise Dimensionality Reduction of Topologically Complex Data with Vector Bundles}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {56:1--56:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.56}, URN = {urn:nbn:de:0030-drops-179068}, doi = {10.4230/LIPIcs.SoCG.2023.56}, annote = {Keywords: topological inference, dimensionality reduction, vector bundle, cocycle} } @InProceedings{scoccola_et_al:LIPIcs.SoCG.2023.57, author = {Scoccola, Luis and Gakhar, Hitesh and Bush, Johnathan and Schonsheck, Nikolas and Rask, Tatum and Zhou, Ling and Perea, Jose A.}, title = {{Toroidal Coordinates: Decorrelating Circular Coordinates with Lattice Reduction}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {57:1--57:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.57}, URN = {urn:nbn:de:0030-drops-179073}, doi = {10.4230/LIPIcs.SoCG.2023.57}, annote = {Keywords: dimensionality reduction, lattice reduction, Dirichlet energy, harmonic, cocycle} } @InProceedings{stade_et_al:LIPIcs.SoCG.2023.58, author = {Stade, Jack and Tucker-Foltz, Jamie}, title = {{Topological Universality of the Art Gallery Problem}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {58:1--58:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.58}, URN = {urn:nbn:de:0030-drops-179082}, doi = {10.4230/LIPIcs.SoCG.2023.58}, annote = {Keywords: Art gallery, Homeomorphism, Exists-R, ETR, Semi-algebraic sets, Universality} } @InProceedings{suk_et_al:LIPIcs.SoCG.2023.59, author = {Suk, Andrew and Zeng, Ji}, title = {{On Higher Dimensional Point Sets in General Position}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {59:1--59:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.59}, URN = {urn:nbn:de:0030-drops-179097}, doi = {10.4230/LIPIcs.SoCG.2023.59}, annote = {Keywords: independent sets, hypergraph container method, generalised Sidon sets} } @InProceedings{wagner:LIPIcs.SoCG.2023.60, author = {Wagner, Hubert}, title = {{Slice, Simplify and Stitch: Topology-Preserving Simplification Scheme for Massive Voxel Data}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {60:1--60:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.60}, URN = {urn:nbn:de:0030-drops-179107}, doi = {10.4230/LIPIcs.SoCG.2023.60}, annote = {Keywords: Computational topology, topological data analysis, topological image analysis, persistent homology, persistence diagram, discrete Morse theory, algorithm engineering, implementation, voxel data, volume data, image data} } @InProceedings{zhu_et_al:LIPIcs.SoCG.2023.61, author = {Zhu, Honglin and Kweon, Hyuk Jun}, title = {{Maximum Overlap Area of a Convex Polyhedron and a Convex Polygon Under Translation}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {61:1--61:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.61}, URN = {urn:nbn:de:0030-drops-179116}, doi = {10.4230/LIPIcs.SoCG.2023.61}, annote = {Keywords: computational geometry, shape matching, arrangement} } @InProceedings{berger_et_al:LIPIcs.SoCG.2023.62, author = {Berger, Richard and Ha, Vincent and Kratz, David and Lin, Michael and Moyer, Jeremy and Tralie, Christopher J.}, title = {{Godzilla Onions: A Skit and Applet to Explain Euclidean Half-Plane Fractional Cascading}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {62:1--62:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.62}, URN = {urn:nbn:de:0030-drops-179129}, doi = {10.4230/LIPIcs.SoCG.2023.62}, annote = {Keywords: convex hulls, onions, fractional cascading, visualization, d3} } @InProceedings{camero_et_al:LIPIcs.SoCG.2023.63, author = {Camero, Alexandra and Streinu, Ileana}, title = {{Interactive 2D Periodic Graphs}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {63:1--63:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.63}, URN = {urn:nbn:de:0030-drops-179131}, doi = {10.4230/LIPIcs.SoCG.2023.63}, annote = {Keywords: Periodic graphs, isometric transformations} } @InProceedings{chubet_et_al:LIPIcs.SoCG.2023.64, author = {Chubet, Oliver A. and Macnichol, Paul and Parikh, Parth and Sheehy, Donald R. and Sheth, Siddharth S.}, title = {{Greedy Permutations and Finite Voronoi Diagrams}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {64:1--64:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.64}, URN = {urn:nbn:de:0030-drops-179146}, doi = {10.4230/LIPIcs.SoCG.2023.64}, annote = {Keywords: greedy permutation, Voronoi diagrams} } @InProceedings{sheehy:LIPIcs.SoCG.2023.65, author = {Sheehy, Donald R.}, title = {{The Sum of Squares in Polycubes}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {65:1--65:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.65}, URN = {urn:nbn:de:0030-drops-179152}, doi = {10.4230/LIPIcs.SoCG.2023.65}, annote = {Keywords: Archimedes, polycubes, sum of squares} } @InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2023.66, author = {Abrahamsen, Mikkel and Bille Meyling, William and Nusser, Andr\'{e}}, title = {{Constructing Concise Convex Covers via Clique Covers}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {66:1--66:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.66}, URN = {urn:nbn:de:0030-drops-179164}, doi = {10.4230/LIPIcs.SoCG.2023.66}, annote = {Keywords: Convex cover, Polygons with holes, Algorithm engineering, Vertex clique cover} } @InProceedings{dafonseca:LIPIcs.SoCG.2023.67, author = {da Fonseca, Guilherme D.}, title = {{Shadoks Approach to Convex Covering}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {67:1--67:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.67}, URN = {urn:nbn:de:0030-drops-179178}, doi = {10.4230/LIPIcs.SoCG.2023.67}, annote = {Keywords: Set cover, covering, polygons, convexity, heuristics, enumeration, simulated annealing, integer programming, computational geometry} }