I/O-efficient shortest path queries in geometric spanners

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2125, Issue , 2001, Pages 287-299

  Maheshwari, Anil ^a   Smid, Michiel ^b   Zeh, Norbert ^a  

^a CARLETON UNIVERSITY   (Canada)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; DATA STRUCTURES; GEOMETRY; GRAPH THEORY; QUERY PROCESSING; TOPOLOGY; TREES (MATHEMATICS);

BINARY SEARCH; BOUNDED DEGREE; GEOMETRIC SPANNER; HIGHER DIMENSIONS; POINT SET; PREPROCESS; ROOTED TREES; SHORTEST PATH QUERIES;

ALGORITHMS;

EID: 84958052436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_27     Document Type: Conference Paper

References (17)

1. P.K. Agarwal, L. Arge, M. Murali, K.R. Varadarajan, J.S. Vitter. I/O-efficient algorithms for contour-line extraction and planar graph blocking. SODA’98, 1998.
2. L. Arge. The buffer tree: A new technique for optimal I/O-algorithms. WADS’95, pp. 334–345, 1995.
3. L. Arge, G.S. Brodal, L. Toma. On external memory MST, SSSP, and multi-way planar separators. SWAT’2000, 2000.
4. L. Arge, D.E. Vengroff, J.S. Vitter. External-memory algorithms for processing line segments in geographic information systems. ESA’95, pp. 295–310, 1995.
5. S. Arikati, D.Z. Chen, L.P. Chew, G. Das, M. Smid, C.D. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. ESA’96, pp. 514–528, 1996.
6. S. Arya, G. Das, D.M. Mount, J.S. Salowe, M. Smid. Euclidean spanners: Short, thin, and lanky. STOC’95, pp. 489–498, 1995.
7. P.B. Callahan, M. Goodrich, K. Ramaiyer. Topology B-trees and their applications. WADS’95, pp. 381–392, 1995.
8. P.B. Callahan, S.R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest neighbors and n-body potential fields. J. ACM, 42:67–90, 1995.
9. P.B. Callahan. Dealing with Higher Dimensions: The Well-Separated Pair Decomposition and Its Applications. PhD thesis, Johns Hopkins, Baltimore, 1995.
10. Y.-J. Chiang, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, J.S. Vitter. External-memory graph algorithms. SODA’95, 1995.
11. Greg N. Frederickson. A data structure for dynamically maintaining rooted trees. J. of Algorithms, 24:37–65, 1997.
12. S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh. I/O-efficient well-separated pair decomposition and its applications. ESA’2000, pp. 220–231, 2000.
13. D. Hutchinson, A. Maheshwari, N. Zeh. An external memory data structure for shortest path queries. COCOON’99, pp. 51–60, 1999 (to appear in Disc. App. Maths).
14. V. Kumar, E.J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. SPDC’96, 1996.
15. M. Smid. Closest-point problems in computational geometry. J.-R. Sack, J. Urrutia (eds.), Handbook of Computational Geometry, pp. 877–936. North-Holland, 2000.
16. M. Thorup. Parallel shortcutting of rooted trees. J. of Algorithms., 23:123–159, 1997.
17. J.S. Vitter. External memory algorithms and data structures. J. Abello, J.S. Vitter (eds.), External Memory Algorithms and Visualization, AMS, 1999.