摘要
针对任意多边形窗口内圆的裁剪问题,本文提出一种更加全面、有效的裁剪算法.该方法提出借助x-扫描线算法来判断圆和多边形窗口的位置关系,排除圆完全在窗口内或者窗口外的情况;针对多边形窗口和圆相交的情况,按照逆时针方向依次求出多边形各边与圆的交点;最终,通过判断两点间的关系,决定两点之间画线还是画弧,完成圆的裁剪.实验结果表明,该方法能够有效全面的完成多边形窗口的圆裁剪.
For the problem of the circle clipping against arbitrary polygon window, the more comprehensive and effective clipping algorithm is proposed in this study. First, according to x-scan line algorithm, the spatial relationship between the circle and the polygon window is determined. Next, for the case of the polygon window and the circle intersection, the intersect points of the circle and each side of the polygon window are calculated in the counterclockwise direction and sorted correctly. At last, according to the relationship between two points, determining to draw a line or a circle arc. The whole circle clipping is obtained. The result expresses that the algorithm can be comprehensive and effective to complete circle clipping.
作者
杨琴
李宁
王亮亮
YANG Qin;LINing;WANG Liang-Liang(Xinjiang Teacher＇s College, Urumqi 830043, Chin;Mobile Media and Culture Computing Key Laboratory of Beijing, Century College, Beijing University of Posts and Telecommunications, Beijing 102101, China)
出处
《计算机系统应用》
2018年第8期170-175,共6页
Computer Systems & Applications
基金
国家科技支撑课题(2014BAH13F02)~~
关键词
多边形窗口
圆
裁剪
位置关系
polygon window
circle
clipping
spatial relationship
