TL;DR
This paper resolves a long-standing open problem in computational geometry by proving that polygonal chains in the plane cannot become locked, ensuring they can always be moved to a straight configuration.
Contribution
It provides a definitive proof that polygonal chains in the plane cannot lock, settling a decades-old question in the field.
Findings
Polygonal chains cannot lock in the plane.
The proof resolves a long-standing open problem.
Implications for motion planning in robotics.
Abstract
The resolution of a decades-old open problem is described: polygonal chains cannot lock 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.