SoCG 2021 Accepted Papers
Stabbing Convex Bodies with Lines and Flats
Tracing isomanifolds in $\mathbb{R}^d$ in time polynomial in $d$ using Coxeter-Freudenthal-Kuhn triangulations
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons
On Ray Shooting for Triangles in 3-Space and Related Problems
Approximate Range Counting under Differential Privacy
Packing Squares into a Disk with Optimal Worst-Case Density
Complexity of Maximum Cut on Interval Graphs
Optimal bounds for the colorful fractional Helly theorem
On the Edge Crossings of the Greedy Spanner
Sunflowers in set systems of bounded dimension
A family of metrics from the truncated smoothing of Reeb graphs
On rich lenses in planar arrangements of circles and related problems
Throwing a sofa through the window
Combinatorial Resultants in the Algebraic Rigidity Matroid
Efficient generation of rectangulations via permutation languages
Reliable Spanners for Metric Spaces
Convergence of Gibbs Sampling: Coordinate Hit-and-Run Mixes Fast
On Undecided LP and Active Learning Using Proximity Queries
The Density Fingerprint of a Periodic Point Set
Strong Hanani-Tutte for the Torus
No Krasnoselskii Number for General Sets
Chasing Puppies: Mobile Beacon Routing on Closed Curves
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
Classifying Convex Bodies by their Contact and Intersection Graphs
Rectilinear Steiner Trees in Narrow Strips
Online Packing to Minimize Area or Perimeter
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems (Best Paper Award)
Parameterized Complexity of Quantum Knot Invariants
Near Neighbour Search via Efficient Average Distortion Embeddings
Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and their Applications
Light Euclidean Steiner Spanners in the Plane
Sketching Persistence Diagrams
A Sparse Delaunay Filtration
A stepping-up lemma for topological set systems
Computing the multicover bifiltration
An Experimental Study of a New Parallel Batch-Dynamic Closest Pair Data Structure
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More
Restricted Constrained Delaunay Triangulations
On rich points and incidences with restricted sets of lines in 3-space
An integer programming formulation using convex polygons for the convex partition problem
Polygon-Universal Graphs
Counting Cells of Order-k Voronoi Tessellations in R^3 with Morse Theory
Minimal Delaunay triangulations of hyperbolic surfaces
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries
Orientation preserving Maps of the n × n Grid
Faster Algorithms for Largest Empty Rectangles and Boxes
Computing Zigzag Persistence on Graphs in Near-Linear Time
Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation
Approximating the (Continuous) Fréchet Distance
Sublinear average-case shortest paths in weighted unit-disk graphs
Approximate Nearest-Neighbor Search for Line Segments
Adjacency Graphs of Polyhedral Surfaces
More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time
Geometric algorithms for sampling the flux space of metabolic networks
Colouring polygon visibility graphs and their generalizations
Characterizing Universal Reconfigurability of Modular Pivoting Robots
Two-sided Kirszbraun Theorem
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem