一种有效的任意多边形裁剪算法  

An Efficient Algorithm for Polygon Clipping

作　　者：付迎春[1] 袁修孝[1] 

机构地区：[1]武汉大学遥感信息工程学院,武汉430079

出　　处：《计算机工程》2006年第7期278-280,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2003AA132080)

摘　　要：介绍了一种基于改进的Weiler算法的任意多边形裁剪算法,该算法通过引入图形部件和合理的数据结构来组织裁剪后的多边形,减少了遍历多边形顶点链表的次数,并有效减少求交点的时间,具有占用存储空间少和处理速度快的特点。经过实例测试,算法对同时处理单个和多个任意多边形裁剪具有良好的稳定性、可靠性和较高的效率。This paper introduces an improved algorithm for polygon clipping based on Weiler algorithm, This algorithm reduces the times that the vertex lists are traversed and consumed times of computing intersection point, in which the graphics part and reasonable data structures are used to restructure the result polygons being clipped, so less memory space and running time are required. It is of well performance and efficiency in experiment to process single polygon and some polygons clipping synchronously.

关 键 词：Weiler算法 图形部件 任意多边形裁剪 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]