<h2>LIPIcs, Volume 189, SoCG 2021</h2>
<ul>
<li>
<span class="authors">Kevin Buchin and Éric Colin de Verdière</span>
<span class="title">LIPIcs, Volume 189, SoCG 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021">10.4230/LIPIcs.SoCG.2021</a>
</li>
<li>
<span class="authors">Kevin Buchin and Éric Colin de Verdière</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.0">10.4230/LIPIcs.SoCG.2021.0</a>
</li>
<li>
<span class="authors">Robert Ghrist</span>
<span class="title">On Laplacians (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.1">10.4230/LIPIcs.SoCG.2021.1</a>
</li>
<li>
<span class="authors">Virginia Vassilevska Williams</span>
<span class="title">3SUM and Related Problems in Fine-Grained Complexity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.2">10.4230/LIPIcs.SoCG.2021.2</a>
</li>
<li>
<span class="authors">Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, and Peter Michael Reichstein Rasmussen</span>
<span class="title">Classifying Convex Bodies by Their Contact and Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.3">10.4230/LIPIcs.SoCG.2021.3</a>
</li>
<li>
<span class="authors">Ahmed Abdelkader and David M. Mount</span>
<span class="title">Approximate Nearest-Neighbor Search for Line Segments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.4">10.4230/LIPIcs.SoCG.2021.4</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi Vermeulen, and Giovanni Viglietta</span>
<span class="title">Chasing Puppies: Mobile Beacon Routing on Closed Curves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.5">10.4230/LIPIcs.SoCG.2021.5</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen and Lorenzo Beretta</span>
<span class="title">Online Packing to Minimize Area or Perimeter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.6">10.4230/LIPIcs.SoCG.2021.6</a>
</li>
<li>
<span class="authors">Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, and Bodhayan Roy</span>
<span class="title">Complexity of Maximum Cut on Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.7">10.4230/LIPIcs.SoCG.2021.7</a>
</li>
<li>
<span class="authors">Peyman Afshani and Pingan Cheng</span>
<span class="title">Lower Bounds for Semialgebraic Range Searching and Stabbing Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.8">10.4230/LIPIcs.SoCG.2021.8</a>
</li>
<li>
<span class="authors">Henk Alkema and Mark de Berg</span>
<span class="title">Rectilinear Steiner Trees in Narrow Strips</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.9">10.4230/LIPIcs.SoCG.2021.9</a>
</li>
<li>
<span class="authors">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</span>
<span class="title">Characterizing Universal Reconfigurability of Modular Pivoting Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.10">10.4230/LIPIcs.SoCG.2021.10</a>
</li>
<li>
<span class="authors">Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, and Alexander Wolff</span>
<span class="title">Adjacency Graphs of Polyhedral Surfaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.11">10.4230/LIPIcs.SoCG.2021.11</a>
</li>
<li>
<span class="authors">Stav Ashur and Sariel Har-Peled</span>
<span class="title">On Undecided LP, Clustering and Active Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.12">10.4230/LIPIcs.SoCG.2021.12</a>
</li>
<li>
<span class="authors">Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, and Yury Makarychev</span>
<span class="title">Two-Sided Kirszbraun Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.13">10.4230/LIPIcs.SoCG.2021.13</a>
</li>
<li>
<span class="authors">Imre Bárány, Attila Pór, and Pavel Valtr</span>
<span class="title">Orientation Preserving Maps of the Square Grid</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.14">10.4230/LIPIcs.SoCG.2021.14</a>
</li>
<li>
<span class="authors">Sujoy Bhore and Csaba D. Tóth</span>
<span class="title">Light Euclidean Steiner Spanners in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.15">10.4230/LIPIcs.SoCG.2021.15</a>
</li>
<li>
<span class="authors">Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian</span>
<span class="title">Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.16">10.4230/LIPIcs.SoCG.2021.16</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat, Siargey Kachanovich, and Mathijs Wintraecken</span>
<span class="title">Tracing Isomanifolds in ℝ^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.17">10.4230/LIPIcs.SoCG.2021.17</a>
</li>
<li>
<span class="authors">Karl Bringmann and André Nusser</span>
<span class="title">Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.18">10.4230/LIPIcs.SoCG.2021.18</a>
</li>
<li>
<span class="authors">Denys Bulavka, Afshin Goodarzi, and Martin Tancer</span>
<span class="title">Optimal Bounds for the Colorful Fractional Helly Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.19">10.4230/LIPIcs.SoCG.2021.19</a>
</li>
<li>
<span class="authors">Hadrien Cambazard and Nicolas Catusse</span>
<span class="title">An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.20">10.4230/LIPIcs.SoCG.2021.20</a>
</li>
<li>
<span class="authors">Apostolos Chalkis, Vissarion Fisikopoulos, Elias Tsigaridas, and Haris Zafeiropoulos</span>
<span class="title">Geometric Algorithms for Sampling the Flux Space of Metabolic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.21">10.4230/LIPIcs.SoCG.2021.21</a>
</li>
<li>
<span class="authors">Erin Wolf Chambers, Elizabeth Munch, and Tim Ophelders</span>
<span class="title">A Family of Metrics from the Truncated Smoothing of Reeb Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.22">10.4230/LIPIcs.SoCG.2021.22</a>
</li>
<li>
<span class="authors">Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, and Salman Parsa</span>
<span class="title">Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.23">10.4230/LIPIcs.SoCG.2021.23</a>
</li>
<li>
<span class="authors">Timothy M. Chan</span>
<span class="title">Faster Algorithms for Largest Empty Rectangles and Boxes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.24">10.4230/LIPIcs.SoCG.2021.24</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Qizheng He</span>
<span class="title">More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.25">10.4230/LIPIcs.SoCG.2021.25</a>
</li>
<li>
<span class="authors">Connor Colombe and Kyle Fox</span>
<span class="title">Approximating the (Continuous) Fréchet Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.26">10.4230/LIPIcs.SoCG.2021.26</a>
</li>
<li>
<span class="authors">René Corbet, Michael Kerber, Michael Lesnick, and Georg Osang</span>
<span class="title">Computing the Multicover Bifiltration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.27">10.4230/LIPIcs.SoCG.2021.27</a>
</li>
<li>
<span class="authors">Mónika Csikós and Nabil H. Mustafa</span>
<span class="title">Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.28">10.4230/LIPIcs.SoCG.2021.28</a>
</li>
<li>
<span class="authors">James Davies, Tomasz Krawczyk, Rose McCarty, and Bartosz Walczak</span>
<span class="title">Colouring Polygon Visibility Graphs and Their Generalizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.29">10.4230/LIPIcs.SoCG.2021.29</a>
</li>
<li>
<span class="authors">Tamal K. Dey and Tao Hou</span>
<span class="title">Computing Zigzag Persistence on Graphs in Near-Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.30">10.4230/LIPIcs.SoCG.2021.30</a>
</li>
<li>
<span class="authors">Matthijs Ebbens, Hugo Parlier, and Gert Vegter</span>
<span class="title">Minimal Delaunay Triangulations of Hyperbolic Surfaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.31">10.4230/LIPIcs.SoCG.2021.31</a>
</li>
<li>
<span class="authors">Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, and Mathijs Wintraecken</span>
<span class="title">The Density Fingerprint of a Periodic Point Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.32">10.4230/LIPIcs.SoCG.2021.32</a>
</li>
<li>
<span class="authors">David Eppstein and Hadi Khodabandeh</span>
<span class="title">On the Edge Crossings of the Greedy Spanner</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.33">10.4230/LIPIcs.SoCG.2021.33</a>
</li>
<li>
<span class="authors">Esther Ezra and Micha Sharir</span>
<span class="title">On Ray Shooting for Triangles in 3-Space and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.34">10.4230/LIPIcs.SoCG.2021.34</a>
</li>
<li>
<span class="authors">Esther Ezra, Orit E. Raz, Micha Sharir, and Joshua Zahl</span>
<span class="title">On Rich Lenses in Planar Arrangements of Circles and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.35">10.4230/LIPIcs.SoCG.2021.35</a>
</li>
<li>
<span class="authors">Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, and Christian Scheffer</span>
<span class="title">Packing Squares into a Disk with Optimal Worst-Case Density</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.36">10.4230/LIPIcs.SoCG.2021.36</a>
</li>
<li>
<span class="authors">Jacob Fox, János Pach, and Andrew Suk</span>
<span class="title">Sunflowers in Set Systems of Bounded Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.37">10.4230/LIPIcs.SoCG.2021.37</a>
</li>
<li>
<span class="authors">Radoslav Fulek, Michael J. Pelsmajer, and Marcus Schaefer</span>
<span class="title">Strong Hanani-Tutte for the Torus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.38">10.4230/LIPIcs.SoCG.2021.38</a>
</li>
<li>
<span class="authors">Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, and Andreas Wiese</span>
<span class="title">Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.39">10.4230/LIPIcs.SoCG.2021.39</a>
</li>
<li>
<span class="authors">Xavier Goaoc, Andreas F. Holmsen, and Zuzana Patáková</span>
<span class="title">A Stepping-Up Lemma for Topological Set Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.40">10.4230/LIPIcs.SoCG.2021.40</a>
</li>
<li>
<span class="authors">Dan Halperin, Micha Sharir, and Itay Yehuda</span>
<span class="title">Throwing a Sofa Through the Window</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.41">10.4230/LIPIcs.SoCG.2021.41</a>
</li>
<li>
<span class="authors">Sariel Har-Peled and Mitchell Jones</span>
<span class="title">Stabbing Convex Bodies with Lines and Flats</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.42">10.4230/LIPIcs.SoCG.2021.42</a>
</li>
<li>
<span class="authors">Sariel Har-Peled, Manor Mendel, and Dániel Oláh</span>
<span class="title">Reliable Spanners for Metric Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.43">10.4230/LIPIcs.SoCG.2021.43</a>
</li>
<li>
<span class="authors">Simon B. Hengeveld and Tillmann Miltzow</span>
<span class="title">A Practical Algorithm with Performance Guarantees for the Art Gallery Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.44">10.4230/LIPIcs.SoCG.2021.44</a>
</li>
<li>
<span class="authors">Ziyue Huang and Ke Yi</span>
<span class="title">Approximate Range Counting Under Differential Privacy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.45">10.4230/LIPIcs.SoCG.2021.45</a>
</li>
<li>
<span class="authors">Adam Karczmarz, Jakub Pawlewicz, and Piotr Sankowski</span>
<span class="title">Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.46">10.4230/LIPIcs.SoCG.2021.46</a>
</li>
<li>
<span class="authors">Chaya Keller and Micha A. Perles</span>
<span class="title">No Krasnoselskii Number for General Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.47">10.4230/LIPIcs.SoCG.2021.47</a>
</li>
<li>
<span class="authors">Arindam Khan, Arnab Maiti, Amatya Sharma, and Andreas Wiese</span>
<span class="title">On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.48">10.4230/LIPIcs.SoCG.2021.48</a>
</li>
<li>
<span class="authors">Marc Khoury and Jonathan Richard Shewchuk</span>
<span class="title">Restricted Constrained Delaunay Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.49">10.4230/LIPIcs.SoCG.2021.49</a>
</li>
<li>
<span class="authors">Deepanshu Kush, Aleksandar Nikolov, and Haohua Tang</span>
<span class="title">Near Neighbor Search via Efficient Average Distortion Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.50">10.4230/LIPIcs.SoCG.2021.50</a>
</li>
<li>
<span class="authors">Aditi Laddha and Santosh S. Vempala</span>
<span class="title">Convergence of Gibbs Sampling: Coordinate Hit-And-Run Mixes Fast</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.51">10.4230/LIPIcs.SoCG.2021.51</a>
</li>
<li>
<span class="authors">Goran Malić and Ileana Streinu</span>
<span class="title">Combinatorial Resultants in the Algebraic Rigidity Matroid</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.52">10.4230/LIPIcs.SoCG.2021.52</a>
</li>
<li>
<span class="authors">Clément Maria</span>
<span class="title">Parameterized Complexity of Quantum Knot Invariants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.53">10.4230/LIPIcs.SoCG.2021.53</a>
</li>
<li>
<span class="authors">Arturo Merino and Torsten Mütze</span>
<span class="title">Efficient Generation of Rectangulations via Permutation Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.54">10.4230/LIPIcs.SoCG.2021.54</a>
</li>
<li>
<span class="authors">Tim Ophelders, Ignaz Rutter, Bettina Speckmann, and Kevin Verbeek</span>
<span class="title">Polygon-Universal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.55">10.4230/LIPIcs.SoCG.2021.55</a>
</li>
<li>
<span class="authors">Micha Sharir and Noam Solomon</span>
<span class="title">On Rich Points and Incidences with Restricted Sets of Lines in 3-Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.56">10.4230/LIPIcs.SoCG.2021.56</a>
</li>
<li>
<span class="authors">Donald R. Sheehy and Siddharth Sheth</span>
<span class="title">Sketching Persistence Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.57">10.4230/LIPIcs.SoCG.2021.57</a>
</li>
<li>
<span class="authors">Donald R. Sheehy</span>
<span class="title">A Sparse Delaunay Filtration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.58">10.4230/LIPIcs.SoCG.2021.58</a>
</li>
<li>
<span class="authors">Haitao Wang</span>
<span class="title">An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.59">10.4230/LIPIcs.SoCG.2021.59</a>
</li>
<li>
<span class="authors">Yiqiu Wang, Shangdi Yu, Yan Gu, and Julian Shun</span>
<span class="title">A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.60">10.4230/LIPIcs.SoCG.2021.60</a>
</li>
<li>
<span class="authors">Fred Anderson, Anirban Ghosh, Matthew Graham, Lucas Mougeot, and David Wisnosky</span>
<span class="title">An Interactive Tool for Experimenting with Bounded-Degree Plane Geometric Spanners (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.61">10.4230/LIPIcs.SoCG.2021.61</a>
</li>
<li>
<span class="authors">Aaron T. Becker, Sándor P. Fekete, Matthias Konitzny, Sebastian Morr, and Arne Schmidt</span>
<span class="title">Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.62">10.4230/LIPIcs.SoCG.2021.62</a>
</li>
<li>
<span class="authors">Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, and Luc Libralesso</span>
<span class="title">Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.63">10.4230/LIPIcs.SoCG.2021.63</a>
</li>
<li>
<span class="authors">Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, and Da Wei Zheng</span>
<span class="title">Coordinated Motion Planning Through Randomized k-Opt (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.64">10.4230/LIPIcs.SoCG.2021.64</a>
</li>
<li>
<span class="authors">Hyeyun Yang and Antoine Vigneron</span>
<span class="title">A Simulated Annealing Approach to Coordinated Motion Planning (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2021.65">10.4230/LIPIcs.SoCG.2021.65</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing