A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Finding minimal convex nested polygons
Information and Computation
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic binary space partitions for intersecting segments and disjoint triangles
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Maintaining the Extent of a Moving Point Set
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Algorithmic issues in modeling motion
ACM Computing Surveys (CSUR)
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Proceedings of the nineteenth annual symposium on Computational geometry
Smooth kinetic maintenance of clusters
Proceedings of the nineteenth annual symposium on Computational geometry
Faster core-set constructions and data stream algorithms in fixed dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
Kinetic sorting and kinetic convex hulls
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Smooth kinetic maintenance of clusters
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
Competitive algorithms for maintaining a mobile center
Mobile Networks and Applications
Faster core-set constructions and data-stream algorithms in fixed dimensions
Computational Geometry: Theory and Applications
Kinetic sorting and kinetic convex hulls
Computational Geometry: Theory and Applications
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Approximating largest convex hulls for imprecise points
Journal of Discrete Algorithms
Kinetic maintenance of mobile k-centres on trees
Discrete Applied Mathematics
The projection median of a set of points
Computational Geometry: Theory and Applications
Smooth kinetic maintenance of clusters
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Faster core-set constructions and data-stream algorithms in fixed dimensions
Computational Geometry: Theory and Applications
Kinetic maintenance of mobile k-centres on trees
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Approximating largest convex hulls for imprecise points
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Toward a Robust Search Method for the Protein-Drug Docking Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Streaming algorithms for geometric problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Smoothed analysis of left-to-right maxima with applications
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We present approximation algorithms for maintaining various descriptors of the extent of moving points in Rd. We first describe a data structure for maintaining the smallest orthogonal rectangle containing the point set. We then use this data structure to maintain the approximate diameter, smallest enclosing disk, width, and smallest area or perimeter bounding rectangle of a set of moving points in R2 so that the number of events is only a constant. This contrasts with &OHgr;(n2) events that data structures for the maintenance of those exact properties have to handle.