Algorithms for computation of relative neighbourhood graph
RB Urquhart - Electronics Letters, 1980 - IET
RB Urquhart
Electronics Letters, 1980•IETThe definition of the relative neighbourhood graph (rng) of a set of data points is considered
from an alternative viewpoint. This leads to properties of the rng which can be exploited to
give faster algorithms, one of which is restricted to use with two-dimensional data and
Euclidean distance, and the other being more general.
from an alternative viewpoint. This leads to properties of the rng which can be exploited to
give faster algorithms, one of which is restricted to use with two-dimensional data and
Euclidean distance, and the other being more general.
The definition of the relative neighbourhood graph (r.n.g.) of a set of data points is considered from an alternative viewpoint. This leads to properties of the r.n.g. which can be exploited to give faster algorithms, one of which is restricted to use with two-dimensional data and Euclidean distance, and the other being more general.
IET
