9 search results - page 2 / 2 » A Class of Convex Polyhedra with Few Edge Unfoldings |
CORR
2011
Springer
14 years 3 months ago
2011
Springer
It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is establ...
91
Voted
CCCG
2007
15 years 1 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...
EJC
2010
14 years 11 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...
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...