Does anyone know an algorithm to get intersection point(s) of two arcs (not
Funny thing, just implemented this into one of
my programs. I did it the following way:
Every arc is stored with a start and end angle and
I know that end > start at all times (so an arc from
280 to 10 will be stored as 280 to 370. internally
they are in radians of course).
I calculate the intersection points as if the arcs were circles
and finally check, if the angle of the intersection point
is within the desired intervall.
> Does anyone know an algorithm to get intersection point(s) of two arcs (not
> Thank you.
I'm looking for pointers (URLs, papers, interpretive dance) to robust 2D
line-arc and arc-arc intersections algorithms. They need to be able to
find both points of intersection.
6. Menu Speed