Collisions on a plane In the collision problem we have a given set of circles with a radius of 1; the circles are described by their centers. The task is to find all pairs of circles that intersect....

Collisions on a plane
In the collision problem we have a given set of circles with a radius of 1; the circles are described by their centers. The task is to find all pairs of circles that intersect.
The goal of the project is to solve the problem of collision in time O (n log n + d), where n is the number of circles and d is the number of intersecting pairs of circles. The task can be performed by modifying the standard algorithm based on the principle of divide and conquer, which finds a pair of the least distant points on the plane.