一种任意多边形裁剪快速算法  

A QUICK ALGORITHM FOR DISCRETIONARY POLYGON CLIPPING

作　　者：杜月云[1] 周子平[1] 张云龙[2] 

机构地区：[1]商丘职业技术学院计算机系,河南商丘476000 [2]空军第一航空学院基础部,河南信阳464000

出　　处：《计算机应用与软件》2009年第6期265-267,共3页Computer Applications and Software

摘　　要：提出一种用VC++语言实现的多边形裁剪快速算法。与以往的算法相比,算法中不仅多边形可以是任意的,而且在求交、并和差的过程中用符号判断代替耗时的乘法运算,采用预处理方法等技术来减少程序的遍历次数,从而加快了计算速度。算法中用MFC的CObList类和CArray类的对象来动态存储数据,大大节约了内存开销,是一种高效的算法。另外,算法编制的软件,已得到了有效的应用。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 interseeting,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 classes of CObList and CArray of MFC ,which saves a great deal of memory. So the algorithm is really of high effieiency. Moreover,the applieation of software programmed with this algorithm has also gotten effective use.

关 键 词：多边形裁剪 线裁剪 VC++语言 MFC类库 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术] TP311[自动化与计算机技术—计算机科学与技术]