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
This presentation is the property of its rightful owner.
Sponsored Links
1 / 7

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 PowerPoint PPT Presentation


  • 57 Views
  • Uploaded on
  • Presentation posted in: General

p 4. p 1. p 6. p 2. p 7. p 8. p 3. p 5. Plane Sweep Algorithm for Closest Pair Problem. 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. E=Event QueueS=Status Queue A,B = Current closest pair CP = Current point

Download Presentation

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

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


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

p4

p1

p6

p2

p7

p8

p3

p5

Plane Sweep Algorithm

for

Closest Pair Problem

A = p4B = p5CP =

E[ p7 , p2 , p3 , p6 , p1 , p8 ]

S[p4 , p5 ]

dmin = d45

E=Event QueueS=Status Queue

A,B = Current closest pair

CP = Current point

dmin = Current minimum distance (distance between point A and B)

dij = distance between pi and pj


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

p4

p1

p6

p2

p7

p8

p3

p5

Previous

A = p4B = p5CP =

E[ p7 , p2 , p3 , p6 , p1 , p8 ]

S[ p4 , p5 ]

dmin = d45

d45

New

A = p4B = p5CP = p7

E[ p7 , p2 , p3 , p6 , p1 , p8 ]

S[ p4 , p5 , p7 ]

dmin <= min (dmin , d57 ) = d45


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

p4

p1

p6

p2

p7

p8

p3

p5

Previous

A = p4B = p5CP = p7

E[ p2 , p3 , p6 , p1 , p8 ]

S[ p5 , p7 ]

dmin = d45

d45

New

A = p2B = p7CP = p2

E[ p2 , p3 , p6 , p1 , p8 ]

S[ p5 , p7 , p2 ]

dmin <= min (dmin , d25 , d27 ) = d27


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

p4

p1

p6

p2

p7

p8

p3

p5

Previous

A = p2B = p7CP = p2

E[ p3 , p6 , p1 , p8 ]

S[ p5 , p7 , p2 ]

dmin = d27

d27

New

A = p2B = p7CP = p3

E[ p3 , p6 , p1 , p8 ]

S[ p5 , p7 , p2 , p3 ]

dmin <= d27


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

p4

p1

p6

p2

p7

p8

p3

p5

Previous

A = p2B = p7CP = p3

E[ p6 , p1 , p8 ]

S[p3 ]

dmin <= d27

New

A = p3B = p6CP = p6

E[ p6 , p1 , p8 ]

S[ p3 , p6 ]

dmin <= min (dmin , d36 ) = d36

d27


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

p4

p1

p6

p2

p7

p8

p3

p5

Previous

A = p3B = p6CP = p6

E[ p1 , p8 ]

S[p3 , p6 ]

dmin <= d36

New

A = p3B = p6CP = p1

E[ p1 , p8 ]

S[ p3 , p6 , p1 ]

dmin <= d36

d36


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

p4

p1

p6

p2

p7

p8

p3

p5

Previous

A = p3B = p6CP = p1

E[ p8 ]

S[ p1 ]

dmin <= d36

New

A = p3B = p6CP = p8

E[ p8 ]

S[ p1 , p8 ]

dmin <= d36

d36

Event Queue Is Empty, therefore STOP


  • Login