多边形裁剪算法c语言,一个有效多边形裁剪算法.pdf

1000-9825/2003/14(04)0845 ©2003 Journal of Software 软 件 学 报 Vol.14, No.4

一个有效的多边形裁剪算法

1+ 2 2

刘勇奎 , 高 云 , 黄有群

1(大连民族学院 计算机科学与工程系,辽宁 大连 116600)

2 (沈阳工业大学 信息科学与工程学院,辽宁 沈阳 110023)

An Efficient Algorithm for Polygon Clipping

1+ 2 2

LIU Yong-Kui , GAO Yun , HUANG You-Qun

1(Department of Computer Science and Engineering, Dalian Nationalities University, Dalian 116600, China)

2(College of Information Science and Engineering, Shenyang University of Technology, Shenyang 110023, China)

+ Corresponding author: Phn: 86-411-7612616 ext 4442, Fax: 86-411-7612616 ext 4442, E-mail: ykliu@

Received 2001-07-31; Accepted 2001-10-17

Liu YK, Gao Y, Huang YQ. An efficient algorithm for polygon clipping . Journal of Software, 2003,14(4):

845~856.

Abstract: Polygon clipping is more often used than line clipping in practice, so it is the main subject in clipping

research now. An efficient algorithm for polygon clipping which processes general polygons including concave

polygons and polygons with holes inside is presented in this paper. This algorithm can be used to calculate not only

intersection (clipping) but also set-theoretic differences and union of two polygons. It is based on some new

techniques proposed in this paper. Firstly, singly linked lists are used as the data structure of this algorithm rather

than doubly linked lists or trees as other algorithms use, so less memory space and running time are required.

Secondly, the relationship between the entry and exit points on the two polygons is found, which, with the

reasonable operations on the lists, reduces the times that the lists are traversed and allows the polygon to be input

clockwise or counterclockwise. Lastly, findi