Search for shortest path around semialgebraic obstacles in the plane
- 1 July 1994
- journal article
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 70 (4), 1944-1949
- https://doi.org/10.1007/bf02112433
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Algorithmic motion planning in roboticsComputer, 1989
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- New lower bound techniques for robot motion planning problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- On Shortest Paths Amidst Convex PolyhedraSIAM Journal on Computing, 1987
- Approximation algorithms for shortest path motion planningPublished by Association for Computing Machinery (ACM) ,1987
- An algorithm for shortest-path motion in three dimensionsInformation Processing Letters, 1985
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- Some Useful BoundsPublished by Springer Nature ,1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- Quantifier elimination for real closed fields by cylindrical algebraic decompostionPublished by Springer Nature ,1975