Efficient regular data structures and algorithms for location and proximity problems

Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Citations (Scopus)

Abstract

In this paper we investigate data-structures obtained by a recursive partitioning of the input domain into regions of equal size. One of the most well known examples of such a structure is the quadtree, used here as a basis for more complex data structures; we also provide multidimensional versions of the stratified tree by van Emde Boas. We show that under the assumption that the input points have limited precision (i.e. are drawn from the integer grid of size u) these data structures yield efficient solutions to many important problems. In particular, they allow us to achieve O(log log u) time per operation for dynamic approximate nearest neighbor (under insertions and deletions) and exact on-line closest pair (under insertions only) in any constant dimension. They allow O(log log u) point location in a given planar shape or in its expansion (dilation by a ball of a given radius). Finally, we provide a linear time (optimal) algorithm for computing the expansion of a shape represented by a quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the dilation by a ball operation.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science - Proceedings
PublisherIEEE
Pages160-170
Number of pages11
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science - New York, NY, USA
Duration: Oct 17 1999Oct 19 1999

Other

OtherProceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science
CityNew York, NY, USA
Period10/17/9910/19/99

Fingerprint

Data structures

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Amir, A., Efrat, A., Indyk, P., & Samet, H. (1999). Efficient regular data structures and algorithms for location and proximity problems. In Annual Symposium on Foundations of Computer Science - Proceedings (pp. 160-170). IEEE.

Efficient regular data structures and algorithms for location and proximity problems. / Amir, Arnon; Efrat, Alon; Indyk, Piotr; Samet, Hanan.

Annual Symposium on Foundations of Computer Science - Proceedings. IEEE, 1999. p. 160-170.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Amir, A, Efrat, A, Indyk, P & Samet, H 1999, Efficient regular data structures and algorithms for location and proximity problems. in Annual Symposium on Foundations of Computer Science - Proceedings. IEEE, pp. 160-170, Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science, New York, NY, USA, 10/17/99.
Amir A, Efrat A, Indyk P, Samet H. Efficient regular data structures and algorithms for location and proximity problems. In Annual Symposium on Foundations of Computer Science - Proceedings. IEEE. 1999. p. 160-170
Amir, Arnon ; Efrat, Alon ; Indyk, Piotr ; Samet, Hanan. / Efficient regular data structures and algorithms for location and proximity problems. Annual Symposium on Foundations of Computer Science - Proceedings. IEEE, 1999. pp. 160-170
@inproceedings{84ca45c757274f9e818eabc503e1d90e,
title = "Efficient regular data structures and algorithms for location and proximity problems",
abstract = "In this paper we investigate data-structures obtained by a recursive partitioning of the input domain into regions of equal size. One of the most well known examples of such a structure is the quadtree, used here as a basis for more complex data structures; we also provide multidimensional versions of the stratified tree by van Emde Boas. We show that under the assumption that the input points have limited precision (i.e. are drawn from the integer grid of size u) these data structures yield efficient solutions to many important problems. In particular, they allow us to achieve O(log log u) time per operation for dynamic approximate nearest neighbor (under insertions and deletions) and exact on-line closest pair (under insertions only) in any constant dimension. They allow O(log log u) point location in a given planar shape or in its expansion (dilation by a ball of a given radius). Finally, we provide a linear time (optimal) algorithm for computing the expansion of a shape represented by a quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the dilation by a ball operation.",
author = "Arnon Amir and Alon Efrat and Piotr Indyk and Hanan Samet",
year = "1999",
language = "English (US)",
pages = "160--170",
booktitle = "Annual Symposium on Foundations of Computer Science - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Efficient regular data structures and algorithms for location and proximity problems

AU - Amir, Arnon

AU - Efrat, Alon

AU - Indyk, Piotr

AU - Samet, Hanan

PY - 1999

Y1 - 1999

N2 - In this paper we investigate data-structures obtained by a recursive partitioning of the input domain into regions of equal size. One of the most well known examples of such a structure is the quadtree, used here as a basis for more complex data structures; we also provide multidimensional versions of the stratified tree by van Emde Boas. We show that under the assumption that the input points have limited precision (i.e. are drawn from the integer grid of size u) these data structures yield efficient solutions to many important problems. In particular, they allow us to achieve O(log log u) time per operation for dynamic approximate nearest neighbor (under insertions and deletions) and exact on-line closest pair (under insertions only) in any constant dimension. They allow O(log log u) point location in a given planar shape or in its expansion (dilation by a ball of a given radius). Finally, we provide a linear time (optimal) algorithm for computing the expansion of a shape represented by a quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the dilation by a ball operation.

AB - In this paper we investigate data-structures obtained by a recursive partitioning of the input domain into regions of equal size. One of the most well known examples of such a structure is the quadtree, used here as a basis for more complex data structures; we also provide multidimensional versions of the stratified tree by van Emde Boas. We show that under the assumption that the input points have limited precision (i.e. are drawn from the integer grid of size u) these data structures yield efficient solutions to many important problems. In particular, they allow us to achieve O(log log u) time per operation for dynamic approximate nearest neighbor (under insertions and deletions) and exact on-line closest pair (under insertions only) in any constant dimension. They allow O(log log u) point location in a given planar shape or in its expansion (dilation by a ball of a given radius). Finally, we provide a linear time (optimal) algorithm for computing the expansion of a shape represented by a quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the dilation by a ball operation.

UR - http://www.scopus.com/inward/record.url?scp=0033332404&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033332404&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033332404

SP - 160

EP - 170

BT - Annual Symposium on Foundations of Computer Science - Proceedings

PB - IEEE

ER -