3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.CG2001
Vertex-Unfoldings of Simplicial Manifolds
Erik D. Demaine, David Eppstein, Jeff Erickson +2
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 manifol…
cs.CG2001★ 3 cited
Vertex-Unfoldings of Simplicial Polyhedra
Erik D. Demaine, David Eppstein, Jeff Erickson +2
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…