Scribd
Upload
346 views

Scanline Polygon Filling Algorithm

The document describes the scanline polygon filling algorithm. It works by scanning the polygon from top to bottom with a horizontal line. When an edge is intersected, pixels are colored inside the polygon until another edge is intersected. If there is an odd number of edge intersections, the pixel is inside the polygon, and if there is an even number it is outside. It also describes handling cases where an edge endpoint intersects two edges, and maintaining an active edge list for each scanline.

Uploaded by

Shubham Raghav
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
346 views

Scanline Polygon Filling Algorithm

The document describes the scanline polygon filling algorithm. It works by scanning the polygon from top to bottom with a horizontal line. When an edge is intersected, pixels are colored inside the polygon until another edge is intersected. If there is an odd number of edge intersections, the pixel is inside the polygon, and if there is an even number it is outside. It also describes handling cases where an edge endpoint intersects two edges, and maintaining an active edge list for each scanline.

Uploaded by

Shubham Raghav
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Filling a Polygon using Scanline polygon filling algorithm

Basic algorithm
Assume scan line start from the left and is outside the polygon.
When intersect an edge of polygon, start to color each pixel (because now were inside the
polygon), when intersect another edge, stop coloring
Odd number of edges: inside
Even number of edges: outside
What happens when a scan line intersects an edge endpoint, it intersects two edges.
Two cases:
Case A: edges are monotonically increasing or decreasing
Case B: edges reverse direction at endpoint
In Case A, we should consider this as only ONE edge intersection
In Case B, we should consider this as TWO edge intersections

Incremental scan line method:


m = (y[k+1] y[k]) / (x[k+1] x[k])
y[k+1] y[k] = 1
x[k+1] = x[k] + 1/m x[k]

Active Edge List


Start with the sorted edge table.

In the above diagram, there is an entry for each scan-line.


Add only the non-horizontal edges into the table.
For each edge, we add it to the scan-line that it begins with (that is, the scan-line equal to its
lowest y-value).
For each edge entry, store
(1) The x-intercept with the scan-line
(2) The largest yvalue of the edge, and

(3) The inverse of the slope.


Each scan-line entry thus contains a sorted list of edges. The edges are sorted left to right. (To
maintain sorted order, just use insertion based on their x value.)
Next, we process the scan lines from bottom to top.
We maintain an active edge list for the current scan-line.
The active edge list contains all the edges crossed by that scan line. As we move up,
update the active edge list by the sorted edge table if necessary.

You might also like