Computer Science – Computational Geometry
Scientific paper
2001-10-27
Computer Science
Computational Geometry
12 pages, 7 figures, 10 references. Significant improvement of arXive cs.CG/0107023
Scientific paper
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.
Demaine Erik D.
Eppstein David
Erickson Jeff
Hart George W.
O'Rourke Joseph
No associations
LandOfFree
Vertex-Unfoldings of Simplicial Manifolds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Vertex-Unfoldings of Simplicial Manifolds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertex-Unfoldings of Simplicial Manifolds will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-308173