http://iet.metastore.ingenta.com
1887

Algorithms for computation of relative neighbourhood graph

Algorithms for computation of relative neighbourhood graph

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

References

    1. 1)
      • Toussaint, G.T.: `The relative neighbourhood graph of a finite planar set', SOCS 79.7, Technical Report, .
    2. 2)
      • Toussaint, G.T.: `The relative neighbourhood graph of a finite planar set', BPRA Conference, 1980, Oxford.
    3. 3)
      • C. Zahn . Graph-theoretical methods for detecting and describing Gestalt clusters. IEEE Trans.
    4. 4)
      • P.M. Lankford . Regionalization: theory and alternative algorithms. Geographical Analysis
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19800386
Loading

Related content

content/journals/10.1049/el_19800386
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Correspondence
This article has following corresponding article(s):
Comment: Algorithms for computing relative neighbourhood graph
This is a required field
Please enter a valid email address