Expected and worst-case storage requirements for quadtrees

DOI10.1016/0167-8655(85)90019-4zbMath0557.68049OpenAlexW2094276817MaRDI QIDQ3221427

Vassiliki J. Kollias, John G. Kollias, F. Warren Burton

Publication date: 1985

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(85)90019-4

zbMATH Keywords

binary imagesgeographical information processingquadtree representation of curves or regions

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length ⋮ Analysis of the worst case space complexity of a PR quadtree

This page was built for publication: Expected and worst-case storage requirements for quadtrees