填色线与圆弧有效交点的快速算法

A fast algorithm of solving for the valid cross point of line and arc in filling-polygon

在计算机绘图中经常遇见直线、圆和圆弧之间相交问题。求交算法是多边形填色的一项重要基础内容。文中讨论了填色线与圆弧有效交点的计算问题，提出了一种快速算法。

The problem of solving for cross- points of lines,circles and arcs often arises in the field of computer graphics.The algorithm of solving for cross-points is an essential part of filling-polygon.This paper gives a fast algorithm of solving for the valid cross-points of line and a arc in filling-polygon.