| 求多面体锥与凸多面体间的最短距离的一个有限算法 |
| |
| 引用本文： | 李若柔. 求多面体锥与凸多面体间的最短距离的一个有限算法[J]. 广西大学学报(自然科学版), 1987, 0(2) |
| |
| 作者姓名： | 李若柔 |
| |
| 作者单位： | 北京师范学院 |
| |
| 摘 要： | 在文献[1]中,给出了计算多面体锥与凸多面体问的最短距离的一个方法,但不能保证在有限步内求得最短距离。本文给出了一个与文献[1]的条件等价的充要条件,在此基础上提出一个在有限步内求得最短距离的算法。
|
| 关 键 词： | 多面体锥 凸多面体 最短距离的充要条件 有限算法 |
A Finite Algorithm for Finding the Shortest Distance between a Polyhedral Cond and a Convex Polyhedron |
| |
| Li Ruo Rou. A Finite Algorithm for Finding the Shortest Distance between a Polyhedral Cond and a Convex Polyhedron[J]. Journal of Guangxi University(Natural Science Edition), 1987, 0(2) |
| |
| Authors: | Li Ruo Rou |
| |
| Abstract: | A method to calculate the shortest distance between a polyhedral cone and a convex polyhedron is given in[l],however,its finite convergence is not generally guaranteed. This paper presents a necessary and Sufficient condition for the above shortest distance which is equivalent to the one of[l], and by our condition, a finite algorithm for finding the Shortest distance is given. |
| |
| Keywords: | Polyhedral cone Convex polyhedron Necessary and sufficient Condition for the shorstet distance Finite algorithm. |
| 本文献已被 CNKI 等数据库收录！ |
|
