Understanding how to move one polygon past another using only translations — and doing it with an efficient, reliable method you can trust.
This work delves into the problem of separating two simple polygons by a sequence of translations. It places the question in the broader context of motion planning, showing how a single moving polygon can navigate around a fixed obstacle. The focus is on practical algorithms, performance guarantees, and the structure of the space of all free placements.
- Offers a concrete model of translational motion planning for polygonal shapes
- Shows how to compute the space of safe placements and the boundaries that separate them
- Describes methods to find shortest separating motions and, when possible, motions using a limited number of translations
- Provides time and complexity insights for planning and execution
Ideal for readers interested in computational geometry, robotics, and the mathematics of motion planning, especially those seeking a rigorous treatment of translation-only separation scenarios.