A Self-adjusting Data Structure for Multidimensional Point Sets

DOI10.1007/978-3-642-33090-2_67zbMath1365.68185OpenAlexW97492882MaRDI QIDQ2912893

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

quadtreesself-adjusting data structuresgeometric data structuresamortized analysis

Mathematics Subject Classification ID

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

Related Items (3)

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

This page was built for publication: A Self-adjusting Data Structure for Multidimensional Point Sets