Efficient regular data structures and algorithms for dilation, location, and proximity problems

A. Amir, Alon Efrat, P. Indyk, H. Samet

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

In this paper we investigate data structures obtained by a recursive partitioning of the multi-dimensional input domain into regions of equal size. One of the best known examples of such a structure is the quadtree. It is used here as a basis for more complex data structures. We also provide multidimensional versions of the stratified tree by van Emde Boas [vEB]. 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 number of dimensions. 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 region quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the operation of dilation by a ball.

Original languageEnglish (US)
Pages (from-to)164-187
Number of pages24
JournalAlgorithmica
Volume30
Issue number2
StatePublished - Jun 2001

Fingerprint

Algorithms and Data Structures
Dilation
Proximity
Data structures
Data Structures
Quadtree
Insertion
Ball
Recursive Partitioning
Point Location
Linear-time Algorithm
Optimal Algorithm
Efficient Solution
Complex Structure
Deletion
Nearest Neighbor
Radius
Optimise
Sufficient
Grid

Keywords

  • Approximate nearest neighbor
  • Multidimensional stratified trees
  • Point location
  • Quadtree dilation
  • Spatial data structure

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Safety, Risk, Reliability and Quality
  • Applied Mathematics

Cite this

Efficient regular data structures and algorithms for dilation, location, and proximity problems. / Amir, A.; Efrat, Alon; Indyk, P.; Samet, H.

In: Algorithmica, Vol. 30, No. 2, 06.2001, p. 164-187.

Research output: Contribution to journalArticle

@article{85bb2e706e904ecebe411cc1d2a4b9a4,
title = "Efficient regular data structures and algorithms for dilation, location, and proximity problems",
abstract = "In this paper we investigate data structures obtained by a recursive partitioning of the multi-dimensional input domain into regions of equal size. One of the best known examples of such a structure is the quadtree. It is used here as a basis for more complex data structures. We also provide multidimensional versions of the stratified tree by van Emde Boas [vEB]. 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 number of dimensions. 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 region quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the operation of dilation by a ball.",
keywords = "Approximate nearest neighbor, Multidimensional stratified trees, Point location, Quadtree dilation, Spatial data structure",
author = "A. Amir and Alon Efrat and P. Indyk and H. Samet",
year = "2001",
month = "6",
language = "English (US)",
volume = "30",
pages = "164--187",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "2",

}

TY - JOUR

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

AU - Amir, A.

AU - Efrat, Alon

AU - Indyk, P.

AU - Samet, H.

PY - 2001/6

Y1 - 2001/6

N2 - In this paper we investigate data structures obtained by a recursive partitioning of the multi-dimensional input domain into regions of equal size. One of the best known examples of such a structure is the quadtree. It is used here as a basis for more complex data structures. We also provide multidimensional versions of the stratified tree by van Emde Boas [vEB]. 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 number of dimensions. 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 region quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the operation of dilation by a ball.

AB - In this paper we investigate data structures obtained by a recursive partitioning of the multi-dimensional input domain into regions of equal size. One of the best known examples of such a structure is the quadtree. It is used here as a basis for more complex data structures. We also provide multidimensional versions of the stratified tree by van Emde Boas [vEB]. 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 number of dimensions. 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 region quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the operation of dilation by a ball.

KW - Approximate nearest neighbor

KW - Multidimensional stratified trees

KW - Point location

KW - Quadtree dilation

KW - Spatial data structure

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

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

M3 - Article

VL - 30

SP - 164

EP - 187

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 2

ER -