Let $S$ be a set of $n$ circles in the plane. I need to describe a algorithm which computes all the intersection points of the circles. The algorithm should run in $O((n + k)\log n)$ time, where $k$ is the number of intersection points.
I was thinking about some sort of a variant to the bentley ottmann algorithm to count the intersections of $n$ segments, But this never got me anywhere.
Ive seen this topic: Circle Intersection with Sweep Line Algorithm But the "Swap" Part is missing here.
Any help will be very appericiated :)
