Abstract: Based on buffer analysis of polygon, a simple and efficient polygon clustering method is proposed. In the approach, firstly, a polygon is taken from feature dataset as a core polygon and the buffer of the entity is drawn according to the specified radius. In addition, it should obtain the features which are reachable or connectable to core polygon through searching the adjacent area. Finally, the polygons are clustered together by judging whether the reachable and connectable entities meet the demand of clustering. The feasibility of the method is shown in the experimental results and the clustering efficiency is analyzed by comparison.

Key words: clustering of polygon, buffer, connectable, directly reachable, indirectly reachable, core polygon

摘要： 基于缓冲区分析发展了一种简洁、高效的面要素聚类方法。从面要素集中取出一个要素作为核要素，根据给定的半径绘制面缓冲区；根据缓冲区递归搜索邻近区域得到核要素的所有可达和相连要素；判断可达和相连要素是否满足聚类需求来确定是否将其聚为一类。通过实验证明了方法的可行性，并通过对比分析了方法的聚类效率。

关键词: 面要素聚类, 缓冲区, 相连, 直接可达, 间接可达, 核要素