A new approach on indexing mobile objects on the plane
Authors:
- S. SioutasSSS. Sioutas
- K. TsakalidisKTK. Tsakalidis
- K. TsichlasKTK. Tsichlas
- C. MakrisC. Makris
- Y. ManolopoulosYMY. Manolopoulos
- 1 December 2008
- journal article
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 67 (3) , 362-380
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- I/O-efficient dynamic planar point locationComputational Geometry, 2004
- Efficient Searching with Linear ConstraintsJournal of Computer and System Sciences, 2000
- On two-dimensional indexability and optimal range search indexing1999
- Dynamic half-space reporting, geometric optimization, and minimum spanning trees1992
- The R*-tree: an efficient and robust access method for points and rectanglesACM SIGMOD Record, 1990
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- The power of geometric duality1983
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Decomposable searching problemsInformation Processing Letters, 1979