Let P be a set of points in the plane and let D be a set of not necessarily disjoint circular disks. Thus, the circular

[answerhappygod]

Let P be a set of points in the plane and let D be a set of notnecessarily disjoint circular disks.
Thus, the circular disks are allowed to overlap.
Is there also then an algorithm that tests in time O((n +m) log(n + m)) whether the circular disks overlap the points?
Justify your answer.
Consider that there are Ω(m^2) intersections of the circlesbounding the disks.can exist.