Approximate distance oracles for geometric spanners

ACM Transactions on Algorithms

Volumn 4, Issue 1, 2008, Pages

  Gudmundsson, Joachim ^a   Levcopoulos, Christos ^b   Narasimhan, Giri ^c   Smid, Michiel ^d  

^a CSIRO   (Australia)

^b LUND UNIVERSITY   (Sweden)

^c FLORIDA INTERNATIONAL UNIVERSITY   (United States)

^d CARLETON UNIVERSITY   (Canada)

Author keywords

Approximation algorithm; Computational geometry; Geometric graphs; Shortest paths; Spanners

Indexed keywords

GEOMETRIC GRAPHS; SHORTEST PATHS; SPANNERS;

APPROXIMATION ALGORITHMS; DATA STRUCTURES; GRAPH THEORY; QUERY LANGUAGES;

COMPUTATIONAL GEOMETRY;

EID: 42149179298     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1328911.1328921     Document Type: Article

References (51)

1. AGARWAL, P. K., HAR-PELED, S., AND KARIA, M. 2000. Computing approximate shortest paths on convex polytopes. In Proceedings of the 16th ACM Symposium on Computational Geometry, 270-279.
2. AGARWAL, P. K., HAR-PELED, S., SHARIR, M., AND VARADARAJAN, K. R. 1997. Approximate shortest paths on a convex polytope in three dimensions. J. ACM 44, 567-584.
3. AINGWORTH, D., CHEKURI, C., INDYK, P., AND MOTWANI, R. 1999. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28, 1167-1181.
4. ARIKATI, S., CHEN, D. Z., CHEW, L. P., DAS, G., SMID, M., AND ZAROLIAGIS, C. D. 1996. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proceedings of the 4th Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 1136. Springer, Berlin, 514-528.
5. ARORA, S. 1998. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45, 753-782.
6. ARORA, S. 1997. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 554-563.
7. BARTAL, Y. 1996. Probabilistic approximations of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 184-193.
8. 2) time. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), 271-280.
9. BENDER, M. A., AND FARACH-COLTON, M. 2000. The LCA problem revisited. In Proceedings of the 4th Latin American Symposium on Theoretical Informatics. Lecture Notes in Computer Science, vol. 1776. Springer, Berlin, 88-94.
10. CALLAHAN, P. B. 1995. Dealing with her dimensions: The well-separated pair decomposition and its applications. Ph.D. thesis, Department of Computer Science, Johns Hopkins University, Baltimore, Maryland.
11. CALLAHAN, P.B., AND KOSARAJU, S. R. 1993. Faster algorithms for some geometric graph problems in higher dimensions. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), 291-300.
12. CALLAHAN, P. B., AND KOSARAJU, S. R. 1995. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM 42, 67-90.
13. CHAN, T. M. 1998. Approximate nearest neighbor queries revisited. Discr. Comput. Geom. 20, 359-373.
14. CHEN, D. Z. 1995. On the all-pairs Euclidean short path problem. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms (SODA), 292-301.
15. CHEN, D. Z., DAESCU, O., AND KLENK, K. S. 2001. On geometric path query problems. Int. J. Comput. Geom. Appl. 11, 617-645.
16. CHEN, D. Z., KLENK, K. S., AND TU, H.-Y. T. 2000. Shortest path queries among weighted obstacles in the rectilinear plane. SIAM J. Comput. 29, 1223-1246.
17. CLARKSON, K. L. 1987. Approximation algorithms for shortest path motion planning. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), 56-65.
18. COHEN, E. 1998. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput. 28, 210-236.
19. DAS, G., AND NARASIMHAN, G. 1997. A fast algorithm for constructing sparse Euclidean spanners. Int. J. Comput. Geom. Appl. 7, 297-315.
20. DAS, G., AND JOSEPH, D. 1989. Which triangulations approximate the complete graph? In Proceedings of the International Symposium on Optimal Algorithms. Lecture Notes in Computer Science, vol. 401. Springer, Berlin, 168-192.
21. DE BERG, M., KATZ, M. J., VAN DER STAPPEN, A. F., AND VLEUGELS, J. 2002. Realistic input models for geometric algorithms. Algorithmica 34, 81-97.
22. DOR, D., HALPERIN, S., AND ZWICK, U. 2000. All-Pairs almost shortest paths. SIAM J. Comput. 29, 1740-1759.
23. GAO, J., GUIBAS, L. J., HERSHBERGER, J., ZHANG, L., AND ZHU, A. 2003. Discrete mobile centers. Discr. Comput. Geom. 30, 45-63.
24. GONZALEZ, T. 1975. Algorithms on sets and related problems. Tech. Rep., Department of Computer Science, University of Oklahoma, Norman.
25. GUDMUNDSSON, J., LEVCOPOULOS, C., AND NARASIMHAN, G. 2002. Fast greedy algorithms for constructing sparse geometric spanners. SIAM J. Comput. 31, 1479-1500.
26. GUDMUNDSSON, J., NARASIMHAN, G., AND SMID, M. 2005. Fast pruning of geometric spanners. In Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 3404. Springer, Berlin, 508-520.
27. GUDMUNDSSON, J., LEVCOPOULOS, C., NARASIMHAN, G., AND SMID, M. 2002a. Approximate distance oracles for geometric graphs. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 828-837.
28. GUDMUNDSSON, J., LEVCOPOULOS, C., NARASIMHAN, G., AND SMID, M. 2002b. Approximate distance oracles revisited. In Proceedings of the 13th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 2518. Springer, Berlin, 357-368.
29. GUIBAS, L. J., AND HERSHBERGER, J. 1989. Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. 39, 126-152.
30. GUSFIELD, D. 1997. Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge, UK.
31. HAR-PELED, S. 1997. Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions. In Proceedings of the 13th ACM Symposium on Computational Geometry, 359-365.
32. HAREL, D., AND TARJAN, R. E. 1984. Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 338-355.
33. HERSHBERGER, J., AND SURI, S. 1999. An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput. 28, 2215-2256.
34. INDYK, P. 2001. Algorithmic applications of low-distortion geometric embeddings. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 10-33.
35. KAPOOR, S., MAHESHWARI, S. N., AND MITCHELL, J. S. B. 1997. An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discr. Comput. Geom. 18, 377-383.
36. KEIL, J. M., AND GUTWIN, C. A. 1992. Classes of graphs which approximate the complete Euclidean graph. Discr. Comput. Geom. 7, 13-28.
37. LEE, D. T., AND WU, Y. F. 1986. Geometric complexity of some location problems. Algorithmica 1, 193-211.
38. MITCHELL, J. S. B. 1996. Shortest paths among obstacles in the plane. Int. J. Comput. Geom. Appl. 6, 309-332.
39. MITCHELL, J. S. B. 1998. Geometric shortest paths and network optimization. In Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds. Elsevier Science, Amsterdam, Chapter 24, 633-701.
40. MITCHELL, J. S. B. 1997. Shortest paths and networks. In Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, eds. CRC Press LLC, Boca Raton, FL, Chapter 24, 445-466.
41. NARASIMHAN, G., AND SMID, M. 2000. Approximating the stretch, factor of Euclidean graphs. SIAM J. Comput. 30, 978-989.
42. OVERMARS, M. H., AND VAN DER STAPPEN, A. F. 1996. Range searching and point location among fat objects. J. Algor. 21, 629-656.
43. PREPARATA, F. P., AND SHAMOS, M. I. 1988. Computational Geometry: An Introduction. Springer, Berlin.
44. PYRGA, E., SCHULZ, F., WAGNER, D., AND ZAROLIAGIS, C. 2004. Experimental comparison of shortest path approaches for timetable information. In Proceedings of the 6th Workshop on Algorithm Engineering and Experiments. Lecture Notes in Computer Science. Springer, Berlin, 88-99.
45. SALOWE, J. S. 1991. Constructing multidimensional spanner graphs. Int. J. Comput. Geom. Appl. 1, 99-107.
46. SCHIEBER, B., AND VISHKIN, U. 1988. On finding lowest common ancestors: Simplifications and parallelisations. SIAM J. Comput. 17, 327-334.
47. SURI, S. 1997. Polygons. In Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, eds. CRC Press LLC, Boca Raton, FL, Chapter 23, 429-444.
48. THORUP, M. 2004. Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51, 993-1024.
49. THORUP, M., AND ZWICK, U. 2001. Approximate distance oracles. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), 183-192.
50. WAGNER, D., AND WILLHALM, T. 2003. Geometric speed-up techniques for finding shortest paths in large sparse graphs. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, vol. 2832. Springer, Berlin, 776-787.
51. WAGNER, D., WILLHALM, T., AND ZAROLIAGIS, C. 2004. Dynamic shortest path containers. In Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways. Electronic Notes in Theoretical Computer Science, vol. 92. Elsevier, 65-84.