A self-adjusting data structure for multidimensional point sets

DOI10.1007/978-3-642-33090-2_67MaRDI QIDQ2912893zbMATH OpenOpenAlexFDO

Authors Eunhui Park, David M. Mount

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_67

zbMATH Keywords

self-adjusting data structuresgeometric data structuresamortized analysisquadtrees

Mathematics Subject Classification ID

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

Recommendations

• Self-adjusting binary search trees
• Self-adjusting multi-way search trees
• Multidimensional balanced binary trees
• SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
• The skip quadtree

Cited in

(3)

• Dynamic smooth compressed quadtrees
• Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
• Amortized analysis of smooth quadtrees in all dimensions

This page was built for publication: A self-adjusting data structure for multidimensional point sets

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