Linear quadtrees: A blocking technique for contour filling

DOI10.1016/0031-3203(84)90078-5zbMATH Open0537.68095OpenAlexW2031717664MaRDI QIDQ792777FDOQ792777

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

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

zbMATH Keywords

graphicsbinary imagesconnectivity fillingcontour fillinglinear quadtreepixel-based algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

• Title not available (Why is that?)
• Connectivity in Digital Pictures
• An effective way to represent quadtrees
• Title not available (Why is that?)
• Translation, rotation and superposition of linear quadtrees
• Detection of connectivity for regions represented by linear quadtrees
• Region representation

Cited In (6)

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

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)