Maintaining the extent of a moving point set
From MaRDI portal
Publication:5953076
DOI10.1007/S00454-001-0019-XzbMATH Open0988.68204OpenAlexW2019186067MaRDI QIDQ5953076FDOQ5953076
Authors: Pankaj K. Agarwal, Leonidas Guibas, John Hershberger, E. Veach 
Publication date: 22 July 2002
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-001-0019-x
Recommendations
Cited In (18)
- Kinetic sorting and kinetic convex hulls
- Out-of-order event processing in kinetic data structures
- Algorithms and Data Structures
- Practical methods for shape fitting and kinetic data structures using coresets
- Kinetic facility location
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- Weak \(\frac 1r\)-nets for moving points
- Bisecting three classes of lines
- Robust shape fitting via peeling and grating coresets
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
- Kinetic sorting and kinetic convex hulls
- Kinetic Maintenance of Mobile k-Centres on Trees
- Kinetic dictionaries: how to shoot a moving target
- Kinetic maintenance of mobile \(k\)-centres on trees
- Maintaining approximate extent measures of moving points
- Maintaining the extent of a moving point set
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
- Median trajectories
This page was built for publication: Maintaining the extent of a moving point set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953076)
