分而治之算法---距离最近的点对（Divide and conquer algorithm -- nearest point pair）.docVIP

下载本文档

3
0
约1.45万字
约 16页
2017-10-06 发布于河南
举报
版权申诉

分而治之算法---距离最近的点对（Divide and conquer algorithm -- nearest point pair）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

分而治之算法---距离最近的点对（Divide and conquer algorithm -- nearest point pair）

分而治之算法---距离最近的点对（Divide and conquer algorithm -- nearest point pair） Divide and rule algorithm --- the nearest point of the.Txt marriage is a keyboard, too many orders and rules; love is the mouse, one click. Men are more important than memory in the host computer; women are like monitors; everything can be seen. Nearest point pair Given n points (Xi, Yi) (1 i n), which requires to find the nearest two points. Example 14-7 assume that n holes are drilled on a piece of metal. If the hole is too close, the metal may break. If we know the minimum distance between two holes, we can estimate the probability of metal fracture. The minimum distance problem is, in fact, the nearest point pair problem. By checking all n (n- 1) / 2 pairs, and calculating the distance between each pair, the closest pair of points can be found. The time required for this method is (N2). We call this method direct method. The pseudo code of divide and conquer algorithm is given in figure 14-13. The algorithm for small problems by direct method, and for large problems first divide it into two smaller problems, one problem (called A) the size of n /2 is connected, another problem (called B) the size of the /2 is connected to n. Initially, the closest pair of points may belong to one of the following three cases: 1 in both A (i.e., nearest point to A); 2 in B; 3) one at A, one in B. Assuming that the nearest pair is determined according to the three cases, the closest point pair is the smallest pair of points in all three cases. In the first case, the A can be recursively solved, and in the second case the B can be recursively solved. If (n smaller) {direct method for nearest point pair R, e, t, u, R, N;} N / large Divide a point set into two roughly equal parts, A and B Determine the closest point pair in A and B Determine the closest point in A and another point in B From the three pairs of points obtained above, find the smallest pair of points Figure 14-13 looks for the closest point pair To de