9597-6-18E AID: 1112 | 15/06/2014

Scan lines algorithm

Fig. Intersection points aong t!e scan ines t!at intersect po"gon #ertices.
Algorithm:
First"$ t!e scan ines s!o%& 'e intersecte& (it! a t!e e&ges o) po"gon.
*!ere are so+e pro'e+s or specia cases (!ic! !a#e to 'e controe&.
o Ignore !ori,onta e&ges
o -ertices "ing on scan ines - co%nt t(ice i) t!ere is c!ange in a sope
o - i) t!ere is no c!ange t!en e&ge s!o%& 'e
s!ortene& '" one scan ine.
E&ges t!at intersect (it! " scanine (i s%re" 'e intersecte& '" scan ine ".1.
*!e )or+%a to )in& t!e scanine
s
is
y s =
an& )or an e&ge is
*!e intersection o) a scanine an& an e&ge can 'e )in& o%t '" t!e )or+%a
s
s mx b = +
o /o it 'eco+es 0 1 /
s
x s b m =
*o cac%ate )or scan ine 1 s +
o
1
0 1 1 / 1/
s s
x s b m x m
+
= + = +
Scan Line y
k
+ 1
Scan Line y
k
(X
k + 1
, Y
k + 1
)
(X
k
, Y
k
)