Graph theoretical clustering based on limited neighbourhood sets

  • Urquhart R
  • 33


    Mendeley users who have this article in their library.
  • 133


    Citations of this article.


A method for clustering data according to a visual model of clusters is proposed. The method uses either of two graphs which are defined according to relative distance and based on the Gabriel graph and the relative neighbourhood graph respectively. The method is locally sensitive, hierarchic and based on the concept of limited neighbourhood sets. Clusters that are either disjoint or homogeneous and separable by sharp changes in point density may be detected. © 1982.

Author-supplied keywords

  • Clustering
  • Delaunay triangulation
  • Geometrical complexity
  • Grabriel graph
  • Hierarchic clustering
  • Limited neighbourhood sets
  • Minimal spanning tree
  • Pattern recognition
  • Region of influence
  • Relative neighbourhood graph

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Roderick Urquhart

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free