Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles

Pinaki Mitra, Binay K. Bhattacharya. Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides, editors, Algorithms and Data Structures, Third Workshop, WADS 93, Montréal, Canada, August 11-13, 1993, Proceedings. Volume 709 of Lecture Notes in Computer Science, pages 518-529, Springer, 1993.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.