Issue No. 07 - July (1986 vol. 6)
Roger Hersch , Swiss Federal Institute of Technology, Lausanne
A uniform and consistent way of filling degenerated shapes on a restergrid is presented. The processing algorithms described are based on contour segmentation of shapes along local minima and maxima (polysegments). To reduce errors, contour segments are scan convertedby considering their real parameters. A criterion is introduced to find discreate departure and arrival pixels as well as the initial error for subsequent scan conversion of segments. The context-based description of potential polysegment and scan line intersections permits both the handling of singularities at birth and death points and the treatment of polysegment degeneration. The definition of degeneration and the execution of corresponding processing steps at segment, polysegment, birth and death point levels enables contour filling of shapes scaled down by any factor.
R. Hersch, "Descnrptive Contour Fill of Parly Degenerated Shapes," in IEEE Computer Graphics and Applications, vol. 6, no. , pp. 61-70, 1986.