Contour filling in raster graphics

作者: Theo Pavlidis

DOI: 10.1145/800224.806786

关键词:

摘要: The paper discusses algorithms for filling contours in raster graphics. Its major feature is the use of line adjacency graph contour order to fill correctly nonconvex and multiply connected regions, while starting from a “seed.” Because same used “parity check” algorithm, two types can be combined into one. This combination useful either finding seed through parity check, or resolving ambiguities on basis connectivity.

参考文章(13)
Theodosios Pavlidis, Structural Pattern Recognition ,(1977)
Avinash C. Kak, Azriel Rosenfeld, Digital Picture Processing ,(1976)
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
Pavlidis, Steiglitz, The Automatic Counting of Asbestos Fibers in Air Samples IEEE Transactions on Computers. ,vol. 27, pp. 258- 261 ,(1978) , 10.1109/TC.1978.1675082
Linda G. Shapiro, Data structures for picture processing Proceedings of the 5th annual conference on Computer graphics and interactive techniques - SIGGRAPH '78. pp. 140- 146 ,(1978) , 10.1145/800248.1015089
Bryan D. Agkland, Neil H. Weste, The edge flag algorithm — A fill method for raster scan displays IEEE Transactions on Computers. ,vol. 30, pp. 41- 48 ,(1981) , 10.1109/TC.1981.6312155
B. E. Caspers, P. B. Denes, An Interactive Terminal for the Design of Advertisements Bell System Technical Journal. ,vol. 58, pp. 2189- 2216 ,(1979) , 10.1002/J.1538-7305.1979.TB02963.X
Kurt E. Brassel, Robin Fegeas, An algorithm for shading of regions on vector display devices Proceedings of the 6th annual conference on Computer graphics and interactive techniques - SIGGRAPH '79. ,vol. 13, pp. 126- 133 ,(1979) , 10.1145/800249.807434
Theo Pavlidis, Filling algorithms for raster graphics Computer Graphics and Image Processing. ,vol. 10, pp. 126- 141 ,(1979) , 10.1016/0146-664X(79)90046-7