Vertex-Unfoldings of Simplicial Manifolds
Computational Geometry
2007-05-23 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.cs/0110054,
title = {Vertex-Unfoldings of Simplicial Manifolds},
author = {Erik D. Demaine and David Eppstein and Jeff Erickson and George W. Hart and Joseph O'Rourke},
journal= {arXiv preprint arXiv:cs/0110054},
year = {2007}
}
Comments
12 pages, 7 figures, 10 references. Significant improvement of arXive cs.CG/0107023