Computational Geometry Column 39
Joseph O'Rourke
cs.CGarXiv:cs/0007042
Abstract
The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane.
Create a lesson
Related papers
A Bicriteria Approximation Scheme for the Minimum Well-Separated Pair Decomposition
Guilherme D. da Fonseca
Tiling 3D by Translates of a Single Polycube is Undecidable
Erik D. Demaine, Stefan Langerman
Deterministic Distance Selection in O(n4/3) Time
Haitao Wang
Simulated Annealing for Antenna Placements
Mikkel Abrahamsen, Jacobus Conradi, Asbjørn Lind
Exposition of an approximation algorithm for mixed volumes of a constant number of convex bodies
Hariharan Narayanan
Tight Bounds for Tusnády's Problem in the Plane
Zhewei Wei