对数据进行聚类，方便进行下一步的计算，如20个数，分为四类，就会根据其数字特性按照最小二乘进行分类，并计算出质心-Clustering of the data to facilitate the next step of the calculation, such as the number 20 is divided into four categories according to their number of properties will be classified according

k-means 算法 step1 初始化K个质心 step2 将所有的点分配给最近的质心 step3 更新质心 step4 若质心都没用变化,则停止,否则返回step2 -k-means algorithm is initialized step1 step2 K a center of mass of all the points assigned to the nearest centroid centroid step3 step4 update no us

This code convert polygon to point then return centroid of polygon

基改进的K-means聚类算法对已知初始聚类中心，对质心点进行求解，并考虑到不同点的权重问题。-Base Improved K-means clustering algorithm known initial cluster centers, centroid point is solved, taking into account the different points of the right to re-issue.