| 求解2-中心问题的算法 |
| |
| 引用本文： | 周培德.求解2-中心问题的算法[J].兵工学报,2004,25(1):65-68. |
| |
| 作者姓名： | 周培德 |
| |
| 作者单位： | 北京理工大学,北京,100081 |
| |
| 摘 要： | 首先讨论2-中心问题的各种基本情况及其匹对圆的构造方法,然后介绍匹对圆的某些性质,最后叙述求解2-中心问题的算法.算法的思想是覆盖点集的凸壳必然覆盖点集.该算法可以求得两个半径相等而且最小的圆覆盖点集.此外分析了算法复杂性并讨论了正确性,还展示一个实际例子.
|
| 关 键 词： | 计算机科学技术基础学科 2-中心问题 匹对圆 算法 时间复杂性 |
AN ALGORITHM FOR THE TWO-CENTER PROBLEM |
| |
| Zhou Peide.AN ALGORITHM FOR THE TWO-CENTER PROBLEM[J].Acta Armamentarii,2004,25(1):65-68. |
| |
| Authors: | Zhou Peide |
| |
| Abstract: | All kinds of the basic cases of two-center problems and the construction of their matched-pair circles were discussed. Some properties of the matched-pair circle were then introduced, followed by an algorithm for solving the two-center problems. The governing idea is that the convex hulls covering a set of points must cover the set of points.Through the algorithm can be obtained a set of points covered by two equal radii and the smallest circle.Moreover,the complexity of the algorithm was analyzed and its correctness discussed. A practical example was given. |
| |
| Keywords: | basic subject of science and technolgy for computer two-center problem matched-pair circle algorithm time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《兵工学报》浏览原始摘要信息 |
|
点击此处可从《兵工学报》下载全文 |
