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.
246 views ⢠16 slides