Vertex-Unfoldings of Simplicial Polyhedra

Details Vertex-Unfoldings of Simplicial Polyhedra Vertex-Unfoldings of Simplicial Polyhedra

2001-07-18

arxiv.org/abs/cs/0107023v1

Discrete Geometry: In honor of W. Kuperberg's 60th birthday, Pure and Appl. Math. 253, Marcel Dekker, pp. 215-228, 2003

Computer Science

Computational Geometry

10 pages; 7 figures; 8 references

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Vertex-Unfoldings of Simplicial Polyhedra 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 Polyhedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertex-Unfoldings of Simplicial Polyhedra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581275