As you do this, you have to find if the scan line interersects with a part of the polygon (whether that is directly on one of the points or if it intersects the line created from connecting 2 points).

Given the start and endpoints write a java program to draw the line (slope m = 1,-1, 0, ∞) using points. If slope m is 1 then, increment x and y draw the point If slope m is -1 then, increment x and ...

Abstract: This article presents a new scan-line algorithm for displaying bicubic surfaces. Patches are decomposed on regions of constant sign of the z component of the normal before the scan process.

The scanning line algorithm based on computer graphics and the polygon hatching are based on the algorithm theory. Based on the foundation, an improved polygon scan line algorithm model is established ...

This paper presents three scan line methods for drawing pictures of parametrically defined surfaces. A scan line algorithm is characterized by the order in which it generates the picture element of ...