Optimality of the Plans

The algorithm finds the shortest plan to orient the part up to symmetry. We can prove this by induction by showing that at each iteration of Step 3, the algorithm finds the largest possible interval [6].


Next: Worst-Case Computational Complexity.
Back: Recovering Plans from a Sequence of Preimages.
First: Introduction.
Last: References.
Comment Form


Carl F. Sutter <sutter@usc.edu>