An analysis and algorithm for filling propagation
暂无分享,去创建一个
Fill algorithms are a common graphics utility used to change the colour of regions in the frame buffer. The propagation algorithm is a key component of filling algorithms. The problem of propagation within a fill algorithm is presented and defined, and the difficulties of formalization and comparison are discussed. The previous algorithms are presented and analyzed under a new comparison metric whose validity is confirmed by run-time tests. A new algorithm is developed, and is shown to have better average and worst case behaviour than the others.
[1] Uri Shani,et al. Filling regions in binary raster images: A graph-theoretic approach , 1980, SIGGRAPH '80.
[2] Alvy Ray Smith,et al. Tint fill , 1979, SIGGRAPH.
[3] Brian A. Barsky,et al. A family of new algorithms for soft filling , 1984, SIGGRAPH.
[4] Theodosios Pavlidis. Contour filling in raster graphics , 1981, SIGGRAPH '81.
[5] Henry Lieberman. How to color in a coloring book , 1978, SIGGRAPH '78.