Overview   Tree   Index 
NPR Literature
PREV  NEXT FRAMES  NO FRAME 

[Smi79]  Tint Fill

Smith:1979:TF (Article)
Author(s)Smith A.R.
Title« Tint Fill »
JournalACM SIGGRAPH Computer Graphics, Proceedings of ACM SIGGRAPH 79 (Chicago, IL, August 8--10, 1979)
Volume13
Number3
Page(s)276--283
Year1979
AddressNew York
URLhttp://alvyray.com/Papers/PapersCG.htm#TintFill

Abstract
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.

BibTeX code
@article{Smith:1979:TF,
  number = {3},
  month = aug,
  author = {Smith, Alvy Ray},
  optkey = {},
  series = CGPACS,
  url = {http://alvyray.com/Papers/PapersCG.htm#TintFill},
  localfile = {papers/Smith.1979.TF.pdf},
  address = {New York},
  publisher = {ACM Press},
  doi = {http://doi.acm.org/10.1145/800249.807456},
  organization = {ACM SIGGRAPH},
  journal = SIGGRAPH79,
  volume = {13},
  optstatus = {URL},
  title = {{T}int {F}ill},
  abstract = { 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.},
  year = {1979},
  pages = {276--283},
}

 Overview   Tree   Index 
NPR Literature
PREV  NEXT FRAMES  NO FRAME 

Submit a bug

This document was generated by bib2html 3.3.
Copyright © 1998-05 Stéphane GALLAND (under the GNU General Public License)

Valid HTML 4.01!Valid CSS!