default search action
37th SoCG 2021: Buffalo, NY, USA (Virtual Conference)
- Kevin Buchin
, Éric Colin de Verdière:
37th International Symposium on Computational Geometry, SoCG 2021, June 7-11, 2021, Buffalo, NY, USA (Virtual Conference). LIPIcs 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-184-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Robert Ghrist:
On Laplacians (Invited Talk). 1:1-1:1 - Virginia Vassilevska Williams:
3SUM and Related Problems in Fine-Grained Complexity (Invited Talk). 2:1-2:2 - Anders Aamand, Mikkel Abrahamsen
Classifying Convex Bodies by Their Contact and Intersection Graphs. 3:1-3:16 - Ahmed Abdelkader, David M. Mount:
Approximate Nearest-Neighbor Search for Line Segments. 4:1-4:15 - Mikkel Abrahamsen
Chasing Puppies: Mobile Beacon Routing on Closed Curves. 5:1-5:19 - Mikkel Abrahamsen
Online Packing to Minimize Area or Perimeter. 6:1-6:15 - Ranendu Adhikary, Kaustav Bose
Complexity of Maximum Cut on Interval Graphs. 7:1-7:11 - Peyman Afshani, Pingan Cheng
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. 8:1-8:15 - Henk Alkema, Mark de Berg:
Rectilinear Steiner Trees in Narrow Strips. 9:1-9:16 - Hugo A. Akitaya
Characterizing Universal Reconfigurability of Modular Pivoting Robots. 10:1-10:20 - Elena Arseneva, Linda Kleist
Adjacency Graphs of Polyhedral Surfaces. 11:1-11:17 - Stav Ashur, Sariel Har-Peled
On Undecided LP, Clustering and Active Learning. 12:1-12:15 - Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev:
Two-Sided Kirszbraun Theorem. 13:1-13:14 - Imre Bárány, Attila Pór, Pavel Valtr:
Orientation Preserving Maps of the Square Grid. 14:1-14:12 - Sujoy Bhore, Csaba D. Tóth:
Light Euclidean Steiner Spanners in the Plane. 15:1-15:17 - Ranita Biswas
Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory. 16:1-16:15 - Jean-Daniel Boissonnat, Siargey Kachanovich, Mathijs Wintraecken
Tracing Isomanifolds in ℝ^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations. 17:1-17:16 - Karl Bringmann, André Nusser:
Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation. 18:1-18:17 - Denys Bulavka, Afshin Goodarzi, Martin Tancer
Optimal Bounds for the Colorful Fractional Helly Theorem. 19:1-19:14 - Hadrien Cambazard, Nicolas Catusse:
An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem. 20:1-20:13 - Apostolos Chalkis, Vissarion Fisikopoulos, Elias P. Tsigaridas, Haris Zafeiropoulos
Geometric Algorithms for Sampling the Flux Space of Metabolic Networks. 21:1-21:16 - Erin Wolf Chambers
A Family of Metrics from the Truncated Smoothing of Reeb Graphs. 22:1-22:17 - Erin Wolf Chambers
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. 23:1-23:16 - Timothy M. Chan:
Faster Algorithms for Largest Empty Rectangles and Boxes. 24:1-24:15 - Timothy M. Chan, Qizheng He:
More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time. 25:1-25:14 - Connor Colombe, Kyle Fox:
Approximating the (Continuous) Fréchet Distance. 26:1-26:14 - René Corbet, Michael Kerber, Michael Lesnick, Georg Osang:
Computing the Multicover Bifiltration. 27:1-27:17 - Mónika Csikós
Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications. 28:1-28:17 - James Davies, Tomasz Krawczyk, Rose McCarty
Colouring Polygon Visibility Graphs and Their Generalizations. 29:1-29:16 - Tamal K. Dey, Tao Hou:
Computing Zigzag Persistence on Graphs in Near-Linear Time. 30:1-30:15 - Matthijs Ebbens
Minimal Delaunay Triangulations of Hyperbolic Surfaces. 31:1-31:16 - Herbert Edelsbrunner, Teresa Heiss
The Density Fingerprint of a Periodic Point Set. 32:1-32:16 - David Eppstein, Hadi Khodabandeh:
On the Edge Crossings of the Greedy Spanner. 33:1-33:17 - Esther Ezra, Micha Sharir:
On Ray Shooting for Triangles in 3-Space and Related Problems. 34:1-34:15 - Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
On Rich Lenses in Planar Arrangements of Circles and Related Problems. 35:1-35:15 - Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist
Packing Squares into a Disk with Optimal Worst-Case Density. 36:1-36:16 - Jacob Fox, János Pach, Andrew Suk:
Sunflowers in Set Systems of Bounded Dimension. 37:1-37:13 - Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Strong Hanani-Tutte for the Torus. 38:1-38:15 - Waldo Gálvez
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. 39:1-39:17 - Xavier Goaoc, Andreas F. Holmsen, Zuzana Patáková
A Stepping-Up Lemma for Topological Set Systems. 40:1-40:17 - Dan Halperin, Micha Sharir, Itay Yehuda:
Throwing a Sofa Through the Window. 41:1-41:16 - Sariel Har-Peled
Stabbing Convex Bodies with Lines and Flats. 42:1-42:12 - Sariel Har-Peled
Reliable Spanners for Metric Spaces. 43:1-43:13 - Simon B. Hengeveld, Tillmann Miltzow:
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem. 44:1-44:16 - Ziyue Huang, Ke Yi:
Approximate Range Counting Under Differential Privacy. 45:1-45:14 - Adam Karczmarz
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. 46:1-46:15 - Chaya Keller
No Krasnoselskii Number for General Sets. 47:1-47:11 - Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem. 48:1-48:17 - Marc Khoury, Jonathan Richard Shewchuk:
Restricted Constrained Delaunay Triangulations. 49:1-49:16 - Deepanshu Kush, Aleksandar Nikolov, Haohua Tang:
Near Neighbor Search via Efficient Average Distortion Embeddings. 50:1-50:14 - Aditi Laddha, Santosh S. Vempala:
Convergence of Gibbs Sampling: Coordinate Hit-And-Run Mixes Fast. 51:1-51:12 - Goran Malic, Ileana Streinu:
Combinatorial Resultants in the Algebraic Rigidity Matroid. 52:1-52:16 - Clément Maria:
Parameterized Complexity of Quantum Knot Invariants. 53:1-53:17 - Arturo Merino
Efficient Generation of Rectangulations via Permutation Languages. 54:1-54:18 - Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek
Polygon-Universal Graphs. 55:1-55:15 - Micha Sharir, Noam Solomon:
On Rich Points and Incidences with Restricted Sets of Lines in 3-Space. 56:1-56:14 - Donald R. Sheehy, Siddharth S. Sheth:
Sketching Persistence Diagrams. 57:1-57:15 - Donald R. Sheehy:
A Sparse Delaunay Filtration. 58:1-58:16 - Haitao Wang:
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. 59:1-59:15 - Yiqiu Wang, Shangdi Yu
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. 60:1-60:16 - Frederick Anderson, Anirban Ghosh
An Interactive Tool for Experimenting with Bounded-Degree Plane Geometric Spanners (Media Exposition). 61:1-61:4 - Aaron T. Becker, Sándor P. Fekete, Matthias Konitzny, Sebastian Morr, Arne Schmidt:
Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition). 62:1-62:4 - Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). 63:1-63:9 - Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng
Coordinated Motion Planning Through Randomized k-Opt (CG Challenge). 64:1-64:8 - Hyeyun Yang, Antoine Vigneron:
A Simulated Annealing Approach to Coordinated Motion Planning (CG Challenge). 65:1-65:9
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 00:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: