2 papers
cs.CG2025
Stabbing Faces By a Convex Curve
David Eppstein
We prove that, for every plane graph and every smooth convex curve not on a single line, there exists a straight-line drawing of for which every face is crossed by .
cs.CG2025
Decremental Greedy Polygons and Polyhedra Without Sharp Angles
David Eppstein
We show that the max-min-angle polygon in a planar point set can be found in time and a max-min-solid-angle convex polyhedron in a three-dimensional point set can be f…