Midair Proximity

AeroSpace • Euclidean 3D pairs • O(n²) demo

Given aircraft as (id, x, y, z), find all pairs within proximity radius r. Demo uses brute force for small n; at scale use uniform grid / spatial hash (see sibling drill) for ~O(n) local queries.