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

access icon free Reply: Algorithms for computing relative neighbourhood graph

  • PDF
    291.5810546875Kb

There is no abstract available for this article. Use the preview function.

References

    1. 1)
      • Toussaint, G.T.: `The relative neighbourhood graph of a finite planar set', SOCS 79.7, Tech. Rept., May 1979
    2. 2)
      • Toussaint, G.T.: `The relative neighbourhood graph of a finite planar set', BPRA Conference, January 1980, Oxford, also presented at
    3. 3)
      • The relative neighbourhood graph of a finite planar set
    4. 4)
      • Algorithms for computation of relative neighbourhood graph
    5. 5)
      • SIBSON, R.: private communication
    6. 6)
      • A new statistical approach to geographical variation analysis
    7. 7)
      • Properties of Gabriel graphs relevant to geographical variation research and clustering of points in the plane
    8. 8)
      • Locally equiangular triangulations
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19800612
Loading

Related content

content/journals/10.1049/el_19800612
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Replies
This article contains a Reply to the following content:
Comment: Algorithms for computing relative neighbourhood graph
This is a required field
Please enter a valid email address