Abstract
AnO(n logn) divide-and-conquer algorithm for finding the relative neighborhood graph RNG(V) of a set V ofn points in Euclidean space is presented. If implemented in parallel, its time complexity isO(n) and it requiresO(logn) processors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have