Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
