Existence of a polyhedron which does not have a non-overlapping pseudo-edge unfolding
Alexey S Tarasov

TL;DR
This paper demonstrates that certain convex polyhedra cannot be unfolded into a non-overlapping flat shape using only their edges, challenging assumptions about polyhedron unfoldings.
Contribution
It proves the existence of convex polyhedra with partitions that prevent non-overlapping edge unfoldings, a significant insight in geometric folding theory.
Findings
Existence of convex polyhedra without non-overlapping edge unfoldings
Partition of polyhedron surface into geodesic convex polygons
No connected edge unfolding without self-intersection
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStructural Analysis and Optimization · Advanced Materials and Mechanics · Elasticity and Material Modeling
