Tint fill

Tint fill TTNT FILL Alvy Ray Smith COmputer Graphics Lab New York'Institute of Technology Old Westbury, NY 11568 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 programswhich produce antialiased line segments or dekink black-and-white images. When an area in such an image is to be filled with a newcolor, it is desirable to have the fill algorit~n 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 nsme arises from its ability to change only the tint (hue and saturation) of a pixel, leaving the value (blackness) unchanged. Although http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Loading next page...
1
 
/lp/association-for-computing-machinery/tint-fill-Z3kXkembDr
Datasource
acm
Copyright
Copyright © 1979 by ACM Inc.
ISBN
0-89791-004-4
D.O.I.
10.1145/800249.807456
Publisher site
See Article on Publisher Site

Abstract

TTNT FILL Alvy Ray Smith COmputer Graphics Lab New York'Institute of Technology Old Westbury, NY 11568 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 programswhich produce antialiased line segments or dekink black-and-white images. When an area in such an image is to be filled with a newcolor, it is desirable to have the fill algorit~n 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 nsme arises from its ability to change only the tint (hue and saturation) of a pixel, leaving the value (blackness) unchanged. Although

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off