A family of new algorithms for soft filling
暂无分享,去创建一个
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.
[1] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[2] Henry Lieberman. How to color in a coloring book , 1978, SIGGRAPH '78.
[3] Alvy Ray Smith,et al. Tint fill , 1979, SIGGRAPH.