Computing relative neighbourhood graphs in the plane
The paper presents two new algorithms for constructing the relative neighborhood graph (RNG) in two-dimensional Euclidean space. The method is to determine a supergraph for RNG which can be thinned efficiently from the extra edges.
scientific article; zbMATH DE number 3972240
scientific article