Minimal-Length Enclosing Polygon

Recall that we aim to extend to convex polyhedra the planar model of a spiraling slitslittree tree developed in Chap. 12 and based on convex hulls. In the plane, the convex hullconvex hull of a finite set S is equivalently defined as (i) the smallest convex setconvex set containing S or (ii) the minimal-length enclosing polygonpolygonminimal length enclosing of S.