Sciweavers

11 search results - page 2 / 3
» Epsilon-Unfolding Orthogonal Polyhedra
Sort
View
DCG
2008
64views more  DCG 2008»
14 years 9 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
69
Voted
FSTTCS
2007
Springer
15 years 1 months ago
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
Therese C. Biedl, Masud Hasan, Alejandro Ló...
CORR
2012
Springer
174views Education» more  CORR 2012»
13 years 5 months ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
83
Voted
CCCG
2003
14 years 11 months ago
Equiprojective Polyhedra
A convex polyhedron P is equiprojective if, for some k, the orthogonal projection (or “shadow”) of P in every direction, except those directions parallel to faces of P, is a k...
Masud Hasan, Anna Lubiw
89
Voted
VMV
2001
126views Visualization» more  VMV 2001»
14 years 11 months ago
Erosion and Dilation on 2-D and 3-D Digital Images: A New Size-Independent Approach
This paper presents a new approach to achieve elementary neighborhood operations on both 2D and 3D binary images by using the Extreme Vertices Model (EVM), a recent orthogonal pol...
Jorge Rodríguez, Dolors Ayala