A family of new algorithms for soft filling

Authors:
Kenneth P. Fishkin;Brian A. Barsky
Affiliations:
Berkeley Computer Graphics Laboratory, Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, California;Berkeley Computer Graphics Laboratory, Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, California
Venue:
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Year:
1984

Citing 6
Cited 5

Digital image processing

Digital image processing
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
How to color in a coloring book

SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Tint fill

SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Computational geometry.

Computational geometry.
Status report of the graphic standards planning committee

ACM SIGGRAPH Computer Graphics - Status report of the graphic standards planning committee

Volume seedlings

I3D '92 Proceedings of the 1992 symposium on Interactive 3D graphics
Parallel polygon scan conversion on hypercube multiprocessors

Proceedings of the 1999 ACM symposium on Applied computing
Fast detection of marker pixels in video-based motion capture systems

Pattern Recognition Letters
Geometrical, topological, and hierarchical structuring of overlapping 2-D discrete objects

Computers and Graphics
Bayesian image matting using infrared and color cues

ICISP'12 Proceedings of the 5th international conference on Image and Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Soft filling algorithms change the color of an anti-aliased region, maintaining the anti-aliasing of the region. The two published algorithms for soft filling work only if the foreground region is anti-aliased against a black background. This paper presents three new algorithms. The first fills against a region consisting of any two distinct colors, and is faster than the published algorithms on a pixel-by-pixel basis for an RGB frame buffer; the second fills against a region composed of three distinct colors; and the third fills against a region composed of four distinct colors. As the power of the algorithms increases, so do the number of assumptions they make, and the computational cost.