By Topic

Fill 'er up! [Graphics filling algorithms]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

One of the most important and useful ideas in 2D computer graphics is the fill. Simple in concept but powerful in practice, filling is so basic a technique that there's a fill tool in just about every 2D drawing system sold today. Probably one of the first important uses of fills was to color in 2D cartoon characters, but that's just the tip of the iceberg. It's hard to know who wrote the first fill routine, but it may have been Dick Shoup, who implemented a fill technique for his Superpaint system in the mid-1970s. The next big step was Alvy Ray Smith's 24-bit flood-fill algorithm, which also included tint fill. Change came fast after that point, culminating in the sophisticated filling tools we have today. In this article, I discuss some fill techniques that I've cooked up over time to solve different jobs. I focus on techniques for identifying fill pixels

Published in:

Computer Graphics and Applications, IEEE  (Volume:21 ,  Issue: 1 )