Showing cs.CGShow all
3 papers · 1 filter
cs.CG2005
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
Justin Colannino, Mirela Damian, Ferran Hurtado +4
The assignment problem takes as input two finite point sets S and T and establishes a correspondence between points in S and points in T, such that each point in S maps to exactly…
cs.CG2002
Small Strictly Convex Quadrilateral Meshes of Point Sets
David Bremner, Ferran Hurtado, Suneeta Ramaswami +1
In this paper, we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we s…
cs.CG2000
Flipturning polygons
Oswin Aichholzer, Carmen Cortes, Erik D. Demaine +7
A flipturn is an operation that transforms a nonconvex simple polygon into another simple polygon, by rotating a concavity 180 degrees around the midpoint of its bounding convex hu…