Paper by Erik D. Demaine

Reference:

Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, and Joseph O'Rourke, “Vertex-Unfoldings of Simplicial Manifolds”, Technical Report 072, Smith College, October 2001.

BibTeX

@TechReport{VertexUnfolding2,
  AUTHOR        = {Erik D. Demaine and David Eppstein and Jeff Erickson and
                   George W. Hart and Joseph O'Rourke},
  TITLE         = {Vertex-Unfoldings of Simplicial Manifolds},
  NUMBER        = {072},
  INSTITUTION   = {Smith College},
  MONTH         = {October},
  YEAR          = 2001,

  LENGTH        = {12 pages},
  COMMENTS      = {This paper is also available as
                   <A HREF="http://arXiv.org/abs/cs.CG/0110054">
                   arXiv:cs.CG/0110054</A> of the
                   <A HREF="http://arXiv.org/archive/cs/intro.html">
                   Computing Research Repository (CoRR)</A>, and from <A HREF="https://doi.org/10.1145/513400.513429">ACM</A>.},
  PAPERS        = {VertexUnfolding_SoCG2002; VertexUnfolding},
}

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.

Comments:

This paper is also available as arXiv:cs.CG/0110054 of the Computing Research Repository (CoRR), and from ACM.

Length:

The paper is 12 pages.

Availability:

The paper is available in PostScript (429k) and gzipped PostScript (112k).

See information on file formats.

[Google Scholar search]

Related papers:

VertexUnfolding_SoCG2002 (Vertex-Unfolding of Simplicial Manifolds)

VertexUnfolding (Vertex-Unfoldings of Simplicial Polyhedra)