| 求最大避障圆的一种新算法 |
| |
| 引用本文： | 吴树和. 求最大避障圆的一种新算法[J]. 海军工程大学学报, 1998, 0(3) |
| |
| 作者姓名： | 吴树和 |
| |
| 摘 要： | 分析了在给定圆域Ｄ及Ｄ内的障碍点集Ｖ后，用于生成基本避障圆的几个性质定理．然后由这些定理提出了求最大避障圆的一种新算法．用这种方法可降低计算的复杂性和便于人工作图．
|
| 关 键 词： | 基本避障圆；生成区；生成圆方法 |
A New Algorithm to Look for the Maximum Non Obstruction Circle |
| |
| Wu Shuhe. A New Algorithm to Look for the Maximum Non Obstruction Circle[J]. Journal of Naval University of Engineering, 1998, 0(3) |
| |
| Authors: | Wu Shuhe |
| |
| Abstract: | This paper analyses some properties of the basic non obstruction circles in a circle region D with some obstraction points in it. These properties are used to give a new algorithm to look for the maximum non obstruction circle. The method can reduce the complexity and it is convenient for graphic solution. |
| |
| Keywords: | Basic non obstruction Region of out growth Method of growing circle |
| 本文献已被 CNKI 等数据库收录！ |
