Connectivity in Digital Pictures
Journal of the ACM (JACM)
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
How to color in a coloring book
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
SoftCel - an application of raster scan graphics to conventional cel animation
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Efficient polygon-filling algorithms for raster displays
ACM Transactions on Graphics (TOG)
Anti-aliasing in topological color spaces
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
I3D '92 Proceedings of the 1992 symposium on Interactive 3D graphics
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Parallel polygon scan conversion on hypercube multiprocessors
Proceedings of the 1999 ACM symposium on Applied computing
Anti-aliased line drawing using brush extrusion
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
The message is the medium: Multiprocess structuring of an interactive paint program
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Contour filling in raster graphics
SIGGRAPH '81 Proceedings of the 8th annual conference on Computer graphics and interactive techniques
Merging and transformation of raster images for cartoon animation
SIGGRAPH '81 Proceedings of the 8th annual conference on Computer graphics and interactive techniques
Techniques for interactive raster graphics
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Filling regions in binary raster images: A graph-theoretic approach
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
A family of new algorithms for soft filling
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Perceptual significance hierarchy: a computer vision theory for color separation
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
Perceptual significance hierarchy: a computer vision theory for color separation
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
To fill a connected area of a digital image is to change the color of all and only those pixels in the area. Fill algorithms for areas defined by sharp boundaries (e.g., a white area surrounded by a black curve) have been implemented at several color computer graphics installations. This paper presents an algorithm for the more difficult problem of filling areas with shaded boundaries (e.g., a white area surrounded by a curve consisting of several shades of gray). These images may arise from digitizing photographs or line drawings with a scanning video camera, or they may be generated by programs which produce antialiased line segments or dekink black-and-white images. When an area in such an image is to be filled with a new color, it is desirable to have the fill algorithm understand the shaded edges and maintain the shading with shades of the new color instead of the old. The tint fill algorithm presented here accomplishes this task. Its name arises from its ability to change only the tint (hue and saturation) of a pixel, leaving the value (blackness) unchanged. Although the algorithm was motivated by and is written in terms of color, it has a more general interpretation, which is also presented.