Unfolding Convex Polyhedra via Radially Monotone Cut Trees

@article{ORourke2016UnfoldingCP,
  title={Unfolding Convex Polyhedra via Radially Monotone Cut Trees},
  author={Joseph O'Rourke},
  journal={CoRR},
  year={2016},
  volume={abs/1607.07421}
}
A notion of “radially monotone” cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut is infinitesimally opened by the curvature at the vertices along the path. It is shown that a class of planar… CONTINUE READING