Maintaining the extent of a moving point set

DOI10.1007/S00454-001-0019-XMaRDI QIDQ5953076zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

kinetic data structures

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Maintaining the extent of a moving point set
• Maintaining approximate extent measures of moving points
• Algorithms and Data Structures
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Kinetic sorting and kinetic convex hulls

Cited in

(18)

• Kinetic Maintenance of Mobile k-Centres on Trees
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Maintaining approximate extent measures of moving points
• Weak \(\frac 1r\)-nets for moving points
• Practical methods for shape fitting and kinetic data structures using coresets
• Kinetic maintenance of mobile \(k\)-centres on trees
• Kinetic dictionaries: how to shoot a moving target
• Bisecting three classes of lines
• Kinetic sorting and kinetic convex hulls
• Kinetic sorting and kinetic convex hulls
• Kinetic facility location
• Robust shape fitting via peeling and grating coresets
• THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
• Maintaining the extent of a moving point set
• Out-of-order event processing in kinetic data structures
• Median trajectories
• BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
• Algorithms and Data Structures

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)