《计算模型与算法技术教学课件》4-Divide-and-Conquer.pptVIP

* * * * * * * * * * * * * * Unfortunately, d is not necessarily the smallest distance between all pairs of points in S1 and S2 because a closer pair of points can lie on the opposite sides separating the line. As a step of combining the solutions to the smaller subproblems, when we combine the two sets, we must examine such points. (Illustrate this on the diagram) * Unfortunately, d is not necessarily the smallest distance between all pairs of points in S1 and S2 because a closer pair of points can lie on the opposite sides separating the line. As a step of combining the solutions to the