Time and space efficient algorithms for shortest paths between convex polygons
- 8 April 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 27 (4), 175-179
- https://doi.org/10.1016/0020-0190(88)90022-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Visibility of disjoint polygonsAlgorithmica, 1986
- Shortest paths in the plane with convex polygonal obstaclesInformation Processing Letters, 1986
- A fast algorithm for the Boolean masking problemComputer Vision, Graphics, and Image Processing, 1985
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985