Smooth kinetic maintenance of clusters
- 31 May 2005
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 31 (1-2) , 3-30
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Indexing the positions of continuously moving objectsACM SIGMOD Record, 2000
- Data Structures for Mobile DataJournal of Algorithms, 1999
- BluetoothACM SIGMOBILE Mobile Computing and Communications Review, 1998
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsJournal of Algorithms, 1998
- Multicluster, mobile, multimedia radio networkWireless Networks, 1995
- Approximation algorithms for geometric median problemsInformation Processing Letters, 1992
- The R*-tree: an efficient and robust access method for points and rectanglesACM SIGMOD Record, 1990
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithmsACM Transactions on Graphics, 1990
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981