A HORIZONTAL SCAN COLOR FILLING ALGORITHM BASED ON FINDING CROSSING WITH ADDITION AND SUBTRACTION AND VERTEX TYPE FOR CONCAVE POLYGONS
Huimin Qian · Computer Applications and Software · 1995
This paper gives an algorithm of crossings between horizontal lines and the boundaries of a, concave polygon by means of mere addition and subtraction. According to the definition of vertex, it divides: three types of concave vortexes: Horizontal Vertex, Maximum Vertex and Turning Vertex, upon which it builds up a storage structure for their boundaries and establishes the concave-horizontal-scan-color-filling algorithm, thus presenting a method to deal with the problem of a pair with one crossing missing in the case of vertex itself being the crossing.