Ununfoldable polyhedra with convex faces
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Folding and Unfolding in Computational Geometry
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
An Extension of Cauchy's Arm Lemma with Application to Curve Development
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Geometric and computational aspects of molecular reconfiguration
Geometric and computational aspects of molecular reconfiguration
An Extension of Cauchy's Arm Lemma with Application to Curve Development
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Edge-unfolding nested polyhedral bands
Computational Geometry: Theory and Applications
Development of curves on polyhedra via conical existence
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Define a "slice" curve as the intersection of a plane with the surface of a polytope, i.e., a convex polyhedron in three dimensions. We prove that a slice curve develops on a plane without self-intersection. The key tool used is a generalization of Cauchy's arm lemma to permit nonconvex "openings" of a planar convex chain.