Data Structures for Mobile Data
Open Access
- 1 April 1999
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 31 (1), 1-28
- https://doi.org/10.1006/jagm.1998.0988
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Cylindrical static and kinetic binary space partitionsComputational Geometry, 2000
- Data Structures for Mobile DataJournal of Algorithms, 1999
- Sweeping lines and line segments with a heapPublished by Association for Computing Machinery (ACM) ,1997
- Maintaining the extent of a moving point setLecture Notes in Computer Science, 1997
- A practical evaluation of kinetic data structuresPublished by Association for Computing Machinery (ACM) ,1997
- Proximity problems on moving pointsPublished by Association for Computing Machinery (ACM) ,1997
- The overlay of lower envelopes and its applicationsDiscrete & Computational Geometry, 1996
- Applications of Parametric Searching in Geometric OptimizationJournal of Algorithms, 1994
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979