9 search results - page 1 / 2 » Convex Polyhedra Realizing Given Face Areas |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Given n ≥ 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the ot...
GMP
2008
IEEE
13 years 10 months ago
2008
IEEE
The directional contact range of two convex polyhedra is the range of positions that one of the polyhedron may locate along a given straight line so that the two polyhedra are in c...
VC
1998
13 years 4 months ago
1998
Polyhedron realization is the transformation of a polyhedron into a convex polyhedron with an isomorphic vertex neighborhood graph. We present in this paper a novel algorithm for ...
CCCG
2007
13 years 5 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
JCDCG
2000
Springer
13 years 8 months ago
2000
Springer
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...