Optimal shortest path queries in a simple polygon
- 1 October 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 39 (2), 126-152
- https://doi.org/10.1016/0022-0000(89)90041-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple PolygonSIAM Journal on Computing, 1988
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981