Document Type

Article

Publication Date

7-2010

Publication Title

Discrete & Computational Geometry

Abstract

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.

Keywords

Unfolding, Star unfolding, Convex polyhedra, Quasigeodesics, Quasigeodesic loops, Shortest paths

Volume

44

Issue

1

First Page

35

Last Page

54

DOI

dx.doi.org/10.1007/s00454-009-9223-x

ISSN

1432-0444

Comments

Peer reviewed post-print. Language included at the request of the publisher: The final publication is available at Springer via http://dx.doi.org/10.1007/s00454-009-9223-x.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.