2000 character limit reached
Existence of a polyhedron which does not have a non-overlapping pseudo-edge unfolding
Published 14 Jun 2008 in cs.CG | (0806.2360v3)
Abstract: 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).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
