A new algorithm for shortest paths among obstacles in the plane
- 1 March 1991
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 3 (1) , 83-105
- https://doi.org/10.1007/bf01530888
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- 3-dimensional shortest paths in the presence of polyhedral obstaclesPublished by Springer Nature ,2005
- An algorithmic approach to some problems in terrain navigationArtificial Intelligence, 1988
- Time and space efficient algorithms for shortest paths between convex polygonsInformation Processing Letters, 1988
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Visibility of disjoint polygonsAlgorithmica, 1986
- On Shortest Paths in Polyhedral SpacesSIAM Journal on Computing, 1986
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- A note on two problems in connexion with graphsNumerische Mathematik, 1959