SoCG A*

67 papers

YearTitle / Authors
202137th International Symposium on Computational Geometry, SoCG 2021, Buffalo, NY, USA (Virtual Conference), June 7-11, 2021
Kevin Buchin, Éric Colin de Verdière
20213SUM and Related Problems in Fine-Grained Complexity (Invited Talk).
Virginia Vassilevska Williams
2021A Family of Metrics from the Truncated Smoothing of Reeb Graphs.
Erin Wolf Chambers, Elizabeth Munch, Tim Ophelders
2021A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem.
Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun
2021A Practical Algorithm with Performance Guarantees for the Art Gallery Problem.
Simon B. Hengeveld, Tillmann Miltzow
2021A Simulated Annealing Approach to Coordinated Motion Planning (CG Challenge).
Hyeyun Yang, Antoine Vigneron
2021A Sparse Delaunay Filtration.
Donald R. Sheehy
2021A Stepping-Up Lemma for Topological Set Systems.
Xavier Goaoc, Andreas F. Holmsen, Zuzana Patáková
2021Adjacency Graphs of Polyhedral Surfaces.
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
2021Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries.
Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa
2021An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem.
Hadrien Cambazard, Nicolas Catusse
2021An Interactive Tool for Experimenting with Bounded-Degree Plane Geometric Spanners (Media Exposition).
Frederick Anderson, Anirban Ghosh, Matthew Graham, Lucas Mougeot, David Wisnosky
2021An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons.
Haitao Wang
2021Approximate Nearest-Neighbor Search for Line Segments.
Ahmed Abdelkader, David M. Mount
2021Approximate Range Counting Under Differential Privacy.
Ziyue Huang, Ke Yi
2021Approximating the (Continuous) Fréchet Distance.
Connor Colombe, Kyle Fox
2021Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition).
Aaron T. Becker, Sándor P. Fekete, Matthias Konitzny, Sebastian Morr, Arne Schmidt
2021Characterizing Universal Reconfigurability of Modular Pivoting Robots.
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
2021Chasing Puppies: Mobile Beacon Routing on Closed Curves.
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
2021Classifying Convex Bodies by Their Contact and Intersection Graphs.
Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen
2021Colouring Polygon Visibility Graphs and Their Generalizations.
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
2021Combinatorial Resultants in the Algebraic Rigidity Matroid.
Goran Malic, Ileana Streinu
2021Complexity of Maximum Cut on Interval Graphs.
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy
2021Computing Zigzag Persistence on Graphs in Near-Linear Time.
Tamal K. Dey, Tao Hou
2021Computing the Multicover Bifiltration.
René Corbet, Michael Kerber, Michael Lesnick, Georg Osang
2021Convergence of Gibbs Sampling: Coordinate Hit-And-Run Mixes Fast.
Aditi Laddha, Santosh S. Vempala
2021Coordinated Motion Planning Through Randomized k-Opt (CG Challenge).
Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng
2021Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory.
Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian
2021Efficient Generation of Rectangulations via Permutation Languages.
Arturo Merino, Torsten Mütze
2021Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications.
Mónika Csikós, Nabil H. Mustafa
2021Faster Algorithms for Largest Empty Rectangles and Boxes.
Timothy M. Chan
2021Front Matter, Table of Contents, Preface, Conference Organization.
2021Geometric Algorithms for Sampling the Flux Space of Metabolic Networks.
Apostolos Chalkis, Vissarion Fisikopoulos, Elias P. Tsigaridas, Haris Zafeiropoulos
2021Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More.
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
2021Light Euclidean Steiner Spanners in the Plane.
Sujoy Bhore, Csaba D. Tóth
2021Lower Bounds for Semialgebraic Range Searching and Stabbing Problems.
Peyman Afshani, Pingan Cheng
2021Minimal Delaunay Triangulations of Hyperbolic Surfaces.
Matthijs Ebbens, Hugo Parlier, Gert Vegter
2021More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time.
Timothy M. Chan, Qizheng He
2021Near Neighbor Search via Efficient Average Distortion Embeddings.
Deepanshu Kush, Aleksandar Nikolov, Haohua Tang
2021No Krasnoselskii Number for General Sets.
Chaya Keller, Micha A. Perles
2021On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem.
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
2021On Laplacians (Invited Talk).
Robert Ghrist
2021On Ray Shooting for Triangles in 3-Space and Related Problems.
Esther Ezra, Micha Sharir
2021On Rich Lenses in Planar Arrangements of Circles and Related Problems.
Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl
2021On Rich Points and Incidences with Restricted Sets of Lines in 3-Space.
Micha Sharir, Noam Solomon
2021On Undecided LP, Clustering and Active Learning.
Stav Ashur, Sariel Har-Peled
2021On the Edge Crossings of the Greedy Spanner.
David Eppstein, Hadi Khodabandeh
2021Online Packing to Minimize Area or Perimeter.
Mikkel Abrahamsen, Lorenzo Beretta
2021Optimal Bounds for the Colorful Fractional Helly Theorem.
Denys Bulavka, Afshin Goodarzi, Martin Tancer
2021Orientation Preserving Maps of the Square Grid.
Imre Bárány, Attila Pór, Pavel Valtr
2021Packing Squares into a Disk with Optimal Worst-Case Density.
Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer
2021Parameterized Complexity of Quantum Knot Invariants.
Clément Maria
2021Polygon-Universal Graphs.
Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek
2021Rectilinear Steiner Trees in Narrow Strips.
Henk Alkema, Mark de Berg
2021Reliable Spanners for Metric Spaces.
Sariel Har-Peled, Manor Mendel, Dániel Oláh
2021Restricted Constrained Delaunay Triangulations.
Marc Khoury, Jonathan Richard Shewchuk
2021Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge).
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
2021Sketching Persistence Diagrams.
Donald R. Sheehy, Siddharth S. Sheth
2021Stabbing Convex Bodies with Lines and Flats.
Sariel Har-Peled, Mitchell Jones
2021Strong Hanani-Tutte for the Torus.
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
2021Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs.
Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
2021Sunflowers in Set Systems of Bounded Dimension.
Jacob Fox, János Pach, Andrew Suk
2021The Density Fingerprint of a Periodic Point Set.
Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken
2021Throwing a Sofa Through the Window.
Dan Halperin, Micha Sharir, Itay Yehuda
2021Tracing Isomanifolds in ℝ^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.
Jean-Daniel Boissonnat, Siargey Kachanovich, Mathijs Wintraecken
2021Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation.
Karl Bringmann, André Nusser
2021Two-Sided Kirszbraun Theorem.
Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev