26 citations · 41 across the 10 of their papers we have counts for
4 papers · 1 filter
Vertex-Unfoldings of Simplicial Manifolds
Erik D. Demaine, David Eppstein, Jeff Erickson +2
We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time. The manifol…
Nonorthogonal Polyhedra Built from Rectangles
Melody Donoso, Joseph O'Rourke
We prove that any polyhedron of genus zero or genus one built out of rectangular faces must be an orthogonal polyhedron, but that there are nonorthogonal polyhedra of genus seven a…
Enumerating Foldings and Unfoldings between Polygons and Polytopes
Erik D. Demaine, Martin L. Demaine, Anna Lubiw +1
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous quest…
Computational Geometry Column 41
Joseph O'Rourke
The recent result that n congruent balls in R^d have at most 4 distinct geometric permutations is described.