Closest Pair Problem: Difference between revisions
Jump to navigation
Jump to search
[Next]
No edit summary |
|||
| Line 3: | Line 3: | ||
* https://www.coursera.org/learn/algorithms-divide-conquer/lecture/cER7y/o-n-log-n-algorithm-for-closest-pair-ii-advanced-optional | * https://www.coursera.org/learn/algorithms-divide-conquer/lecture/cER7y/o-n-log-n-algorithm-for-closest-pair-ii-advanced-optional | ||
=Internal= | =Internal= | ||
* [[ | * [[Recursive_Algorithms#Divide_and_Conquer|Divide and Conquer Algorithms]] | ||
=Problem= | =Problem= | ||
Given n pair of points in the plane, figure out which points are closest to each other. | Given n pair of points in the plane, figure out which points are closest to each other. | ||
<center>[[[Algorithms#R23wL0|Next]]]</center> | <center>[[[Algorithms#R23wL0|Next]]]</center> | ||
Revision as of 19:13, 9 November 2021
External
- https://www.coursera.org/learn/algorithms-divide-conquer/lecture/nf0jk/o-n-log-n-algorithm-for-closest-pair-i-advanced-optional
- https://www.coursera.org/learn/algorithms-divide-conquer/lecture/cER7y/o-n-log-n-algorithm-for-closest-pair-ii-advanced-optional
Internal
Problem
Given n pair of points in the plane, figure out which points are closest to each other.