3 papers
cs.CG2005
Grid Vertex-Unfolding Orthogonal Polyhedra
Mirela Damian, Robin Flatland, Joseph O'Rourke
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows addit…
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.CG2004
Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions
Mirela Damian, Joseph O'Rourke
We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscrib…