| 任意二维图形的复杂窗口裁剪算法及其应用 |
| |
| 引用本文： | 王沉培 周艳红. 任意二维图形的复杂窗口裁剪算法及其应用[J]. 工程图学学报, 1999, 0(1): 45-50 |
| |
| 作者姓名： | 王沉培 周艳红 |
| |
| 作者单位： | 华中理工大学数控技术研究中心 |
| |
| 基金项目： | 国家“八五”科技攻关专题!85—719—31—01 |
| |
| 摘 要： | 本文提出了一种基于交点全搜索方式的复杂二维图形裁剪算法。该算法通过引入虚边，简化复连通区域为单连通多边形，能够有效地用于多个复连通区域之间的互相裁剪。算法经实际应用证明，具有较高的效率和很好的稳定性。
|
| 关 键 词： | 布尔运算 二维图形 裁剪算法 计算机图形学 |
AN ALGORITHM FOR CLIPPING 2-D GRAPHS WITH COMPLEX WINDOWS |
| |
| Wang Chenpei, Zhou Yanhong ,Zhou Ji. AN ALGORITHM FOR CLIPPING 2-D GRAPHS WITH COMPLEX WINDOWS[J]. Journal of Engineering Graphics, 1999, 0(1): 45-50 |
| |
| Authors: | Wang Chenpei Zhou Yanhong Zhou Ji |
| |
| Affiliation: | Huazhong University of Science and Technology |
| |
| Abstract: | A clipping algorithm for complex 2D graphs based on the robust intersection points seeking method is presented. By introducing virtual edge and simplifying multiple connected do-main to simple connected domain,an effective clipping operation can be completed among several multiple connected domains. Applications show that the algorithm is highly efficient and stable. |
| |
| Keywords: | clipping polygon boolean operation |
| 本文献已被 CNKI 维普 等数据库收录！ |
