Title :
Efficient rectangle indexing algorithms based on point dominance
Author_Institution :
Dept. of Comput. Sci. & Eng., Nebraska-Lincoln Univ., Lincoln, NE, USA
Abstract :
An approximate count of the number of (1) k-dimensional rectangles that contain, overlap or are within a query rectangle Q, and (2) linearly moving points that are to the left of a moving query point Q on the x-axis at time t, can be found in (poly)-logarithmic time in the number of rectangles or moving points.
Keywords :
computational complexity; computational geometry; moving query point; point dominance; polylogarithmic time; query rectangle; rectangle indexing algorithms; Computer science; Data structures; Indexing; NASA;
Conference_Titel :
Temporal Representation and Reasoning, 2005. TIME 2005. 12th International Symposium on
Print_ISBN :
0-7695-2370-6
DOI :
10.1109/TIME.2005.21
