A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
Authors:
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 67-86
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Separating two simple polygons by a sequence of translationsDiscrete & Computational Geometry, 1988
- Generalized Unfoldings for Shortest PathsThe International Journal of Robotics Research, 1988
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal spaceAlgorithmica, 1987
- Simultaneous containment of several polygons1987
- A subdivision algorithm in configuration space for findpath with rotationIEEE Transactions on Systems, Man, and Cybernetics, 1985
- Computational Geometry1985
- On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriersCommunications on Pure and Applied Mathematics, 1983
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983