A Clipping Algorithm on Vector Graphics Based on Non-intersect Polygon Boundary
Graphic clipping algorithm is a hotspot all the time in computer graphics.Based upon non-intersect polygon boundary,a clipping algorithm on vector graphics is proposed in this paper.The proposed algorithm can be divided into three steps.First,eliminating the boundary which has no intersection with vector graphics and calculating effective intersections;second,dividing graphics into several parts;finally,determining whether each part within boundaries and achieving graphic clipping.Besides,it can be demonstrated by experiments that compared with traditional algorithm,the proposed algorithm is clear,simple,effective and can be applied widely.Furthermore,the proposed algorithm only consumes about 7 seconds in millions of data and the memory consumption nearly unchanged.
vector graphics clipping algorithm non-intersect polygon linear clipping circular clipping
Dingding Yang Shiqiang Chen Qingwen Yang Yue Hu
School of Science,Hubei University for Nationalities Enshi 445000,P.R.China
国际会议
重庆
英文
854-859
2016-03-20（万方平台首次上网日期，不代表论文的发表时间）