Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Approximation algorithms for geometric problems
Approximation algorithms for NP-hard problems
Multicluster, mobile, multimedia radio network
Wireless Networks
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data structures for mobile data
Journal of Algorithms
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Mobile facility location (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Maintaining approximate extent measures of moving points
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Bluetooth: vision, goals, and architecture
ACM SIGMOBILE Mobile Computing and Communications Review
Kinetic maintenance of mobile k-centres on trees
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
| Hi-index | 0.00 |
We propose a simple, deterministic kinetic data structure (KDS) for maintaining a covering of moving points by axis-aligned unit boxes in R^d. The number of boxes is always within a factor of 3^d of the best possible static covering. In the plane, this approximation factor (9) compares favorably with the approximation factor (around one million) of the best previous algorithm. The new KDS is efficient, local, compact, and responsive.