Efficient Tradeoff Schemes in Data Structures for Querying Moving ObjectsWritten with Pankaj Agarwal, Lars Arge, and Jeff Erickson. In Proc. 12th Annual European Symposium on Algorithms, pages 4-15, 2004. Abstract: 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 various queries on moving objects, including range and proximity queries, and study tradeoffs between various performance measures---query time, data structure size, and accuracy of results. |