Movement problems for 2-dimensional linkages
SIAM Journal on Computing
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
On the development of the intersection of a plane with a polytope
Computational Geometry: Theory and Applications - Special issue on Discrete and computational geometry
Proofs from THE BOOK
On the development of the intersection of a plane with a polytope
Computational Geometry: Theory and Applications - Special issue on Discrete and computational geometry
Edge-unfolding nested polyhedral bands
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Cauchy's "Arm Lemma" may be generalized to permit nonconvex "openings" of a planar convex chain. Although this (and further extensions) were known, no proofs have appeared in the literature. Here two induction proofs are offered. The extension can then be employed to establish that a curve that is the intersection of a plane with a convex polyhedron "develops" without self-intersection.