Computer Science – Computational Geometry
Scientific paper
2008-06-14
Computer Science
Computational Geometry
24 pages, 20 figuers, minor grammatical changes
Scientific paper
There exists a surface of a convex polyhedron P and a partition L of P into
geodesic convex polygons such that there are no connected "edge" unfoldings of
P without self-intersections (whose spanning tree is a subset of the edge
skeleton of L).
No associations
LandOfFree
Existence of a polyhedron which does not have a non-overlapping pseudo-edge unfolding 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 Existence of a polyhedron which does not have a non-overlapping pseudo-edge unfolding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Existence of a polyhedron which does not have a non-overlapping pseudo-edge unfolding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-495198