| 裁剪任意多边形的一种新算法 |
| |
| 引用本文： | 温俊文. 裁剪任意多边形的一种新算法[J]. 湛江师范学院学报, 2000, 0(2) |
| |
| 作者姓名： | 温俊文 |
| |
| 作者单位： | 湛江师范学院物理系!广东湛江524048 |
| |
| 摘 要： | 根据Weiler-Atherton的算法思想 ,通过裁剪图形有效边界相交的出入性 ,设计一种算法对任意多边形实行快速有效的内、外裁剪
|
| 关 键 词： | 多边形裁剪 Weiler-Atherton算法 出入性 环形边表 |
A new algorithm of cutting the arbitrary polygon |
| |
| WEN Jun-wen. A new algorithm of cutting the arbitrary polygon[J]. Journal of Zhanjiang Normal College, 2000, 0(2) |
| |
| Authors: | WEN Jun-wen |
| |
| Abstract: | According to Weiler-Atherton's algorithm , the author designs a kind of efficient algorithm and program to cut out the polygon inside and outside by the in-and-out property of an effective boundary's intersection in cutting figures. |
| |
| Keywords: | Cutting polygon Weiler-Atherton's algorithm In-and-out property cyclic-shaped list structure |
| 本文献已被 CNKI 等数据库收录！ |
