Hi!

Does anyone know an algorithm to get intersection point(s) of two arcs (not

circles)?

Thank you.

Hi!

Does anyone know an algorithm to get intersection point(s) of two arcs (not

circles)?

Thank you.

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.

> Hi!

> Does anyone know an algorithm to get intersection point(s) of two arcs (not

> circles)?

> Thank you.

-----------------------------------------------------------

Karl Heinz Buchegger

Easy way (not for better performance) is scan convert the Arcs into

polylines (if you can found the scan converting circle algorithm can apply

to the arc too with start and end angles) and calculate intersections lines.

Fabio

1. Q: Line+Arc, Arc+Arc intersection [2D]

Greetings,

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.

Thanks,

-Jon

2. POSITION AVAILABLE: 3D Graphic Artist - Multimedia Start-up, LI, NY

3. Arc segment and Arc Segment intersection

5. fast arc/line arc/arc intersects

6. Menu Speed

7. Subdivide 3D Bezier arc in circle arcs

8. VP Graphics (File Conversion)

9. Alogrithm Needed: arc tangent to a line and arc

11. Line intersection with an arc

12. line/arc region intersection test

4 post • Page:**1** of **1**