26 citations · 72 across the 33 of their papers we have counts for
6 papers · 2 filters
Locked and Unlocked Polygonal Chains in 3D
T. Biedl, E. Demaine, M. Demaine +8
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a stra…
On Reconfiguring Tree Linkages: Trees can Lock
Therese Biedl, Erik Demaine, Martin Demaine +7
It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfig…
Computational Geometry Column 36
Joseph O'Rourke
Two results in "computational origami" are illustrated.
Computational Geometry Column 37
Erik D. Demaine, Joseph O'Rourke
Open problems from the 15th Annual ACM Symposium on Computational Geometry.
Computational Geometry Column 35
Joseph O'Rourke
The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is described.
Zero-Parity Stabbing Information
Joseph O'Rourke, Irena Pashchenko
Everett et al. introduced several varieties of stabbing information for the lines determined by pairs of vertices of a simple polygon P, and established their relationships to vert…