Solving the two-dimensional findpath problem using a line-triangle representation of the robot
- 31 December 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (4) , 449-469
- https://doi.org/10.1016/0196-6774(88)90012-0
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- A fast algorithm for the Boolean masking problemComputer Vision, Graphics, and Image Processing, 1985
- A subdivision algorithm in configuration space for findpath with rotationIEEE Transactions on Systems, Man, and Cybernetics, 1985
- Navigation for an intelligent mobile robotIEEE Journal on Robotics and Automation, 1985
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Automatic Planning of Manipulator Transfer MovementsIEEE Transactions on Systems, Man, and Cybernetics, 1981
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979