Computer Science – Computational Geometry
Scientific paper
2008-12-12
Computer Science
Computational Geometry
18 pages, 10 figures
Scientific paper
We extend the notion of a star unfolding to be based on a simple
quasigeodesic loop Q rather than on a point. This gives a new general method to
unfold the surface of any convex polyhedron P to a simple, planar polygon:
shortest paths from all vertices of P to Q are cut, and all but one segment of
Q is cut.
Itoh Jin-ichi
O'Rourke Joseph
Vîlcu Costin
No associations
LandOfFree
Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings 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 Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-609152