An O(n log n) Manhattan path algorithm
- 31 August 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 19 (2), 99-102
- https://doi.org/10.1016/0020-0190(84)90105-4
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Finding a manhattan path and related problemsNetworks, 1983
- Rectilinear line segment intersection, layered segment trees, and dynamizationJournal of Algorithms, 1982
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978