Sciweavers

2 search results - page 1 / 1
» Grid Vertex-Unfolding Orthostacks
Sort
View
JCDCG
2004
Springer
13 years 10 months ago
Grid Vertex-Unfolding Orthostacks
An algorithm was presented in [1] for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. It was conjectured that orthostacks could be ...
Erik D. Demaine, John Iacono, Stefan Langerman
DCG
2008
64views more  DCG 2008»
13 years 4 months ago
Grid Vertex-Unfolding Orthogonal Polyhedra
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 addition...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke