摘要
The paper puts forward a highly efficient and practical scan line based on the filling algorithm. The algorithm takes the lines of polygon as line segments with directions and introduces the concept of marked value when the apex of polygon faces scan line, determines whether there are intersection points between the lines of polygon and scan lines, by judging whether the marked value has changed or not. This method avoids the extra decision and treatment of odd points in traditional algorithm, and it needs little calculations but it is highly efficient.
The paper puts forward a highly efficient and practical scan-line based on the filling algorithm. The algorithm takes the lines of polygon as line segments with directions and introduces the concept of marked value when the apex of polygon faces scan-line, determines whether there are intersection points between the lines of polygon and scan-lines, by judging whether the marked value has changed or not. This method avoids the extra decision and treatment of odd points in traditional algorithm, and it needs little calculations but it is highly efficient.
