ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computational Geometry
Volume 39, Issue 1, January 2008, Pages 30-42
Special Issue on the Canadian Conference on Computational Geometry - CCCG 2004
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (441 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comgeo.2007.05.009    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Edge-unfolding nested polyhedral bandsstar, open

Greg Aloupisa, Corresponding Author Contact Information, 1, E-mail The Corresponding Author, Erik D. Demaineb, 2, E-mail The Corresponding Author, Stefan Langermanc, 3, E-mail The Corresponding Author, Pat Morind, 1, E-mail The Corresponding Author, Joseph O'Rourkee, 4, E-mail The Corresponding Author, Ileana Streinue, 5, E-mail The Corresponding Author and Godfried Toussainta, 1, E-mail The Corresponding Author

aSchool of Computer Science, McGill University, Canada bMIT Computer Science and Artificial Intelligence Laboratory, USA cDépartement d'Informatique, Université Libre de Bruxelles, Belgium dSchool of Computer Science, Carleton University, Canada eDepartment of Computer Science, Smith College, USA

Received 7 January 2005; 
revised 10 November 2006; 
accepted 7 May 2007. 
Communicated by P. Bose and T. Fevens. 
Available online 3 July 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

A band is the intersection of the surface of a convex polyhedron with the space between two parallel planes, as long as this space does not contain any vertices of the polyhedron. The intersection of the planes and the polyhedron produces two convex polygons. If one of these polygons contains the other in the projection orthogonal to the parallel planes, then the band is nested. We prove that all nested bands can be unfolded, by cutting along exactly one edge and folding continuously to place all faces of the band into a plane, without intersection.

Keywords: Polyhedra; Folding; Slice curves


Computational Geometry
Volume 39, Issue 1, January 2008, Pages 30-42
Special Issue on the Canadian Conference on Computational Geometry - CCCG 2004
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.