Title :
Algorithms for computation of relative neighbourhood graph
Author_Institution :
University of Glasgow, Department of Electronics & Electrical Engineering, Glasgow, UK
Abstract :
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.
Keywords :
graph theory; pattern recognition; Euclidean distance; algorithms; data points; pattern recognition; relative neighbourhood graph; two dimensional data;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19800386
