Edge-unfolding nested prismatoids
Manuel Radons

TL;DR
This paper proves that all nested prismatoids, a specific class of convex polyhedra formed by two parallel polygons with one contained in the other, can be unfolded into a non-overlapping flat polygon.
Contribution
It establishes the first universal edge-unfolding method for nested prismatoids, expanding understanding of unfolding convex polyhedra.
Findings
Nested prismatoids can be edge-unfolded without overlaps.
The unfolding results in a simple, non-overlapping polygon.
This work extends unfolding techniques to a new class of convex polyhedra.
Abstract
A -Prismatoid is the convex hull of two convex polygons and which lie in parallel planes . Let be the orthogonal projection of onto . A prismatoid is called nested if is properly contained in , or vice versa. We show that every nested prismatoid has an edge-unfolding to a non-overlapping polygon in the plane.
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
TopicsPoint processes and geometric inequalities · Mathematics and Applications · Computational Geometry and Mesh Generation
