Kevin Buchin and Éric Colin de Verdière. LIPIcs, Volume 189, SoCG 2021, Complete Volume. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 1-978, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@Proceedings{buchin_et_al:LIPIcs.SoCG.2021, title = {{LIPIcs, Volume 189, SoCG 2021, Complete Volume}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {1--978}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021}, URN = {urn:nbn:de:0030-drops-137987}, doi = {10.4230/LIPIcs.SoCG.2021}, annote = {Keywords: LIPIcs, Volume 189, SoCG 2021, Complete Volume} }
Kevin Buchin and Éric Colin de Verdière. Front Matter, Table of Contents, Preface, Conference Organization. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 0:i-0:xviii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{buchin_et_al:LIPIcs.SoCG.2021.0, author = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.0}, URN = {urn:nbn:de:0030-drops-137993}, doi = {10.4230/LIPIcs.SoCG.2021.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Robert Ghrist. On Laplacians (Invited Talk). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, p. 1:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{ghrist:LIPIcs.SoCG.2021.1, author = {Ghrist, Robert}, title = {{On Laplacians}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.1}, URN = {urn:nbn:de:0030-drops-138003}, doi = {10.4230/LIPIcs.SoCG.2021.1}, annote = {Keywords: Laplacian, sheaf theory, applied topology} }
Virginia Vassilevska Williams. 3SUM and Related Problems in Fine-Grained Complexity (Invited Talk). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 2:1-2:2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{vassilevskawilliams:LIPIcs.SoCG.2021.2, author = {Vassilevska Williams, Virginia}, title = {{3SUM and Related Problems in Fine-Grained Complexity}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {2:1--2:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.2}, URN = {urn:nbn:de:0030-drops-138014}, doi = {10.4230/LIPIcs.SoCG.2021.2}, annote = {Keywords: fine-grained complexity} }
Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, and Peter Michael Reichstein Rasmussen. Classifying Convex Bodies by Their Contact and Intersection Graphs. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 3:1-3:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{aamand_et_al:LIPIcs.SoCG.2021.3, author = {Aamand, Anders and Abrahamsen, Mikkel and Knudsen, Jakob B{\ae}k Tejs and Rasmussen, Peter Michael Reichstein}, title = {{Classifying Convex Bodies by Their Contact and Intersection Graphs}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {3:1--3:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.3}, URN = {urn:nbn:de:0030-drops-138024}, doi = {10.4230/LIPIcs.SoCG.2021.3}, annote = {Keywords: convex body, contact graph, intersection graph} }
Ahmed Abdelkader and David M. Mount. Approximate Nearest-Neighbor Search for Line Segments. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 4:1-4:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{abdelkader_et_al:LIPIcs.SoCG.2021.4, author = {Abdelkader, Ahmed and Mount, David M.}, title = {{Approximate Nearest-Neighbor Search for Line Segments}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {4:1--4:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.4}, URN = {urn:nbn:de:0030-drops-138039}, doi = {10.4230/LIPIcs.SoCG.2021.4}, annote = {Keywords: Approximate nearest-neighbor searching, Approximate Voronoi diagrams, Line segments, Macbeath regions} }
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi Vermeulen, and Giovanni Viglietta. Chasing Puppies: Mobile Beacon Routing on Closed Curves. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 5:1-5:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2021.5, author = {Abrahamsen, Mikkel and Erickson, Jeff and Kostitsyna, Irina and L\"{o}ffler, Maarten and Miltzow, Tillmann and Urhausen, J\'{e}r\^{o}me and Vermeulen, Jordi and Viglietta, Giovanni}, title = {{Chasing Puppies: Mobile Beacon Routing on Closed Curves}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {5:1--5:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.5}, URN = {urn:nbn:de:0030-drops-138046}, doi = {10.4230/LIPIcs.SoCG.2021.5}, annote = {Keywords: Beacon routing, navigation, generic smooth curves, puppies} }
Mikkel Abrahamsen and Lorenzo Beretta. Online Packing to Minimize Area or Perimeter. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 6:1-6:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2021.6, author = {Abrahamsen, Mikkel and Beretta, Lorenzo}, title = {{Online Packing to Minimize Area or Perimeter}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {6:1--6:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.6}, URN = {urn:nbn:de:0030-drops-138054}, doi = {10.4230/LIPIcs.SoCG.2021.6}, annote = {Keywords: Packing, online algorithms} }
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, and Bodhayan Roy. Complexity of Maximum Cut on Interval Graphs. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 7:1-7:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{adhikary_et_al:LIPIcs.SoCG.2021.7, author = {Adhikary, Ranendu and Bose, Kaustav and Mukherjee, Satwik and Roy, Bodhayan}, title = {{Complexity of Maximum Cut on Interval Graphs}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {7:1--7:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.7}, URN = {urn:nbn:de:0030-drops-138067}, doi = {10.4230/LIPIcs.SoCG.2021.7}, annote = {Keywords: Maximum cut, Interval graph, NP-complete} }
Peyman Afshani and Pingan Cheng. Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 8:1-8:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{afshani_et_al:LIPIcs.SoCG.2021.8, author = {Afshani, Peyman and Cheng, Pingan}, title = {{Lower Bounds for Semialgebraic Range Searching and Stabbing Problems}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {8:1--8:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.8}, URN = {urn:nbn:de:0030-drops-138072}, doi = {10.4230/LIPIcs.SoCG.2021.8}, annote = {Keywords: Computational Geometry, Data Structures and Algorithms} }
Henk Alkema and Mark de Berg. Rectilinear Steiner Trees in Narrow Strips. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 9:1-9:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{alkema_et_al:LIPIcs.SoCG.2021.9, author = {Alkema, Henk and de Berg, Mark}, title = {{Rectilinear Steiner Trees in Narrow Strips}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.9}, URN = {urn:nbn:de:0030-drops-138081}, doi = {10.4230/LIPIcs.SoCG.2021.9}, annote = {Keywords: Computational geometry, fixed-parameter tractable algorithms} }
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, and Vera Sacristán. Characterizing Universal Reconfigurability of Modular Pivoting Robots. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 10:1-10:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{a.akitaya_et_al:LIPIcs.SoCG.2021.10, author = {A. Akitaya, Hugo and Demaine, Erik D. and Gonczi, Andrei and Hendrickson, Dylan H. and Hesterberg, Adam and Korman, Matias and Korten, Oliver and Lynch, Jayson and Parada, Irene and Sacrist\'{a}n, Vera}, title = {{Characterizing Universal Reconfigurability of Modular Pivoting Robots}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {10:1--10:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.10}, URN = {urn:nbn:de:0030-drops-138094}, doi = {10.4230/LIPIcs.SoCG.2021.10}, annote = {Keywords: reconfiguration, geometric algorithm, PSPACE-hardness, pivoting hexagons, pivoting squares, modular robots} }
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, and Alexander Wolff. Adjacency Graphs of Polyhedral Surfaces. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 11:1-11:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{arseneva_et_al:LIPIcs.SoCG.2021.11, author = {Arseneva, Elena and Kleist, Linda and Klemz, Boris and L\"{o}ffler, Maarten and Schulz, Andr\'{e} and Vogtenhuber, Birgit and Wolff, Alexander}, title = {{Adjacency Graphs of Polyhedral Surfaces}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {11:1--11:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.11}, URN = {urn:nbn:de:0030-drops-138107}, doi = {10.4230/LIPIcs.SoCG.2021.11}, annote = {Keywords: polyhedral complexes, realizability, contact representation} }
Stav Ashur and Sariel Har-Peled. On Undecided LP, Clustering and Active Learning. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{ashur_et_al:LIPIcs.SoCG.2021.12, author = {Ashur, Stav and Har-Peled, Sariel}, title = {{On Undecided LP, Clustering and Active Learning}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.12}, URN = {urn:nbn:de:0030-drops-138116}, doi = {10.4230/LIPIcs.SoCG.2021.12}, annote = {Keywords: Linear Programming, Active learning, Classification} }
Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, and Yury Makarychev. Two-Sided Kirszbraun Theorem. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 13:1-13:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{backurs_et_al:LIPIcs.SoCG.2021.13, author = {Backurs, Arturs and Mahabadi, Sepideh and Makarychev, Konstantin and Makarychev, Yury}, title = {{Two-Sided Kirszbraun Theorem}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {13:1--13:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.13}, URN = {urn:nbn:de:0030-drops-138129}, doi = {10.4230/LIPIcs.SoCG.2021.13}, annote = {Keywords: Kirszbraun theorem, Lipschitz map, Outer-extension, Two-sided extension} }
Imre Bárány, Attila Pór, and Pavel Valtr. Orientation Preserving Maps of the Square Grid. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 14:1-14:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{barany_et_al:LIPIcs.SoCG.2021.14, author = {B\'{a}r\'{a}ny, Imre and P\'{o}r, Attila and Valtr, Pavel}, title = {{Orientation Preserving Maps of the Square Grid}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {14:1--14:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.14}, URN = {urn:nbn:de:0030-drops-138130}, doi = {10.4230/LIPIcs.SoCG.2021.14}, annote = {Keywords: square grid, plane, order type} }
Sujoy Bhore and Csaba D. Tóth. Light Euclidean Steiner Spanners in the Plane. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 15:1-15:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{bhore_et_al:LIPIcs.SoCG.2021.15, author = {Bhore, Sujoy and T\'{o}th, Csaba D.}, title = {{Light Euclidean Steiner Spanners in the Plane}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.15}, URN = {urn:nbn:de:0030-drops-138145}, doi = {10.4230/LIPIcs.SoCG.2021.15}, annote = {Keywords: Geometric spanner, lightness, minimum weight} }
Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 16:1-16:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{biswas_et_al:LIPIcs.SoCG.2021.16, author = {Biswas, Ranita and Cultrera di Montesano, Sebastiano and Edelsbrunner, Herbert and Saghafian, Morteza}, title = {{Counting Cells of Order-k Voronoi Tessellations in \mathbb{R}³ with Morse Theory}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {16:1--16:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.16}, URN = {urn:nbn:de:0030-drops-138152}, doi = {10.4230/LIPIcs.SoCG.2021.16}, annote = {Keywords: Voronoi tessellations, Delaunay mosaics, arrangements, convex polytopes, Morse theory, counting} }
Jean-Daniel Boissonnat, Siargey Kachanovich, and Mathijs Wintraecken. Tracing Isomanifolds in ℝ^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 17:1-17:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2021.17, author = {Boissonnat, Jean-Daniel and Kachanovich, Siargey and Wintraecken, Mathijs}, title = {{Tracing Isomanifolds in \mathbb{R}^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.17}, URN = {urn:nbn:de:0030-drops-138163}, doi = {10.4230/LIPIcs.SoCG.2021.17}, annote = {Keywords: Coxeter triangulation, Kuhn triangulation, permutahedron, PL-approximations, isomanifolds/solution manifolds/isosurfacing} }
Karl Bringmann and André Nusser. Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 18:1-18:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{bringmann_et_al:LIPIcs.SoCG.2021.18, author = {Bringmann, Karl and Nusser, Andr\'{e}}, title = {{Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.18}, URN = {urn:nbn:de:0030-drops-138177}, doi = {10.4230/LIPIcs.SoCG.2021.18}, annote = {Keywords: Hausdorff Distance Under Translation, Fine-Grained Complexity Theory, Lower Bounds} }
Denys Bulavka, Afshin Goodarzi, and Martin Tancer. Optimal Bounds for the Colorful Fractional Helly Theorem. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 19:1-19:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{bulavka_et_al:LIPIcs.SoCG.2021.19, author = {Bulavka, Denys and Goodarzi, Afshin and Tancer, Martin}, title = {{Optimal Bounds for the Colorful Fractional Helly Theorem}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.19}, URN = {urn:nbn:de:0030-drops-138186}, doi = {10.4230/LIPIcs.SoCG.2021.19}, annote = {Keywords: colorful fractional Helly theorem, d-collapsible, exterior algebra, d-representable} }
Hadrien Cambazard and Nicolas Catusse. An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 20:1-20:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{cambazard_et_al:LIPIcs.SoCG.2021.20, author = {Cambazard, Hadrien and Catusse, Nicolas}, title = {{An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {20:1--20:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.20}, URN = {urn:nbn:de:0030-drops-138198}, doi = {10.4230/LIPIcs.SoCG.2021.20}, annote = {Keywords: convex partition, integer programming, geometric optimization} }
Apostolos Chalkis, Vissarion Fisikopoulos, Elias Tsigaridas, and Haris Zafeiropoulos. Geometric Algorithms for Sampling the Flux Space of Metabolic Networks. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 21:1-21:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{chalkis_et_al:LIPIcs.SoCG.2021.21, author = {Chalkis, Apostolos and Fisikopoulos, Vissarion and Tsigaridas, Elias and Zafeiropoulos, Haris}, title = {{Geometric Algorithms for Sampling the Flux Space of Metabolic Networks}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.21}, URN = {urn:nbn:de:0030-drops-138201}, doi = {10.4230/LIPIcs.SoCG.2021.21}, annote = {Keywords: Flux analysis, metabolic networks, convex polytopes, random walks, sampling} }
Erin Wolf Chambers, Elizabeth Munch, and Tim Ophelders. A Family of Metrics from the Truncated Smoothing of Reeb Graphs. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 22:1-22:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{chambers_et_al:LIPIcs.SoCG.2021.22, author = {Chambers, Erin Wolf and Munch, Elizabeth and Ophelders, Tim}, title = {{A Family of Metrics from the Truncated Smoothing of Reeb Graphs}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {22:1--22:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.22}, URN = {urn:nbn:de:0030-drops-138218}, doi = {10.4230/LIPIcs.SoCG.2021.22}, annote = {Keywords: Reeb graphs, interleaving distance, graphical signatures} }
Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, and Salman Parsa. Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 23:1-23:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{chambers_et_al:LIPIcs.SoCG.2021.23, author = {Chambers, Erin Wolf and Lazarus, Francis and de Mesmay, Arnaud and Parsa, Salman}, title = {{Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.23}, URN = {urn:nbn:de:0030-drops-138223}, doi = {10.4230/LIPIcs.SoCG.2021.23}, annote = {Keywords: 3-manifolds, surfaces, low-dimensional topology, contractibility, compressed curves} }
Timothy M. Chan. Faster Algorithms for Largest Empty Rectangles and Boxes. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 24:1-24:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{chan:LIPIcs.SoCG.2021.24, author = {Chan, Timothy M.}, title = {{Faster Algorithms for Largest Empty Rectangles and Boxes}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {24:1--24:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.24}, URN = {urn:nbn:de:0030-drops-138231}, doi = {10.4230/LIPIcs.SoCG.2021.24}, annote = {Keywords: Largest empty rectangle, largest empty box, Klee’s measure problem} }
Timothy M. Chan and Qizheng He. More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 25:1-25:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{chan_et_al:LIPIcs.SoCG.2021.25, author = {Chan, Timothy M. and He, Qizheng}, title = {{More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.25}, URN = {urn:nbn:de:0030-drops-138244}, doi = {10.4230/LIPIcs.SoCG.2021.25}, annote = {Keywords: Geometric set cover, approximation algorithms, dynamic data structures, sublinear algorithms, random sampling} }
Connor Colombe and Kyle Fox. Approximating the (Continuous) Fréchet Distance. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 26:1-26:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{colombe_et_al:LIPIcs.SoCG.2021.26, author = {Colombe, Connor and Fox, Kyle}, title = {{Approximating the (Continuous) Fr\'{e}chet Distance}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {26:1--26:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.26}, URN = {urn:nbn:de:0030-drops-138259}, doi = {10.4230/LIPIcs.SoCG.2021.26}, annote = {Keywords: Fr\'{e}chet distance, approximation algorithm, approximate decision procedure} }
René Corbet, Michael Kerber, Michael Lesnick, and Georg Osang. Computing the Multicover Bifiltration. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 27:1-27:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{corbet_et_al:LIPIcs.SoCG.2021.27, author = {Corbet, Ren\'{e} and Kerber, Michael and Lesnick, Michael and Osang, Georg}, title = {{Computing the Multicover Bifiltration}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {27:1--27:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.27}, URN = {urn:nbn:de:0030-drops-138260}, doi = {10.4230/LIPIcs.SoCG.2021.27}, annote = {Keywords: Bifiltrations, nerves, higher-order Delaunay complexes, higher-order Voronoi diagrams, rhomboid tiling, multiparameter persistent homology, denoising} }
Mónika Csikós and Nabil H. Mustafa. Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 28:1-28:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{csikos_et_al:LIPIcs.SoCG.2021.28, author = {Csik\'{o}s, M\'{o}nika and Mustafa, Nabil H.}, title = {{Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.28}, URN = {urn:nbn:de:0030-drops-138273}, doi = {10.4230/LIPIcs.SoCG.2021.28}, annote = {Keywords: Matchings, crossing numbers, approximations} }
James Davies, Tomasz Krawczyk, Rose McCarty, and Bartosz Walczak. Colouring Polygon Visibility Graphs and Their Generalizations. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 29:1-29:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{davies_et_al:LIPIcs.SoCG.2021.29, author = {Davies, James and Krawczyk, Tomasz and McCarty, Rose and Walczak, Bartosz}, title = {{Colouring Polygon Visibility Graphs and Their Generalizations}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.29}, URN = {urn:nbn:de:0030-drops-138281}, doi = {10.4230/LIPIcs.SoCG.2021.29}, annote = {Keywords: Visibility graphs, \chi-boundedness, pseudoline arrangements, ordered graphs} }
Tamal K. Dey and Tao Hou. Computing Zigzag Persistence on Graphs in Near-Linear Time. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 30:1-30:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{dey_et_al:LIPIcs.SoCG.2021.30, author = {Dey, Tamal K. and Hou, Tao}, title = {{Computing Zigzag Persistence on Graphs in Near-Linear Time}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.30}, URN = {urn:nbn:de:0030-drops-138292}, doi = {10.4230/LIPIcs.SoCG.2021.30}, annote = {Keywords: persistent homology, zigzag persistence, graph filtration, dynamic networks} }
Matthijs Ebbens, Hugo Parlier, and Gert Vegter. Minimal Delaunay Triangulations of Hyperbolic Surfaces. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 31:1-31:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{ebbens_et_al:LIPIcs.SoCG.2021.31, author = {Ebbens, Matthijs and Parlier, Hugo and Vegter, Gert}, title = {{Minimal Delaunay Triangulations of Hyperbolic Surfaces}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.31}, URN = {urn:nbn:de:0030-drops-138305}, doi = {10.4230/LIPIcs.SoCG.2021.31}, annote = {Keywords: Delaunay triangulations, hyperbolic surfaces, metric graph embeddings, moduli spaces} }
Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, and Mathijs Wintraecken. The Density Fingerprint of a Periodic Point Set. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 32:1-32:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{edelsbrunner_et_al:LIPIcs.SoCG.2021.32, author = {Edelsbrunner, Herbert and Heiss, Teresa and Kurlin, Vitaliy and Smith, Philip and Wintraecken, Mathijs}, title = {{The Density Fingerprint of a Periodic Point Set}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {32:1--32:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.32}, URN = {urn:nbn:de:0030-drops-138310}, doi = {10.4230/LIPIcs.SoCG.2021.32}, annote = {Keywords: Lattices, periodic sets, isometries, Dirichlet-Voronoi domains, Brillouin zones, bottleneck distance, stability, continuity, crystal database} }
David Eppstein and Hadi Khodabandeh. On the Edge Crossings of the Greedy Spanner. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 33:1-33:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{eppstein_et_al:LIPIcs.SoCG.2021.33, author = {Eppstein, David and Khodabandeh, Hadi}, title = {{On the Edge Crossings of the Greedy Spanner}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {33:1--33:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.33}, URN = {urn:nbn:de:0030-drops-138328}, doi = {10.4230/LIPIcs.SoCG.2021.33}, annote = {Keywords: Geometric Spanners, Greedy Spanners, Separators, Crossing Graph, Sparsity} }
Esther Ezra and Micha Sharir. On Ray Shooting for Triangles in 3-Space and Related Problems. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 34:1-34:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{ezra_et_al:LIPIcs.SoCG.2021.34, author = {Ezra, Esther and Sharir, Micha}, title = {{On Ray Shooting for Triangles in 3-Space and Related Problems}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {34:1--34:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.34}, URN = {urn:nbn:de:0030-drops-138332}, doi = {10.4230/LIPIcs.SoCG.2021.34}, annote = {Keywords: Ray shooting, Three dimensions, Polynomial partitioning, Tradeoff} }
Esther Ezra, Orit E. Raz, Micha Sharir, and Joshua Zahl. On Rich Lenses in Planar Arrangements of Circles and Related Problems. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 35:1-35:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{ezra_et_al:LIPIcs.SoCG.2021.35, author = {Ezra, Esther and Raz, Orit E. and Sharir, Micha and Zahl, Joshua}, title = {{On Rich Lenses in Planar Arrangements of Circles and Related Problems}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {35:1--35:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.35}, URN = {urn:nbn:de:0030-drops-138343}, doi = {10.4230/LIPIcs.SoCG.2021.35}, annote = {Keywords: Lenses, Circles, Polynomial partitioning, Incidences} }
Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, and Christian Scheffer. Packing Squares into a Disk with Optimal Worst-Case Density. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 36:1-36:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{fekete_et_al:LIPIcs.SoCG.2021.36, author = {Fekete, S\'{a}ndor P. and Gurunathan, Vijaykrishna and Juneja, Kushagra and Keldenich, Phillip and Kleist, Linda and Scheffer, Christian}, title = {{Packing Squares into a Disk with Optimal Worst-Case Density}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.36}, URN = {urn:nbn:de:0030-drops-138356}, doi = {10.4230/LIPIcs.SoCG.2021.36}, annote = {Keywords: Square packing, packing density, tight worst-case bound, interval arithmetic, approximation} }
Jacob Fox, János Pach, and Andrew Suk. Sunflowers in Set Systems of Bounded Dimension. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 37:1-37:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{fox_et_al:LIPIcs.SoCG.2021.37, author = {Fox, Jacob and Pach, J\'{a}nos and Suk, Andrew}, title = {{Sunflowers in Set Systems of Bounded Dimension}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {37:1--37:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.37}, URN = {urn:nbn:de:0030-drops-138366}, doi = {10.4230/LIPIcs.SoCG.2021.37}, annote = {Keywords: Sunflower, VC-dimension, Littlestone dimension, pseudodisks} }
Radoslav Fulek, Michael J. Pelsmajer, and Marcus Schaefer. Strong Hanani-Tutte for the Torus. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 38:1-38:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{fulek_et_al:LIPIcs.SoCG.2021.38, author = {Fulek, Radoslav and Pelsmajer, Michael J. and Schaefer, Marcus}, title = {{Strong Hanani-Tutte for the Torus}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {38:1--38:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.38}, URN = {urn:nbn:de:0030-drops-138378}, doi = {10.4230/LIPIcs.SoCG.2021.38}, annote = {Keywords: Graph Embedding, Torus, Hanani-Tutte Theorem, Intersection Form} }
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, and Andreas Wiese. Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 39:1-39:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{galvez_et_al:LIPIcs.SoCG.2021.39, author = {G\'{a}lvez, Waldo and Grandoni, Fabrizio and Khan, Arindam and Ram{\'\i}rez-Romero, Diego and Wiese, Andreas}, title = {{Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {39:1--39:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.39}, URN = {urn:nbn:de:0030-drops-138386}, doi = {10.4230/LIPIcs.SoCG.2021.39}, annote = {Keywords: Approximation algorithms, two-dimensional knapsack, geometric packing} }
Xavier Goaoc, Andreas F. Holmsen, and Zuzana Patáková. A Stepping-Up Lemma for Topological Set Systems. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 40:1-40:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{goaoc_et_al:LIPIcs.SoCG.2021.40, author = {Goaoc, Xavier and Holmsen, Andreas F. and Pat\'{a}kov\'{a}, Zuzana}, title = {{A Stepping-Up Lemma for Topological Set Systems}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {40:1--40:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.40}, URN = {urn:nbn:de:0030-drops-138396}, doi = {10.4230/LIPIcs.SoCG.2021.40}, annote = {Keywords: Helly-type theorem, Topological combinatorics, Homological minors, Stair convexity, Cubical complexes, Homological VC dimension, Ramsey-type theorem} }
Dan Halperin, Micha Sharir, and Itay Yehuda. Throwing a Sofa Through the Window. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 41:1-41:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{halperin_et_al:LIPIcs.SoCG.2021.41, author = {Halperin, Dan and Sharir, Micha and Yehuda, Itay}, title = {{Throwing a Sofa Through the Window}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {41:1--41:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.41}, URN = {urn:nbn:de:0030-drops-138409}, doi = {10.4230/LIPIcs.SoCG.2021.41}, annote = {Keywords: Motion planning, Convex polytopes in 3D} }
Sariel Har-Peled and Mitchell Jones. Stabbing Convex Bodies with Lines and Flats. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 42:1-42:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{harpeled_et_al:LIPIcs.SoCG.2021.42, author = {Har-Peled, Sariel and Jones, Mitchell}, title = {{Stabbing Convex Bodies with Lines and Flats}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {42:1--42:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.42}, URN = {urn:nbn:de:0030-drops-138412}, doi = {10.4230/LIPIcs.SoCG.2021.42}, annote = {Keywords: Discrete geometry, combinatorics, weak \epsilon-nets, k-flats} }
Sariel Har-Peled, Manor Mendel, and Dániel Oláh. Reliable Spanners for Metric Spaces. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 43:1-43:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{harpeled_et_al:LIPIcs.SoCG.2021.43, author = {Har-Peled, Sariel and Mendel, Manor and Ol\'{a}h, D\'{a}niel}, title = {{Reliable Spanners for Metric Spaces}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {43:1--43:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.43}, URN = {urn:nbn:de:0030-drops-138423}, doi = {10.4230/LIPIcs.SoCG.2021.43}, annote = {Keywords: Spanners, reliability} }
Simon B. Hengeveld and Tillmann Miltzow. A Practical Algorithm with Performance Guarantees for the Art Gallery Problem. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 44:1-44:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{hengeveld_et_al:LIPIcs.SoCG.2021.44, author = {Hengeveld, Simon B. and Miltzow, Tillmann}, title = {{A Practical Algorithm with Performance Guarantees for the Art Gallery Problem}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {44:1--44:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.44}, URN = {urn:nbn:de:0030-drops-138433}, doi = {10.4230/LIPIcs.SoCG.2021.44}, annote = {Keywords: Art Gallery, Parametrized complexity, Integer Programming, Visibility} }
Ziyue Huang and Ke Yi. Approximate Range Counting Under Differential Privacy. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 45:1-45:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{huang_et_al:LIPIcs.SoCG.2021.45, author = {Huang, Ziyue and Yi, Ke}, title = {{Approximate Range Counting Under Differential Privacy}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {45:1--45:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.45}, URN = {urn:nbn:de:0030-drops-138441}, doi = {10.4230/LIPIcs.SoCG.2021.45}, annote = {Keywords: Differential Privacy, Approximate Range Counting} }
Adam Karczmarz, Jakub Pawlewicz, and Piotr Sankowski. Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 46:1-46:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{karczmarz_et_al:LIPIcs.SoCG.2021.46, author = {Karczmarz, Adam and Pawlewicz, Jakub and Sankowski, Piotr}, title = {{Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {46:1--46:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.46}, URN = {urn:nbn:de:0030-drops-138454}, doi = {10.4230/LIPIcs.SoCG.2021.46}, annote = {Keywords: unit-disk graphs, shortest paths, distance oracles} }
Chaya Keller and Micha A. Perles. No Krasnoselskii Number for General Sets. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 47:1-47:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{keller_et_al:LIPIcs.SoCG.2021.47, author = {Keller, Chaya and Perles, Micha A.}, title = {{No Krasnoselskii Number for General Sets}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {47:1--47:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.47}, URN = {urn:nbn:de:0030-drops-138462}, doi = {10.4230/LIPIcs.SoCG.2021.47}, annote = {Keywords: visibility, Helly-type theorems, Krasnoselskii’s theorem, transfinite induction, well-ordering theorem} }
Arindam Khan, Arnab Maiti, Amatya Sharma, and Andreas Wiese. On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 48:1-48:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{khan_et_al:LIPIcs.SoCG.2021.48, author = {Khan, Arindam and Maiti, Arnab and Sharma, Amatya and Wiese, Andreas}, title = {{On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {48:1--48:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.48}, URN = {urn:nbn:de:0030-drops-138474}, doi = {10.4230/LIPIcs.SoCG.2021.48}, annote = {Keywords: Approximation Algorithms, Multidimensional Knapsack, Guillotine Cuts, Geometric Packing, Rectangle Packing} }
Marc Khoury and Jonathan Richard Shewchuk. Restricted Constrained Delaunay Triangulations. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 49:1-49:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{khoury_et_al:LIPIcs.SoCG.2021.49, author = {Khoury, Marc and Shewchuk, Jonathan Richard}, title = {{Restricted Constrained Delaunay Triangulations}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {49:1--49:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.49}, URN = {urn:nbn:de:0030-drops-138481}, doi = {10.4230/LIPIcs.SoCG.2021.49}, annote = {Keywords: restricted Delaunay triangulation, constrained Delaunay triangulation, surface meshing, surface reconstruction, topological surgery, portals} }
Deepanshu Kush, Aleksandar Nikolov, and Haohua Tang. Near Neighbor Search via Efficient Average Distortion Embeddings. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 50:1-50:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{kush_et_al:LIPIcs.SoCG.2021.50, author = {Kush, Deepanshu and Nikolov, Aleksandar and Tang, Haohua}, title = {{Near Neighbor Search via Efficient Average Distortion Embeddings}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {50:1--50:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.50}, URN = {urn:nbn:de:0030-drops-138490}, doi = {10.4230/LIPIcs.SoCG.2021.50}, annote = {Keywords: Nearest neighbor search, metric space embeddings, average distortion embeddings, locality-sensitive hashing} }
Aditi Laddha and Santosh S. Vempala. Convergence of Gibbs Sampling: Coordinate Hit-And-Run Mixes Fast. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{laddha_et_al:LIPIcs.SoCG.2021.51, author = {Laddha, Aditi and Vempala, Santosh S.}, title = {{Convergence of Gibbs Sampling: Coordinate Hit-And-Run Mixes Fast}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {51:1--51:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.51}, URN = {urn:nbn:de:0030-drops-138503}, doi = {10.4230/LIPIcs.SoCG.2021.51}, annote = {Keywords: Gibbs Sampler, Coordinate Hit and run, Mixing time of Markov Chain} }
Goran Malić and Ileana Streinu. Combinatorial Resultants in the Algebraic Rigidity Matroid. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 52:1-52:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{malic_et_al:LIPIcs.SoCG.2021.52, author = {Mali\'{c}, Goran and Streinu, Ileana}, title = {{Combinatorial Resultants in the Algebraic Rigidity Matroid}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {52:1--52:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.52}, URN = {urn:nbn:de:0030-drops-138514}, doi = {10.4230/LIPIcs.SoCG.2021.52}, annote = {Keywords: Cayley-Menger ideal, rigidity matroid, circuit polynomial, combinatorial resultant, inductive construction, Gr\"{o}bner basis elimination} }
Clément Maria. Parameterized Complexity of Quantum Knot Invariants. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 53:1-53:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{maria:LIPIcs.SoCG.2021.53, author = {Maria, Cl\'{e}ment}, title = {{Parameterized Complexity of Quantum Knot Invariants}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {53:1--53:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.53}, URN = {urn:nbn:de:0030-drops-138527}, doi = {10.4230/LIPIcs.SoCG.2021.53}, annote = {Keywords: computational knot theory, parameterized complexity, quantum invariants} }
Arturo Merino and Torsten Mütze. Efficient Generation of Rectangulations via Permutation Languages. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 54:1-54:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{merino_et_al:LIPIcs.SoCG.2021.54, author = {Merino, Arturo and M\"{u}tze, Torsten}, title = {{Efficient Generation of Rectangulations via Permutation Languages}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {54:1--54:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.54}, URN = {urn:nbn:de:0030-drops-138534}, doi = {10.4230/LIPIcs.SoCG.2021.54}, annote = {Keywords: Exhaustive generation, Gray code, flip graph, polytope, generic rectangulation, diagonal rectangulation, cartogram, floorplan, permutation pattern} }
Tim Ophelders, Ignaz Rutter, Bettina Speckmann, and Kevin Verbeek. Polygon-Universal Graphs. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 55:1-55:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{ophelders_et_al:LIPIcs.SoCG.2021.55, author = {Ophelders, Tim and Rutter, Ignaz and Speckmann, Bettina and Verbeek, Kevin}, title = {{Polygon-Universal Graphs}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {55:1--55:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.55}, URN = {urn:nbn:de:0030-drops-138540}, doi = {10.4230/LIPIcs.SoCG.2021.55}, annote = {Keywords: Graph drawing, partial drawing extension, simple polygon} }
Micha Sharir and Noam Solomon. On Rich Points and Incidences with Restricted Sets of Lines in 3-Space. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 56:1-56:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{sharir_et_al:LIPIcs.SoCG.2021.56, author = {Sharir, Micha and Solomon, Noam}, title = {{On Rich Points and Incidences with Restricted Sets of Lines in 3-Space}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {56:1--56:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.56}, URN = {urn:nbn:de:0030-drops-138551}, doi = {10.4230/LIPIcs.SoCG.2021.56}, annote = {Keywords: Lines in space, Rich points, Polynomial partitioning, Incidences} }
Donald R. Sheehy and Siddharth Sheth. Sketching Persistence Diagrams. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 57:1-57:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{sheehy_et_al:LIPIcs.SoCG.2021.57, author = {Sheehy, Donald R. and Sheth, Siddharth}, title = {{Sketching Persistence Diagrams}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {57:1--57:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.57}, URN = {urn:nbn:de:0030-drops-138569}, doi = {10.4230/LIPIcs.SoCG.2021.57}, annote = {Keywords: Bottleneck Distance, Persistent Homology, Approximate Persistence Diagrams} }
Donald R. Sheehy. A Sparse Delaunay Filtration. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 58:1-58:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{sheehy:LIPIcs.SoCG.2021.58, author = {Sheehy, Donald R.}, title = {{A Sparse Delaunay Filtration}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {58:1--58:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.58}, URN = {urn:nbn:de:0030-drops-138579}, doi = {10.4230/LIPIcs.SoCG.2021.58}, annote = {Keywords: Delaunay Triangulation, Persistent Homology, Sparse Filtrations} }
Haitao Wang. An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 59:1-59:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{wang:LIPIcs.SoCG.2021.59, author = {Wang, Haitao}, title = {{An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {59:1--59:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.59}, URN = {urn:nbn:de:0030-drops-138585}, doi = {10.4230/LIPIcs.SoCG.2021.59}, annote = {Keywords: farthest-sites, Voronoi diagrams, triple-point geodesic center, simple polygons} }
Yiqiu Wang, Shangdi Yu, Yan Gu, and Julian Shun. A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 60:1-60:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{wang_et_al:LIPIcs.SoCG.2021.60, author = {Wang, Yiqiu and Yu, Shangdi and Gu, Yan and Shun, Julian}, title = {{A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {60:1--60:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.60}, URN = {urn:nbn:de:0030-drops-138594}, doi = {10.4230/LIPIcs.SoCG.2021.60}, annote = {Keywords: Closest Pair, Parallel Algorithms, Dynamic Algorithms, Experimental Algorithms} }
Fred Anderson, Anirban Ghosh, Matthew Graham, Lucas Mougeot, and David Wisnosky. An Interactive Tool for Experimenting with Bounded-Degree Plane Geometric Spanners (Media Exposition). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 61:1-61:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{anderson_et_al:LIPIcs.SoCG.2021.61, author = {Anderson, Fred and Ghosh, Anirban and Graham, Matthew and Mougeot, Lucas and Wisnosky, David}, title = {{An Interactive Tool for Experimenting with Bounded-Degree Plane Geometric Spanners}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {61:1--61:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.61}, URN = {urn:nbn:de:0030-drops-138607}, doi = {10.4230/LIPIcs.SoCG.2021.61}, annote = {Keywords: graph approximation, Delaunay triangulations, geometric spanners, plane spanners, bounded-degree spanners} }
Aaron T. Becker, Sándor P. Fekete, Matthias Konitzny, Sebastian Morr, and Arne Schmidt. Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 62:1-62:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{becker_et_al:LIPIcs.SoCG.2021.62, author = {Becker, Aaron T. and Fekete, S\'{a}ndor P. and Konitzny, Matthias and Morr, Sebastian and Schmidt, Arne}, title = {{Can You Walk This? Eulerian Tours and IDEA Instructions}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {62:1--62:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.62}, URN = {urn:nbn:de:0030-drops-138616}, doi = {10.4230/LIPIcs.SoCG.2021.62}, annote = {Keywords: Eulerian tours, algorithms, education, IDEA instructions} }
Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, and Luc Libralesso. Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 63:1-63:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{crombez_et_al:LIPIcs.SoCG.2021.63, author = {Crombez, Lo\"{i}c and da Fonseca, Guilherme D. and Gerard, Yan and Gonzalez-Lorenzo, Aldo and Lafourcade, Pascal and Libralesso, Luc}, title = {{Shadoks Approach to Low-Makespan Coordinated Motion Planning}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {63:1--63:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.63}, URN = {urn:nbn:de:0030-drops-138622}, doi = {10.4230/LIPIcs.SoCG.2021.63}, annote = {Keywords: heuristics, motion planning, digital geometry, shortest path} }
Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, and Da Wei Zheng. Coordinated Motion Planning Through Randomized k-Opt (CG Challenge). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 64:1-64:8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{liu_et_al:LIPIcs.SoCG.2021.64, author = {Liu, Paul and Spalding-Jamieson, Jack and Zhang, Brandon and Zheng, Da Wei}, title = {{Coordinated Motion Planning Through Randomized k-Opt}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {64:1--64:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.64}, URN = {urn:nbn:de:0030-drops-138635}, doi = {10.4230/LIPIcs.SoCG.2021.64}, annote = {Keywords: motion planning, randomized local search, path finding} }
Hyeyun Yang and Antoine Vigneron. A Simulated Annealing Approach to Coordinated Motion Planning (CG Challenge). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 65:1-65:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{yang_et_al:LIPIcs.SoCG.2021.65, author = {Yang, Hyeyun and Vigneron, Antoine}, title = {{A Simulated Annealing Approach to Coordinated Motion Planning}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {65:1--65:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.65}, URN = {urn:nbn:de:0030-drops-138649}, doi = {10.4230/LIPIcs.SoCG.2021.65}, annote = {Keywords: Path planning, simulated annealing, local search} }
Feedback for Dagstuhl Publishing