VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS

Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We present an algorithm to unfold any triangulated 2-manifold(in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time. The manifold is cut only along its edges. The resulting layout is connected, but it may have a disconnected interior; the triangles are connected at vertices, but not necessarily joined along edges. We extend our algorithm to establish a similar result for simplicial manifolds of arbitrary dimension.

Original languageEnglish (US)
Title of host publicationDiscrete Geometry
Subtitle of host publicationIn Honor of W. Kuperberg's 60th Birthday
PublisherCRC Press
Pages215-228
Number of pages14
ISBN (Electronic)9780203911211
ISBN (Print)9780824709686
DOIs
StatePublished - Jan 1 2003
Externally publishedYes

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS'. Together they form a unique fingerprint.

Cite this