Shortest paths in the plane with convex polygonal obstacles
- 20 August 1986
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 23 (2) , 71-76
- https://doi.org/10.1016/0020-0190(86)90045-1
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Computing the extreme distances between two convex polygonsJournal of Algorithms, 1985
- An algorithm for shortest-path motion in three dimensionsInformation Processing Letters, 1985