CP = E[ s 2 , s 5 , s 1 , s 3 , s 2 ’ , s 3 ’ , s 4 , s 1 ’ , s 4 ’ , s 5 ’ ] S[] I[]
s 2. s 5. s 1. s 3. s 2 ’. s 3 ’. s 4. s 1 ’. s 4 ’. s 5 ’. Plane Sweep Algorithm for Line-Segment Intersection Problem. CP = E[ s 2 , s 5 , s 1 , s 3 , s 2 ’ , s 3 ’ , s 4 , s 1 ’ , s 4 ’ , s 5 ’ ] S[] I[]. CP=Current Point E=Event Queue S=Status Queue I=Intersection List.
250 views • 16 slides