Accepted Papers for Computational Geometry: Young Researchers Forum 2021
An exact optimal algorithm for the discrete median line segment problem in the plane?
Package delivery using handoffs among collaborating heterogeneous agents.
The Visibility Center of a Polygon.
Moving Robots One by One is Hard.
Large Perimeter Objects Surrounded by 1.5D Terrains.
Perfect Matchings with Crossings.
Plane Matchings in Simple Drawings of Complete Graphs.
Untangling Almost Outerplanar Drawings.
Algorithms For Max Cut on Unit Interval and Laminar Interval Graphs.
Homotopical decompositions of simplicial and Vietoris-Rips complexes.
Realizing Persistent Homology by Subcomplexes.
Using Generalized Heegaard Splittings in Computational 3-Manifold Topology.
Efficient two-parameter persistence computation via cohomology.
Independent Hyperplanes in Oriented Paving Matroids.
Edge-unfolding nearly flat prismatoids.
A Geometric Approach to Papillae Identification in 3D Meshes.
On the range of two-distance graphs.
Enumerating All Convex Polyhedra Glued from Squares in Polynomial Time.
On the adjacency structures of planar point-set triangulations..
Connecting 3-manifold triangulations with semi-monotonic sequences of bistellar flips.
Triangulations of Exotic 4-Manifolds.