Paper by Erik D. Demaine

Reference:

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

BibTeX

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

  LENGTH        = {10 pages},
  COMMENTS      = {This paper is also available as
                   <A HREF="http://arXiv.org/abs/cs.CG/0107023">
                   arXiv:cs.CG/0107023</A> of the
                   <A HREF="http://arXiv.org/archive/cs/intro.html">
                   Computing Research Repository (CoRR)</A>.},
  PAPERS        = {VertexUnfolding2}
}

Abstract:

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have a disconnected interior: the triangles are connected at vertices, but not necessarily joined along edges.

Comments:

This paper is also available as arXiv:cs.CG/0107023 of the Computing Research Repository (CoRR).

Length:

The paper is 10 pages.

Availability:

The paper is available in PostScript (491k) and gzipped PostScript (128k).

See information on file formats.

[Google Scholar search]

Related papers:

VertexUnfolding2 (Vertex-Unfoldings of Simplicial Manifolds)