| 一个快速有效的凹多边形分解算法 |
| |
| 引用本文： | 孙岩,唐棣. 一个快速有效的凹多边形分解算法[J]. 计算机工程与设计, 2001, 22(5): 82-85 |
| |
| 作者姓名： | 孙岩 唐棣 |
| |
| 作者单位： | 辽宁师范大学计算机科学系 |
| |
| 摘 要： | 文中在简述了传统的矢量法分解凹多边形算法之后，提出了一个快速有效的凹多边形分解算法，该算法避免了矢量法所需的大量，复杂的求交计算，因此该算法在时间及计算复杂性方面远远优于矢量法，而且该算法在三维环境中同样适用，该算法除了在多边形裁剪中有广泛的应用外，在多面体的消隐中也经常用到，并用Visual C 语言实现。
|
| 关 键 词： | 计算机图形学 裁剪 凹多边形 凸多边形 算法 |
| 文章编号： | 1000-7024(2001)05-0082-04 |
A rapid and valid algorithm for decomposing concave polygon |
| |
| SUN Yan,TANG Di. A rapid and valid algorithm for decomposing concave polygon[J]. Computer Engineering and Design, 2001, 22(5): 82-85 |
| |
| Authors: | SUN Yan TANG Di |
| |
| Abstract: | After depicting traditional decomposing algorithm for concave polygon, put forward a rapid and valid decomposing algorithm for concave polygon. The algorithm avoid a plenty of complicated calculation of seek intersection. Therefore, the algorithm excel in traditional algorithm in time and calculation complexity. The algorithm apply to three-dimensions. This does not only apply to concave polygon but also apply to pol- yhedrn's eliminant. And implement in Visual C language. |
| |
| Keywords: | computer graphics clipping concave polygon convex polygon vector |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
