A visualization of a node proximity detection tool. Given a normalized range of points, from a given point, proceed in sequence through points from nearest to furthest with an alternating radial preference.
In my Travelling Salesman optimization work, I have been rounding and grouping points to their nearest Hamiltonian coordinate at different scales (
1). I then optimize that group's path and need to connect to its nearest group. This is for finding the nearest group. At each point, I would check for the presence of a group and if one exists, I stop, if one doesn't, I would continue the path.