scientific article; zbMATH DE number 1947377

MaRDI QIDQ4411341zbMATH OpenFDO

Authors

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610005.htm

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25)

Recommendations

• Kinetic kd-trees and longest-side kd-trees
• Kinetic KD-trees and longest-side KD-trees
• Soft kinetic data structures
• Kinetic Euclidean minimum spanning tree in the plane
• Kinetic sorting and kinetic convex hulls

Cited in

(15)

• Median trajectories
• Out-of-order event processing in kinetic data structures
• A segment-tree based kinetic BSP
• Kinetic facility location
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Resilient \(k\)-d trees: \(k\)-means in space revisited
• Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes
• Kinetic sorting and kinetic convex hulls
• Kinetic kd-trees and longest-side kd-trees
• Kinetic maintenance of mobile \(k\)-centres on trees
• The projection median of a set of points
• Smooth kinetic maintenance of clusters
• Soft kinetic data structures
• Kinetic heap-ordered trees: Tight analysis and improved algorithms
• Kinetic KD-trees and longest-side KD-trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411341)