A generalized solution to the quadtree expected complexity problem

DOI10.1016/0167-8655(95)00126-2MaRDI QIDQ4840357zbMATH OpenOpenAlexFDO

Authors Bijan G. Mobasseri

Publication date 16 April 1996

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

Full work available at URL https://doi.org/10.1016/0167-8655(95)00126-2

zbMATH Keywords

quadtreesearch algorithmshierarchical compression coding

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 3852447
• scientific article; zbMATH DE number 3986653
• Hypergeometrics and the cost structure of quadtrees
• An Analysis of Randomd-Dimensional Quad Trees
• An exact algorithm for the minimum quartet tree cost problem
• scientific article; zbMATH DE number 1305402
• scientific article; zbMATH DE number 3889305
• Tree approximation in quasi-trees
• On the size of quadtrees generalized to d-dimensional binary pictures

Cited in

(6)

• Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length
• Normalized quadtrees with respect to translations
• An algorithm for evaluating the thermogram heterogeneity based on its quadtree representation
• Study of the universal constants for the multidimensional search quadtrees
• Expected and worst-case storage requirements for quadtrees
• The space efficiency of quadtrees

This page was built for publication: A generalized solution to the quadtree expected complexity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840357)