Analysis of the worst case space complexity of a PR quadtree

DOI10.1016/0020-0190(94)90065-5zbMath0795.68048OpenAlexW2093745429MaRDI QIDQ1318753

Clifford A. Shaffer, Sriram V. Pemmaraju

Publication date: 5 April 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90065-5

zbMATH Keywords

worst case analysishierarchical data structuresspatial data structurespoint dataPR quadtree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (2)

Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length ⋮ A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization

Cites Work

• Unnamed Item
• Linear time distance transforms for quadtrees
• An optimal boundary to quadtree conversion algorithm
• Expected and worst-case storage requirements for quadtrees
• Neighbor finding techniques for images represented by quadtrees

This page was built for publication: Analysis of the worst case space complexity of a PR quadtree