LIPIcs, Volume 189, SoCG 2021

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