Efficiently computing the exact union of 'N' intersecting circles on a plane
See this earlier MathOverflow question: the union of circles can be constructed (as its set of boundary arcs) in $O(n\log n)$ time. Once you have that, it's straightforward to use Green's theorem to calculate the area.