Where academic tradition
meets the exciting future

Note: An Algorithm for Contour-Based Region Filling

Marius C. Codrea, Olli S. Nevalainen, Note: An Algorithm for Contour-Based Region Filling. Computers & Graphics 29(3), 441-450, 2005.

Abstract:

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.

BibTeX entry:

@ARTICLE{jCoNe05a,
  title = {Note: An Algorithm for Contour-Based Region Filling},
  author = {Codrea, Marius C. and Nevalainen, Olli S.},
  journal = {Computers & Graphics},
  volume = {29},
  number = {3},
  pages = {441-450},
  year = {2005},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)

Edit publication