1 problem

Let $P$ be a convex polyhedron. A steepest edge tree is a spanning tree of the edge graph of $P$ obtained by the steepest-edge algorithm, and a tree generates a simple unfolding wh…