39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 1-1058, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 0:i-0:xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Mikkel Abrahamsen, Linda Kleist, and Tillmann Miltzow. Geometric Embeddability of Complexes Is ∃ℝ-Complete. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 1:1-1:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Mikkel Abrahamsen and Bartosz Walczak. Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 2:1-2:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Peyman Afshani and Pingan Cheng. Lower Bounds for Intersection Reporting Among Flat Objects. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 3:1-3:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Pankaj K. Agarwal and Sariel Har-Peled. Computing Instance-Optimal Kernels in Two Dimensions. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Pankaj K. Agarwal and Esther Ezra. Line Intersection Searching Amid Unit Balls in 3-Space. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 5:1-5:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kynčl, Yannic Maus, Birgit Vogtenhuber, and Alexandra Weinberger. Drawings of Complete Multipartite Graphs up to Triangle Flips. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Ángel Javier Alonso and Michael Kerber. Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 7:1-7:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Gergely Ambrus, Martin Balko, Nóra Frankl, Attila Jung, and Márton Naszódi. On Helly Numbers of Exponential Lattices. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Sunil Arya and David M. Mount. Optimal Volume-Sensitive Bounds for Polytope Approximation. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Sayan Bandyapadhyay, Fedor V. Fomin, and Tanmay Inamdar. Coresets for Clustering in Geometric Intersection Graphs. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, and Jie Xue. Minimum-Membership Geometric Set Cover, Revisited. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Sayan Bandyapadhyay, William Lochet, and Saket Saurabh. FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
J. Andreas Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, and Eva Rotenberg. Multilevel Skeletonization Using Local Separators. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 13:1-13:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Ulrich Bauer and Maximilian Schmahl. Efficient Computation of Image Persistence. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 14:1-14:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Ulrich Bauer, Fabian Lenzen, and Michael Lesnick. Efficient Two-Parameter Persistence Computation via Cohomology. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Sarita de Berg, Marc van Kreveld, and Frank Staals. The Complexity of Geodesic Spanners. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 16:1-16:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Helena Bergold, Stefan Felsner, and Manfred Scheucher. An Extension Theorem for Signotopes. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 17:1-17:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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)} }
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, and Martin Nöllenburg. Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Ahmad Biniaz. Improved Bounds for Covering Paths and Trees in the Plane. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Mickaël Buchet, Bianca B. Dornelas, and Michael Kerber. Sparse Higher Order Čech Filtrations. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 20:1-20:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Benjamin A. Burton and Alexander He. Finding Large Counterexamples by Selectively Exploring the Pachner Graph. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Jean Cardinal and Micha Sharir. Improved Algebraic Degeneracy Testing. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Timothy M. Chan and Zhengcheng Huang. Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Timothy M. Chan. Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee’s Measure Problem. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 24:1-24:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Nate Clause, Tamal K. Dey, Facundo Mémoli, and Bei Wang. Meta-Diagrams for 2-Parameter Persistence. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 25:1-25:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Vincent Delecroix, Matthijs Ebbens, Francis Lazarus, and Ivan Yakovlev. Algorithms for Length Spectra of Combinatorial Tori. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 26:1-26:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Vincent Despré, Benedikt Kolbe, Hugo Parlier, and Monique Teillaud. Computing a Dirichlet Domain for a Hyperbolic Surface. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 27:1-27:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Eduard Eiben, Robert Ganian, and Iyad Kanj. The Parameterized Complexity of Coordinated Motion Planning. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
David Eppstein. Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Jared Espenant, J. Mark Keil, and Debajyoti Mondal. Finding a Maximum Clique in a Disk Graph. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 30:1-30:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, and Raphael Steiner. Linear Size Universal Point Sets for Classes of Planar Graphs. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 31:1-31:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Thomas Fernique and Daria Pchelina. When Ternary Triangulated Disc Packings Are Densest: Examples, Counter-Examples and Techniques. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 32:1-32:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Arnold Filtser. Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 33:1-33:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Esther Galby, Andrea Munaro, and Shizhou Yang. Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 34:1-34:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Auguste H. Gezalyan and David M. Mount. Voronoi Diagrams in the Hilbert Metric. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 35:1-35:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Egor Gorbachev and Marvin Künnemann. Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 36:1-36:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Aziz Burak Gülen, Facundo Mémoli, Zhengchao Wan, and Yusu Wang. A Generalization of the Persistent Laplacian to Simplicial Maps. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 37:1-37:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Pepijn Roos Hoefgeest and Lucas Slot. The Christoffel-Darboux Kernel for Topological Data Analysis. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 38:1-38:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Michael Hoffmann and Meghana M. Reddy. The Number of Edges in Maximal 2-Planar Graphs. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 39:1-39:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Jacob Holm, Ivor van der Hoog, and Eva Rotenberg. Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 40:1-40:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Alfredo Hubard and Andrew Suk. Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 41:1-41:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Kristóf Huszár and Jonathan Spreer. On the Width of Complicated JSJ Decompositions. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 42:1-42:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki. Reconfiguration of Colorings in Triangulations of the Sphere. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 43:1-43:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Rahul Jain, Marco Ricci, Jonathan Rollin, and André Schulz. On the Geometric Thickness of 2-Degenerate Graphs. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 44:1-44:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Michael Kerber and Matthias Söls. The Localized Union-Of-Balls Bifiltration. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 45:1-45:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, and Andreas Wiese. Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 46:1-46:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Hung Le, Lazar Milenković, and Shay Solomon. Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 47:1-47:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Maarten Löffler, Tim Ophelders, Rodrigo I. Silveira, and Frank Staals. Shortest Paths in Portalgons. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 48:1-48:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Anna Lubiw and Anurag Murty Naredla. The Geodesic Edge Center of a Simple Polygon. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 49:1-49:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Corentin Lunel and Arnaud de Mesmay. A Structural Approach to Tree Decompositions of Knots and Spatial Graphs. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 50:1-50:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Facundo Mémoli and Ling Zhou. Ephemeral Persistence Features and the Stability of Filtered Chain Complexes. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 51:1-51:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Evanthia Papadopoulou. Abstract Voronoi-Like Graphs: Extending Delaunay’s Theorem and Applications. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 52:1-52:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Ioannis Psarros and Dennis Rohde. Random Projections for Curves in High Dimensions. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 53:1-53:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Benjamin Qi and Richard Qi. New Approximation Algorithms for Touring Regions. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 54:1-54:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Patrick Schnider and Pablo Soberón. Combinatorial Depth Measures for Hyperplane Arrangements. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 55:1-55:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Luis Scoccola and Jose A. Perea. FibeRed: Fiberwise Dimensionality Reduction of Topologically Complex Data with Vector Bundles. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 56:1-56:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Luis Scoccola, Hitesh Gakhar, Johnathan Bush, Nikolas Schonsheck, Tatum Rask, Ling Zhou, and Jose A. Perea. Toroidal Coordinates: Decorrelating Circular Coordinates with Lattice Reduction. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 57:1-57:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Jack Stade and Jamie Tucker-Foltz. Topological Universality of the Art Gallery Problem. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 58:1-58:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Andrew Suk and Ji Zeng. On Higher Dimensional Point Sets in General Position. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 59:1-59:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Hubert Wagner. Slice, Simplify and Stitch: Topology-Preserving Simplification Scheme for Massive Voxel Data. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 60:1-60:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Honglin Zhu and Hyuk Jun Kweon. Maximum Overlap Area of a Convex Polyhedron and a Convex Polygon Under Translation. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 61:1-61:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Richard Berger, Vincent Ha, David Kratz, Michael Lin, Jeremy Moyer, and Christopher J. Tralie. Godzilla Onions: A Skit and Applet to Explain Euclidean Half-Plane Fractional Cascading (Media Exposition). In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 62:1-62:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Alexandra Camero and Ileana Streinu. Interactive 2D Periodic Graphs (Media Exposition). In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 63:1-63:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Oliver A. Chubet, Paul Macnichol, Parth Parikh, Donald R. Sheehy, and Siddharth S. Sheth. Greedy Permutations and Finite Voronoi Diagrams (Media Exposition). In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 64:1-64:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Donald R. Sheehy. The Sum of Squares in Polycubes (Media Exposition). In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 65:1-65:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Mikkel Abrahamsen, William Bille Meyling, and André Nusser. Constructing Concise Convex Covers via Clique Covers (CG Challenge). In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 66:1-66:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Guilherme D. da Fonseca. Shadoks Approach to Convex Covering (CG Challenge). In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 67:1-67:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }