4 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.CG2009★ 1 cited
Continuous Blooming of Convex Polyhedra
Erik D. Demaine, Martin L. Demaine, Vi Hart +3
We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can b…
cs.CG1999★ 4 cited
Polygonal Chains Cannot Lock in 4D
Roxana Cocan, Joseph O'Rourke
We prove that, in all dimensions d>=4, every simple open polygonal chain and every tree may be straightened, and every simple closed polygonal chain may be convexified. These recon…
cs.CG1998★ 1 cited
Computational Geometry Column 34
Pankaj K. Agarwal, Joseph O'Rourke
Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed.