Nearest nodes to a given point
26 views (last 30 days)
I have a set of randomly distributed nodes ( N ) in a closed domain, a point ( P ) inside this domain and an integer ( m >1 ). The number of nodes in N is sufficiently larger than m.
What is the most efficient way to find the nearest m nodes to the point P from the set N?