Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Mathematics

Smith College

2010

Shortest paths

Articles 1 - 1 of 1

Full-Text Articles in Physical Sciences and Mathematics

Star Unfolding Convex Polyhedra Via Quasigeodesic Loops, Jin-Ichi Itoh, Joseph O'Rourke, Costin Vîlcu Jul 2010

Star Unfolding Convex Polyhedra Via Quasigeodesic Loops, Jin-Ichi Itoh, Joseph O'Rourke, Costin Vîlcu

Computer Science: Faculty Publications

We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ℘ to a simple (nonoverlapping) planar polygon: cut along one shortest path from each vertex of ℘ toQ, and cut all but one segment of Q.