Efficient Folding Algorithms for Convex Polyhedra

We investigate a folding problem that inquires whether a polygon P can be folded, without overlap or gaps, onto a polyhedron Q for given P and  Q . An efficient algorithm for this problem when Q is a box was recently developed. We extend this idea to a class of convex polyhedra, which includes the f...

Ausführliche Beschreibung