Edge-unfolding nested polyhedral bands

Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried Toussaint

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)30-42
Number of pages13
JournalComputational Geometry: Theory and Applications
Volume39
Issue number1
DOIs
Publication statusPublished - Jan 1 2008

    Fingerprint

Keywords

  • Folding
  • Polyhedra
  • Slice curves

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this

Aloupis, G., Demaine, E. D., Langerman, S., Morin, P., O'Rourke, J., Streinu, I., & Toussaint, G. (2008). Edge-unfolding nested polyhedral bands. Computational Geometry: Theory and Applications, 39(1), 30-42. https://doi.org/10.1016/j.comgeo.2007.05.009