%0 Electronic Article
%A R.B. Urquhart
%K two dimensional data
%K relative neighbourhood graph
%K algorithms
%K pattern recognition
%K Euclidean distance
%K data points
%X 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.
%@ 0013-5194
%T Algorithms for computation of relative neighbourhood graph
%B Electronics Letters
%D July 1980
%V 16
%N 14
%P 556-557
%I Institution of Engineering and Technology
%U https://digital-library.theiet.org/;jsessionid=cjadfh8rlif8c.x-iet-live-01content/journals/10.1049/el_19800386
%G EN