I have three circles positioned shown in the fig. Each of them has the same radius. I know the distance between each of them (A-B, B-C, A-C). My goal is to find the shortest path between B and C. The Path must always be in the range of any of the circle.(red line).
Math guys help.
I dont understand if you need some general algorithm (Then you need to check which one is intersecting which one... or not, or if you have more intersections, etc...) or just a solution for this specific case.
For this case, it seems quite simple :
Compute intersections between circle A and circle B : it gives two points. Keep the one nearset to circle C (let's say I1).
Do the same for A and C, and keep nearest solution to circle B : I2.
Distance between I1 and I2 gives you the last portion of the red line you don't know.