Download presentation
Presentation is loading. Please wait.
1
Design and Analysis of Algorithms
Lecture # 03 Muhammad Nasir Department of Computer Science COMSATS University Islamabad, Lahore Campus
2
2-dimension Maxima Revisited
3
2-dimension Maxima Revisited
4
2-dimension Maxima Revisited
5
2-dimension Maxima Revisited
6
2-dimension Maxima Revisited
7
Plane-sweep Algorithm
8
Plane-sweep Algorithm
9
Plane-sweep Algorithm
10
Plane-sweep Algorithm
11
Plane-sweep Algorithm
12
Plane-sweep Algorithm
13
Plane-sweep Algorithm
14
Plane-sweep Algorithm
15
Plane-sweep Algorithm
16
Plane-sweep Algorithm
17
Plane-sweep Algorithm
18
Plane-sweep Algorithm
19
Plane-sweep Algorithm
20
Analysis of Plane-sweep Algorithm
21
Analysis of Plane-sweep Algorithm
22
Analysis of Plane-sweep Algorithm
23
Analysis of Plane-sweep Algorithm
24
Comparison
25
Comparison
Similar presentations
![CP = E[ s 2, s 5, s 1, s 3, s 2 ’, s 3 ’, s 4, s 1 ’, s 4 ’, s 5 ’ ] S[] I[] s1s1 s1’s1’ s2s2 s2’s2’ s4s4 s4’s4’ s3s3 s3’s3’ s5s5 s5’s5’ Plane Sweep Algorithm.](/16/5105597/big_thumb.jpg "CP = E[ s 2, s 5, s 1, s 3, s 2 ’, s 3 ’, s 4, s 1 ’, s 4 ’, s 5 ’ ] S[] I[] s1s1 s1’s1’ s2s2 s2’s2’ s4s4 s4’s4’ s3s3 s3’s3’ s5s5 s5’s5’ Plane Sweep Algorithm.>")
![A = p 4 B = p 5 CP = E[ p 7, p 2, p 3, p 6, p 1, p 8 ] S[p 4, p 5 ] d min = d 45 Plane Sweep Algorithm for Closest Pair Problem E=Event QueueS=Status Queue.](/16/5191430/big_thumb.jpg "A = p 4 B = p 5 CP = E[ p 7, p 2, p 3, p 6, p 1, p 8 ] S[p 4, p 5 ] d min = d 45 Plane Sweep Algorithm for Closest Pair Problem E=Event QueueS=Status Queue.>")
![Electromagnetism Lecture#1 [Introduction] Instructor: Engr. Muhammad Mateen Yaqoob.](/23/6869354/big_thumb.jpg "Electromagnetism Lecture#1 [Introduction] Instructor: Engr. Muhammad Mateen Yaqoob.>")
