Abstract: Presents an algorithm for the triangulation of any polygon. The convexity or concavity of each vertex of the polygon is first determined, then the irregular parts of the polygon are successively cut out forming the whole into a convex polygon, and the triangulation of the convex polygon findlly camed out. The correctness of the algorithm is proved and the complexity of the algorithm analyzed.