Computational Geometry Column 39

@article{ORourke2000ComputationalGC,
  title={Computational Geometry Column 39},
  author={J. O'Rourke},
  journal={ArXiv},
  year={2000},
  volume={cs.CG/0007042}
}
  • J. O'Rourke
  • Published 2000
  • Mathematics, Computer Science
  • ArXiv
  • The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane. 
    1 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    On reconfiguring tree linkages: Trees can lock
    • 19
    • PDF

    References

    SHOWING 1-10 OF 14 REFERENCES
    Polygonal chains cannot lock in 4d
    • 44
    • PDF
    Straightening polygonal arcs and convexifying polygonal cycles
    • 173
    • PDF
    Locked and unlocked polygonal chains in 3D
    • 54
    • PDF
    On reconfiguring tree linkages: Trees can lock
    • 19
    • PDF
    Convexifying star-shaped polygons
    • 21
    Reconfiguring closed polygonal chains in Euclideand-space
    • 73
    • PDF
    A combinatorial approach to planar non-colliding robot arm motion planning
    • I. Streinu
    • Mathematics, Computer Science
    • Proceedings 41st Annual Symposium on Foundations of Computer Science
    • 2000
    • 175
    • PDF
    Problems in Low-Dimensional Topology
    • 385
    • PDF
    Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
    • 221
    • PDF