**Reference**:- Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, and Godfried Toussaint, “Unfolding Polyhedral Bands”, in
*Proceedings of the 16th Canadian Conference on Computational Geometry (CCCG 2004)*, Montréal, Québec, Canada, August 9–11, 2004, pages 60–63. **Abstract**:-
A
*band*is defined as 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. An*unfolding*of a given band is obtained by cutting along exactly one edge and placing all faces of the band into the plane, without causing intersections. We prove that for a specific type of band there exists an appropriate edge to cut so that the band may be unfolded. **Comments**:- This paper is also available from the electronic proceedings as http://www.cs.concordia.ca/cccg/papers/45.pdf.
**Length**:- The paper is 4 pages.
**Availability**:- The paper is available in PostScript (242k) and gzipped PostScript (79k).
- See information on file formats.
- [Google Scholar search]
**Related papers**:- BandUnfolding_CGTA (Edge-Unfolding Nested Polyhedral Bands)

See also other papers by Erik Demaine.

Last updated September 13, 2019 by Erik Demaine.