The Large-scale Node Cutting Based on Triangle Dissection

The large-scale node should be cut before it is inserted in geographical information system application. In order to guarantee that the node after cutting has a better geometric shape, the concept of P degree is presented in this paper. The definition and lemma related to the concept of P degree are discussed and proved. The Delaunay triangulation cutting strategy and the minimum weight convex polygon triangulation cutting strategy are proposed. The idea that the geometric figure´s P degree is controlled by the perimeter is presented. Two cutting strategies are contrasted and analysed.