Paper by Erik D. Demaine

Reference:

Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, and Joseph O'Rourke, “Vertex-Unfolding of Simplicial Manifolds”, in Discrete Geometry: In Honor of W. Kuperberg's 60th Birthday, 2003, pages 215–228, Marcer Dekker Inc..

BibTeX

@InCollection{VertexUnfolding_Kuperberg2003,
  AUTHOR        = {Erik D. Demaine and David Eppstein and Jeff Erickson and
                   George W. Hart and Joseph O'Rourke},
  TITLE         = {Vertex-Unfolding of Simplicial Manifolds},
  BOOKTITLE     = {Discrete Geometry: In Honor of W. Kuperberg's 60th Birthday},
  bookurl       = {http://www.crcpress.com/shopping_cart/products/product_detail.asp?sku=DK2123},
  PUBLISHER     = {Marcer Dekker Inc.},
  YEAR          = 2003,
  PAGES         = {215--228},

  replaces      = {VertexUnfolding_SoCG2002},
  papers        = {VertexUnfolding_SoCG2002; VertexUnfolding2},
  length        = {15 pages},
  comments      = {The book is searchable on <A HREF="http://www.amazon.com/gp/product/0824709683/102-1474521-6343351?v=glance&n=283155">Amazon</A>.},
}

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:

The book is searchable on Amazon.

Length:

The paper is 15 pages.

Availability:

The paper is available in PostScript (3037k), gzipped PostScript (1692k), and PDF (166k).

See information on file formats.

[Google Scholar search]

Related papers:

VertexUnfolding_SoCG2002 (Vertex-Unfolding of Simplicial Manifolds)

VertexUnfolding2 (Vertex-Unfoldings of Simplicial Manifolds)