Answers are grounded in this paper and cite their sources.
This paper concerns the design of parts orienters - the dual to the motion planning problem. Two particular paradigms are considered and their abstractions to the computational domain lead to interesting problems in graph pebbling and function composition on finite sets. Polynomial time algorithms are developed for the abstracted problems.
No takes yet. Share an insight, caveat, or question.
B. K. Natarajan (1986) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: