Efficient Rectangle Indexing Algorithms Based on Point Dominance

Authors:
Peter Revesz
Affiliations:
University of Nebraska-Lincoln
Venue:
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Year:
2005

Citing 0
Cited 2

Efficient MaxCount and threshold operators of moving objects

Geoinformatica
Efficient traffic crash and snow complaint GIS system

Proceedings of the 12th Annual International Digital Government Research Conference: Digital Government Innovation in Challenging Times

Quantified Score

Hi-index	0.00

Visualization

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.