000099744 001__ 99744
000099744 005__ 20181203020716.0
000099744 037__ $$aARTICLE
000099744 245__ $$aDescriptive contour fill of partly degenerated shapes
000099744 269__ $$a1986
000099744 260__ $$c1986
000099744 336__ $$aJournal Articles
000099744 490__ $$aIEEE Comput. Graph. Appl. (USA)
000099744 520__ $$aA uniform and consistent way of filling degenerated shapes on a raster grid is presented. The processing algorithms described are based on the contour segmentation of shapes along local minima and maxima (polysegments). To reduce errors, contour segments are scan converted by considering their real parameters. A criterion is introduced to find discrete 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 allows the contour filling of shapes scaled down by any factor
000099744 6531_ $$acomputational geometry
000099744 6531_ $$acomputer graphics
000099744 700__ $$0242314$$aHersch, R. D.$$g105390
000099744 773__ $$j6$$k7$$q61-70$$tIEEE Computer Graphics and Applications
000099744 909C0 $$0252034$$pLSP$$xU10417
000099744 909CO $$ooai:infoscience.tind.io:99744$$pIC$$particle
000099744 937__ $$aLSP-ARTICLE-1986-001
000099744 970__ $$a2056/LSP
000099744 973__ $$aEPFL$$sPUBLISHED
000099744 980__ $$aARTICLE