Given a list of disks on the two-dimensional plane represented as tuples (x, y, r) so that x, y is the center point and r is the radius of that disk, count how many pairs of disks intersect.

Two disks (x1, y1, r1) and (x2, y2, r2) intersect if and only if they satisfy the Pythagorean inequality (x2-x1)**2+(y2-y1)**2<=(r1+r2)**2.

Note how this precise formula runs on pure integer arithmetic whenever its arguments are integers, so no square roots or any other irrational numbers gum up the works with all that decimal noise. (This formula also uses the operator <= to count two kissing disks as an intersecting pair).

For this problem, crudely looping through all possible pairs of disks would work, but also become horrendously inefficient for large lists. However, a sweep line algorithm can solve this problem not just effectively, but also efficiently (a crucial but often overlooked “eff-ing” distinction) by looking at a far fewer pairs of disks.

Here is a scheme for [(0, 0, 3), (6, 0, 3), (6, 6, 3), (0, 6, 3)]:

Input: List of tuples (tuple) of integers (int).

Output: Integer (int).

Examples:

assert overlapping_disks([(0, 0, 3), (6, 0, 3), (6, 6, 3), (0, 6, 3)]) == 4
assert overlapping_disks([(4, -1, 3), (-3, 3, 2), (-3, 4, 2), (3, 1, 4)]) == 2
assert (
    overlapping_disks([(-10, 6, 2), (6, -4, 5), (6, 3, 5), (-9, -8, 1), (1, -5, 3)])
    == 2
)
assert (
    overlapping_disks(
 ...