ISSN:
1572-9125
Keywords:
F.2.2
;
Computational geometry
;
Divide-and-Conquer algorithm
;
Relative Neighborhood Graph
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02017341