|
|||||
|
|
| 平面最接近点对算法 | |
| 引用本文： | 吴中博. 平面最接近点对算法[J]. 数字社区&智能家居, 2007, 3(8): 828-828,886 |
| 作者姓名： | 吴中博 |
| 作者单位： | 襄樊学院电气信息工程系,湖北襄樊441053 |
| 摘 要： | 描述了平面最接近点对问题,针对这一问题给出了3种算法,循环遍历算法、分治算法和平面扫描算法,并详细分析了3种算法的时间复杂度。 |
| 关 键 词： | 平面最接近点对 循环遍历算法 分治算法 平面扫描算法 |
| 文章编号： | 1009-3044（2007）15-30828-01 |
| 修稿时间： | 2007-07-03 |
Algorithms for Finding the Closest Pair of Points |
|
| WU Zhong-bo. Algorithms for Finding the Closest Pair of Points[J]. Digital Community & Smart Home, 2007, 3(8): 828-828,886 | |
| Authors: | WU Zhong-bo |
| Affiliation: | Department of Electrical and Information Engineering, Xiangfan University, Xiangfan 441053, China |
| Abstract: | In this paper we describe the problem of finding the closet pairs of points in the plane and we use three algorithms to solve this problem including narve algorithm, divide and conquer algorithm and plane sweep algorithm. At last we analyze the efficiency of these algorithms. |
| Keywords: | closest Pair of Points divide-and-conquer algorithm circulation Algorithm plane sweep algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ | |