Abstract
We present an algorithm to answer a set Q of range counting queries over a point set P in d dimensions. The algorithm takes O (Formula Presented) I/Os and uses linear space. For an important special case, the α(|P|) term in the I/Ocomplexity of the algorithm can be eliminated. We apply this algorithm to constructing t-spanners for point sets in ℝd and polygonal obstacles in the plane, and finding the K closest pairs of a point set in ℝd.
Cite
CITATION STYLE
Lukovszk, T., Maheshwari, A., & Zeh, N. (2001). I/O-efficient batched range counting and its applications to proximity problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2245, pp. 244–255). Springer Verlag. https://doi.org/10.1007/3-540-45294-x_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
