分治算法求解最密对问题的最优分割参数
Optimum Partition Parameter of Divide-and-Conquer Algorithm for Solving Closest-Pair Problem
摘要：
分而治之是一个众所周知的算法程序，用于解决许多类型的问题。在这个过程中，问题被分成两部分，直到问题是平凡可解的。寻找最近对的距离是计算机科学中一个有趣的话题。用分治算法可以解决最近邻问题。这里也将问题分为两部分，直到问题是平凡可解的。但是，理论和实践观察到，有时将问题空间划分为两个以上的部分可以得到更好的性能。本文提出了一种新的方法，即在用分治算法求解最近点对问题时，将问题空间分成n个部分，可以得到更好的结果。
英文摘要：
Divide and Conquer is a well known algorithmic procedure for solving many kinds of problem. In this procedure, the problem is partitioned into two parts until the problem is trivially solvable. Finding the distance of the closest pair is an interesting topic in computer science. With divide and conquer algorithm we can solve closest pair problem. Here also the problem is partitioned into two parts until the problem is trivially solvable. But it is theoretically and practically observed that sometimes partitioning the problem space into more than two parts can give better performances. In this paper, a new proposal is given that dividing the problem space into (n) number of parts can give better result while divide and conquer algorithm is used for solving the closest pair of point's problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
