关键词: 边界点, 聚类, 三角剖分, 变异系数

Abstract: In order to detect boundary points of clusters quickly and efficiently，this paper proposes an algorithm named cluster boundary detecting algorithm based on Delaunay triangulation（DTBOUND）.DTBOUND divides the dataset into internal set and external set by calculating the coefficient of variation of each data point of the triangulation.Then，the depth-first traversal is made from each of the unclassified internal point to put the internal points connected with each other and external points connected with the internal points into a cluster.Finally，boundary points are extracted from the cluster obtained before.There is only one parameter in DTBOUND.Experimental results show that DTBOUND can quickly and effectively identify cluster boundary points and clusters of arbitrary shapes，different sizes and different densities.

Key words: boundary point, clusters, Delaunay triangulation, coefficient of variation