Example: confidence

Closest Pair Problem

Subhash Suri UC Santa Barbara 1-Dimension Problem † 1D problem can be solved in O(nlogn) via sorting. † Sorting, however, does not generalize to higher dimensions. So, let’s develop a divide-and-conquer for 1D. † Divide the points S into two sets S1;S2 by some x-coordinate so that p < q for all p 2 S1 and q 2 S2. † Recursively compute closest pair (p1;p2) in S1 and (q1;q2) in …

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Related search queries