Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes

DOI10.1007/978-3-642-33090-2_34MaRDI QIDQ2912856zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Marcel Roeloffzen, Bettina Speckmann, Mark de Berg

Publication date 25 September 2012

Published in Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33090-2_34

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)

Recommendations

• Dynamic smooth compressed quadtrees
• scientific article; zbMATH DE number 1947377
• Kinetic convex hulls and Delaunay triangulations in the black-box model
• Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
• Faster compressed quadtrees

Cited in

(6)

• Amortized analysis of smooth quadtrees in all dimensions
• A frequency-competitive query strategy for maintaining low collision potential among moving entities
• Frequency-competitive query strategies to maintain low congestion potential among moving entities
• Dynamic smooth compressed quadtrees
• Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions
• Minimizing query frequency to bound congestion potential for moving entities at a fixed target time

This page was built for publication: Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes

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