I have a number of circles of same radius on surface of sphere (Google Maps API). I'm trying to calculate the total area covered by these possibly intersecting circles.
My current solution is stochastic Monte Carlo sampling using 10,000 points (I know how to check if point is inside any circle). It gives me a pretty good approximation, but is really slow.
Is there a more efficient analytic solution?