Affiliation:
1. Berkeley Computer Graphics Laboratory, Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, California
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,General Computer Science
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Neural Volumetric Object Selection;2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR);2022-06
2. A multi-component lattice Boltzmann approach to study the causality of plastic events;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2020-06-22
3. Algorithmic improvements to an exact region-filling technique;Journal of Physics: Conference Series;2015-09-21
4. Bayesian Image Matting Using Infrared and Color Cues;Lecture Notes in Computer Science;2012
5. LazyBrush: Flexible Painting Tool for Hand-drawn Cartoons;Computer Graphics Forum;2009-04