Efficient tradeoff schemes in data structures for querying moving objects

Written with Pankaj K. Agarwal, Lars Arge, and Hai Yu*
Proceedings of the 12th Annual European Symposium on Algorithms, 4-15, 2004.

The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for answering queries on moving objects and study tradeoffs between various performance measures--query time, size, and accuracy of the result.

Publications - Jeff Erickson (jeffe@cs.uiuc.edu) 09 Apr 2004