Circle Clipping by Arbitrary Polygon Window Based on Intersection Point Parametric Method
Author:
Affiliation:

Fund Project:

• 摘要
• |
• 图/表
• |
• 访问统计
• |
• 参考文献
• |
• 相似文献
• |
• 引证文献
• |
• 增强出版
• |
• 文章评论
摘要:

现有的任意多边形窗口的圆裁剪算法存在算法繁琐等问题, 且没有考虑多边形是带内环的情况, 本文提出了一种基于交点参数分析的多边形窗口的圆裁剪算法, 只需对多边形边与圆的交点在边所在直线的参数值进行比较, 即可判断出交点的进出点特性, 交点排序后, 通过进点=>出点组合, 即可获得裁剪窗口内的圆弧, 完成裁剪. 编程实践的实例结果也证明本算法是切实可行的, 本文的方法既适用于仅有外环的一般多边形裁剪窗口, 也适用于带内环的任意多边形裁剪窗口的圆裁剪, 因此, 算法更具有通用性.

Abstract:

The existing algorithms of circle clipping against an arbitrary polygon window suffers from complex steps and do not consider the case where the polygon contains an inner ring. Thus, this study presents a new algorithm based on the parameter analysis of intersection points for circle clipping against an arbitrary polygon window. In this algorithm, only by comparing the parameter values of the intersection points on the directional line of the edge, one can classify the intersection points into entry points and exit points. After the intersection points are sorted out, the arcs within the clipping window can be obtained with the combinations of “entry point => exit point.” The proposed algorithm is proved feasible by programming results and is universal to circle clipping against an arbitrary polygon window, even if the polygon contains an inner ring.

参考文献
相似文献
引证文献

• 点击次数:
• 下载次数:
• HTML阅读次数:
##### 历史
• 收稿日期:2021-10-28
• 最后修改日期:2021-12-02
• 录用日期:
• 在线发布日期: 2022-06-16
• 出版日期: