Abstract
One of the most common problems in graphics and picture analysis is finding the interior of a region when its contour is given, i.e., transforming a class 3 picture into a class 2 picture. For example, any shading algorithm presumes the solution of this problem. In pattern recognition, many algorithms compute integrals over the area of a region and require knowledge of the interior. In photoScannedting, fonts are often described in terms of contours which are then filled to produce the final copy. The problem can be solved in many ways, which can be divided into two broad classes. In the first, one has a precise description of the contour as a polygon and decides which parts of the plane lie in the interior by considering, in effect, the line equations. Such techniques could be called polygon based but we prefer the shorter term edge filling and describe them in Section 8.2. Methods of the second class map the contour onto the discrete plane and then locate the interior by examining the values of pixels. Such pixel based techniques are discussed in Sections 8.3 to 8.5.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Relevant Literature
Dudani, S. A. “Region Extraction Using Boundary Following,” C. H. Chen, ed. Pattern Recognition and Artificial Intelligence New York: Academic Press, 1976, pp. 216–232.
Lieberman, H. “How to Color in a Coloring Book,” SIG-GRAPH’78, Atlanta, Georgia, (August, 1978), pp. 111–116. Published by ACM.
Merrill, R. D. “Representation of Contours and Regions for Efficient Computer Search,” CACM, 16 (1973), pp. 69–82.
Pavlidis, T. “Filling Algorithms for Raster Graphics,” CGIP, 10 (1979), pp. 126–141.
Smith, A. R. “Tint Fill,” SIGGRAPH’79, Chicago, Illinois, (August, 1979), pp. 276–283. Published by ACM.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1982 Computer Science Press, Inc.
About this chapter
Cite this chapter
Pavlidis, T. (1982). Contour Filling. In: Algorithms for Graphics and Image Processing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-93208-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-93208-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-93210-6
Online ISBN: 978-3-642-93208-3
eBook Packages: Springer Book Archive