26 citations · 26 across the 4 of their papers we have counts for
24 papers
Grid Vertex-Unfolding Orthogonal Polyhedra
Mirela Damian, Robin Flatland, Joseph O'Rourke
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows addit…
A 2-chain can interlock with a k-chain
Julie Glass, Stefan Langerman, Joseph O'Rourke +2
One of the open problems posed in [3] is: what is the minimal number k such that an open, flexible k-chain can interlock with a flexible 2-chain? In this paper, we establish the as…
Computational Geometry Column 45
Joseph O'Rourke
The algorithm of Edelsbrunner for surface reconstruction by ``wrapping'' a set of points in R^3 is described.
A Note on Objects Built From Bricks without Corners
Mirela Damian, Joseph O'Rourke
We report a small advance on a question raised by Robertson, Schweitzer, and Wagon in [RSW02]. They constructed a genus-13 polyhedron built from bricks without corners, and asked w…
Computational Geometry Column 44
Joseph O'Rourke
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is discussed.
Open Problems from CCCG 2002
Erik D. Demaine, Joseph O'Rourke
A list of the problems presented on August 12, 2002 at the open-problem session of the 14th Canadian Conference on Computational Geometry held in Lethbridge, Alberta, Canada.