4 search results - page 1 / 1 » Grid Vertex-Unfolding Orthogonal Polyhedra |
DCG
2008
13 years 11 months ago
2008
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...
JCDCG
2004
Springer
14 years 4 months ago
2004
Springer
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 ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). ...
VISUALIZATION
1997
IEEE
14 years 3 months ago
1997
IEEE
Different techniques have been proposed for rendering volumetric scalar data sets. Usually these approaches are focusing on orthogonal cartesian grids, but in the last years resea...