| Closest Pair £ All Nearest Neighbors |
|
|
|
|
|
|
|
|
|
|
| Claim:
Closest Pair £ All Nearest Neighbors |
|||||||||
| Proof: |
|||||||||
| • | Given the input
set, find all the nearest neighbors |
||||||||
| • | Examine each
point to see which one has the nearest |
||||||||
| neighbor that is
the closest |
|||||||||
| • | Report that pair
as the closest pair |
||||||||
| Conclusion:
All Nearest Neighbors requires W(n log n) |
|||||||||
| time |
|||||||||
| CS409 - Spring
2000 |
| 7 |