| 判定凸多边形可移动性算法的推广 |
| |
| 引用本文： | 杜玉越. 判定凸多边形可移动性算法的推广[J]. 聊城大学学报(自然科学版), 1997, 0(1) |
| |
| 作者姓名： | 杜玉越 |
| |
| 摘 要： | 文［１］研究了两个凸多边形可移动性问题的最优判定算法，讨论了简单多边形Ｐ和凸多边形Ｑ的可移动性问题。提出了一种与［１］具有相同时间复杂度的最优算法。
|
| 关 键 词： | 凸多边形，简单多边形，可移动性，复杂度 |
A IMPROVED AIGORITHM ONDECIDING MOVABLE DIRECTIONS OF CONVEX POLYGONS |
| |
| Du Yuyue C. A IMPROVED AIGORITHM ONDECIDING MOVABLE DIRECTIONS OF CONVEX POLYGONS[J]. JOURNAL OF LIAOCHENG UNIVERSITY (NATURAL SCIENCE, 1997, 0(1) |
| |
| Authors: | Du Yuyue C |
| |
| Affiliation: | Du Yuyue CDepartment of Computer Science |
| |
| Abstract: | The optimal algorthm on deciding movable dlrections of convex polygone is studiedin[1] . The paper diecusses all movable directions of a polygon and a convex polygon andlescribes a optimal algorithm with the same same time-complexity as[1]. |
| |
| Keywords: | Convex polygon Polygon Movable direction Complexity |
| 本文献已被 CNKI 等数据库收录！ |
