Vertex-Unfoldings of Simplicial Manifolds

Simple item page
dc.creatorDemaine, Erik D.
dc.creatorEppstein, David
dc.creatorErickson, Jeff
dc.creatorHart, George W.
dc.creatorO'Rourke, Joseph
dc.date2001-10-27
dc.date.accessioned2026-07-07T03:17:51Z
dc.date.available2026-07-07T03:17:51Z
dc.descriptionWe 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.
dc.description12 pages, 7 figures, 10 references. Significant improvement of arXive cs.CG/0107023
dc.identifierhttps://arxiv.org/abs/cs/0110054
dc.identifierhttp://arxiv.org/abs/cs/0110054
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30877
dc.subjectComputational Geometry
dc.subjectDiscrete Mathematics
dc.subjectF.2.2; G.2.2
dc.titleVertex-Unfoldings of Simplicial Manifolds
dc.typetext

Files

Collections

arXiv