Linear quadtrees: a blocking technique for contour filling
Pattern Recognition
Computer graphics (2nd ed.): C version
Computer graphics (2nd ed.): C version
Connectivity in Digital Pictures
Journal of the ACM (JACM)
An Algorithm for Filling Regions on Graphics Display Devices
ACM Transactions on Graphics (TOG)
An algorithm for shading of regions on vector display devices
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Closed curves in n-dimensional discrete space
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Decomposition of Polygons into Convex Sets
IEEE Transactions on Computers
Discrete topology and contour definition
Pattern Recognition Letters
Topological triangle characterization with application to object detection from images
Image and Vision Computing
A new contour filling algorithm based on 2D topological map
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Short note: wContour: A .NET class library of contour-related algorithms
Computers & Geosciences
| Hi-index | 0.01 |
A linear-time algorithm for filling regions defined by closed contours in raster format is proposed. The algorithm relies on a single pass contour labeling and the actual filling is done in a scan-line manner, visiting the interior pixels only once. The interior endpoints of the scan-lines are discovered solely on the basis of the labeled contour. Despite its simplicity and low computation cost, the proposed method fills-in arbitrary shapes correctly, with no obvious exceptions. Possible special cases may arise from the 8-connectivity, inner contour detection. However, in extensive tests on complicated images, the proposed labeling scheme has given correct results.