15 search results - page 2 / 3 » Ununfoldable Polyhedra with Convex Faces |
DAGSTUHL
2000
13 years 7 months ago
2000
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski's theory of mixed volumes. To compute the similarity measure, a (mix...
FSTTCS
2007
Springer
13 years 9 months ago
2007
Springer
CCCG
2007
13 years 7 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...
ESA
2009
Springer
14 years 10 days ago
2009
Springer
A famous theorem by Cauchy states that a convex polyhedron is determined by its incidence structure and face-polygons alone. In this paper, we prove the same for orthogonal polyhe...
CCCG
2003
13 years 7 months ago
2003
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...