Temporal Representation and Reasoning, International Syposium on (2005)
June 23, 2005 to June 25, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2005.21
Peter Revesz , University of Nebraska-Lincoln
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.
Peter Revesz, "Efficient Rectangle Indexing Algorithms Based on Point Dominance", Temporal Representation and Reasoning, International Syposium on, vol. 00, no. , pp. 210-212, 2005, doi:10.1109/TIME.2005.21