On the size of quadtrees generalized to d-dimensional binary pictures

DOI10.1016/0898-1221(85)90187-7zbMath0577.68080OpenAlexW1997238013MaRDI QIDQ1065557

Timothy R. S. Walsh

Publication date: 1985

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(85)90187-7

zbMATH Keywords

digital picturesspace-efficiency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) 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 ⋮ Linear hypertree for multi-dimensional image representation

Cites Work

• Determination of the 3D border by repeated elimination of internal surfaces
• Linear quadtrees: A blocking technique for contour filling
• Properties and applications of forests of quadtrees for pictorial data representation
• The space efficiency of quadtrees
• Operations on Quadtree Encoded Images
• Set operations on linear quadtrees
• Counting regions, holes, and their nesting level in time proportional to the border
• On a Method of Binary-Picture Representation and Its Application to Data Compression
• An effective way to represent quadtrees

This page was built for publication: On the size of quadtrees generalized to d-dimensional binary pictures