Delaunay simplices pruning based clustering
Résumé
We introduce in this paper a new clustering method using the Delaunay triangulation of a set of points as an input. The proposed method is based on pruning away extra simplices of a triangulation accord- ing to a local heterogeneity measure which we introduce. This measure provides good clustering results as it yields to better inter-cluster simplices detection. Our introduced measure is evaluated on 2-D shape data set.