Linear quadtrees: A blocking technique for contour filling

DOI10.1016/0031-3203(84)90078-5MaRDI QIDQ792777zbMATH OpenOpenAlexFDO

Authors H. H. Atkinson, Irene Gargantini

Publication date 1984

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0031-3203(84)90078-5

zbMATH Keywords

graphicsbinary imagesconnectivity fillingcontour fillinglinear quadtreepixel-based algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Linear-time border-tracing algorithms for quadtrees
• An optimal boundary to quadtree conversion algorithm
• Adaptive quadtree subdividing contour plotting algorithms
• The necessary and sufficient condition and the efficient algorithms for gradually varied fill
• The Use of Linear Quadtrees in a Numerical Problem

Cites work

• scientific article; zbMATH DE number 3862478 (Why is no real title available?)
• scientific article; zbMATH DE number 3757747 (Why is no real title available?)
• An effective way to represent quadtrees
• Connectivity in Digital Pictures
• Detection of connectivity for regions represented by linear quadtrees
• Region representation
• Translation, rotation and superposition of linear quadtrees

Cited in

(6)

• An optimal boundary to quadtree conversion algorithm
• On the size of quadtrees generalized to d-dimensional binary pictures
• Determination of the 3D border by repeated elimination of internal surfaces
• Comments on Detection of connectivity for regions represented by linear quadtrees
• Adaptive quadtree subdividing contour plotting algorithms
• A New Contour Filling Algorithm Based on 2D Topological Map

This page was built for publication: Linear quadtrees: A blocking technique for contour filling

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