| 一种任意多边形裁剪快速算法 |
| |
| 引用本文： | 杜月云,周子平,张云龙.一种任意多边形裁剪快速算法[J].计算机应用与软件,2009,26(6):265-267. |
| |
| 作者姓名： | 杜月云 周子平 张云龙 |
| |
| 作者单位： | 1. 商丘职业技术学院计算机系,河南,商丘,476000
2. 空军第一航空学院基础部,河南,信阳,464000 |
| |
| 摘 要： | 提出一种用VC++语言实现的多边形裁剪快速算法。与以往的算法相比,算法中不仅多边形可以是任意的,而且在求交、并和差的过程中用符号判断代替耗时的乘法运算,采用预处理方法等技术来减少程序的遍历次数,从而加快了计算速度。算法中用MFC的CObList类和CArray类的对象来动态存储数据,大大节约了内存开销,是一种高效的算法。另外,算法编制的软件,已得到了有效的应用。
|
| 关 键 词： | 多边形裁剪 线裁剪 VC++语言 MFC类库 |
A QUICK ALGORITHM FOR DISCRETIONARY POLYGON CLIPPING |
| |
| Du Yueyun,Zhou Ziping,Zhang Yunlong.A QUICK ALGORITHM FOR DISCRETIONARY POLYGON CLIPPING[J].Computer Applications and Software,2009,26(6):265-267. |
| |
| Authors: | Du Yueyun Zhou Ziping Zhang Yunlong |
| |
| Affiliation: | Department of Computer;Shangqiu Vocational and Technical College;Shangqiu 476000;Henan;China;Fundamental Department;The First Aaronautical Institute of Air Force;Xinyang 464000;China |
| |
| Abstract: | A quick algorithm for polygon clipping is proposed in this paper,and realized with the Visual C++ language.Compared with previous methods,in this algorithm the polygon is discretional;and judgment on sign is used to replace the time-consuming multiplying calculations for intersecting,union,and difference of the line segments.The techniques such as pretreatment are adopted for reducing the times of traversal of the program to accelerate calculation speed.The data are stored dynamically with the objects of cl... |
| |
| Keywords: | Polygon clipping Line clipping Visual C++ language MFC class libraries |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
