Rectilinear shortest paths in the presence of rectangular barriers
- 1 January 1989
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 4 (1), 41-53
- https://doi.org/10.1007/bf02187714
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Visibility of disjoint polygonsAlgorithmica, 1986
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 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
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Finding minimum rectilinear distance paths in the presence of barriersNetworks, 1981
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- A note on two problems in connexion with graphsNumerische Mathematik, 1959