I/O-efficient batched range counting and its applications to proximity problems

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

Volumn 2245, Issue , 2001, Pages 244-255

  Lukovszk, Tamás ^a   Maheshwari, Anil ^b   Zeh, Norbert ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; QUERY PROCESSING; SOFTWARE ENGINEERING;

D DIMENSIONS; ITS APPLICATIONS; K-CLOSEST PAIRS; LINEAR SPACES; POINT SET;

ALGORITHMS;

EID: 47149109681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (23)

1. P. K. Agarwal, J. Erickson. Geometric range searching and its relatives. Advances in Disc. and Comp. Geom., pp. 1–56. AMS, 1999.
2. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. S. Vitter. Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems. Proc. SODA, 1998.
3. L. Arge, V. Samoladas, J. S. Vitter. On two-dimensional indexability and optimal range search indexing. Proc. PODS’99, 1999.
4. L. Arge. The buffer tree: A new technique for optimal I/O-algorithms. Proc. WADS, pp. 334–345, 1995.
5. L. Arge, P. B. Miltersen. On showing lower bounds for external-memory computational geometry problems. In J. Abello and J. S. Vitter (eds.), External Memory Algorithms and Visualization. AMS, 1999.
6. L. Arge, D. E. Vengroff, J. S. Vitter. External-memory algorithms for processing line segments in geographic information systems. Proc. ESA, pp. 295–310, 1995.
7. L. Arge, J. S. Vitter. Optimal dynamic interval management in external memory. Proc. FOCS, pp. 560–569, 1996.
8. S. Arya, G. Das, D. M. Mount, J. S. Salowe, M. Smid. Euclidean spanners: Short, thin, and lanky. Proc. STOC, pp. 489–498, 1995.
9. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, J. S. Vitter. External-memory graph algorithms. Proc. SODA, 1995.
10. P. B. Callahan, S. R. Kosaraju. A decomposition of multi-dimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Proc. STOC, pp. 546–556, 1992.
11. K. L. Clarkson. Approximation algorithms for shortest path motion planning. Proc. STOC, pp. 56–65, 1987.
12. M. Fischer, T. Lukovszki, M. Ziegler. Geometric searching in walkthrough animations with weak spanners in real time. Proc. ESA, pp. 163–174, 1998.
13. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, J. S. Vitter. External-memory computational geometry. Proc. FOCS, 1993.
14. S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh. I/O-efficient well-separated pair decomposition and its applications. Proc. ESA, pp. 220–231, 2000.
15. Y. Hassin, D. Peleg. Sparse communication networks and efficient routing in the plane. Proc. PODC, 2000.
16. J. M. Keil, C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7:13–28, 1992.
17. C. Levcopoulos, G. Narasimhan, M. Smid. Efficient algorithms for constructing fault-tolerant geometric spanners. Proc. STOC, pp. 186–195, 1998.
18. T. Lukovszki. New results on fault tolerant geometric spanners. Proc. WADS, pp. 193–204, 1999.
19. J. Ruppert, R. Seidel. Approximating the d-dimensional complete Euclidean graph. Proc. CCCG, pp. 207–210, 1991.
20. D. E. Vengroff, J. S. Vitter. Efficient 3-D range searching in external memory. Proc. STOC, 1996.
21. J. S. Vitter. External memory algorithms. Proc. PODS, pp. 119–128, 1998.
22. J. S. Vitter, E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2–3):110–147, 1994.
23. A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comp., 11:721–736, 1982.