Graph theoretical clustering based on limited neighbourhood sets
- 1 January 1982
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 15 (3) , 173-187
- https://doi.org/10.1016/0031-3203(82)90069-3
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Algorithms for computation of relative neighbourhood graphElectronics Letters, 1980
- Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the PlaneGeographical Analysis, 1980
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Locally equiangular triangulationsThe Computer Journal, 1978
- Agglomerative clustering using the concept of mutual nearest neighbourhoodPattern Recognition, 1978
- Clustering techniques: The user's dilemmaPattern Recognition, 1976
- A Computational View of PerceptionPerception, 1973
- Admissible clustering proceduresBiometrika, 1971
- Regionalization: Theory and Alternative AlgorithmsGeographical Analysis, 1969