15 search results - page 1 / 3 » Ununfoldable Polyhedra with Convex Faces |
CORR
1999
Springer
13 years 4 months ago
1999
Springer
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the ...
EJC
2010
13 years 5 months ago
2010
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restri...
CORR
2011
Springer
12 years 12 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 11 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...