This split process is very similar to the clustering algorithms such as Kmeans. Given the number of ideal groups, we want to know which group every triangle belongs to.

In addition, the importance of each triangle can be represented by its area. Then we select the center of each cluster and calculated the weighted distance from each triangle center(or boundary) to the center of this group.

Other clustering algorithms may work as well.