Automatic discrete point space curved surface triangulation method

The invention relates to an automatic discrete point space curved surface triangulation method. The method mainly solves the technical problems of complex calculation, data redundancy and the like of existing mesh generation. The method comprises the steps of inputting a data space discrete point set N, recording the coordinate value of each point as p (xi, yi, zi) and the number n of the point sets, and further comprises the following steps of: S1, reading the discrete point set, sorting the point set N according to the sequence of the coordinate values x and y, and recording the sorted point set as N'; S2, projecting the point set on an XOY plane; S3, grouping the discrete point set Nxoy by using a two-dimensional array and determining an adjacent point set; S4, determining a starting edge for grid search; S5, automatically searching the other end point of the triangle according to the starting edge and a leading edge propulsion method; S6, carrying out triangle generation and validity judgment; S7, repeati