The space efficiency of quadtrees
From MaRDI portal
Publication:3313295
DOI10.1016/0146-664X(82)90020-XzbMath0531.68042MaRDI QIDQ3313295
Publication date: 1982
Published in: Computer Graphics and Image Processing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Data structures (68P05)
Related Items (4)
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length ⋮ Linear-time border-tracing algorithms for quadtrees ⋮ On the size of quadtrees generalized to d-dimensional binary pictures ⋮ Decomposing a window into maximal quadtree blocks
This page was built for publication: The space efficiency of quadtrees
