Abstract: An algorithm of triangulation is proposed based on monotone polygon , which
can contain more inner holes. The horizontal(vertical) sectioning lines on the local extreme
vertices of boundary in direction of y(x) are made, which can divide the polygon into single
connected y(x)-monotone polygons, and then triangulate the monotone polygons. The algorithm
considers various singular geometric conditions, therefore is a stable one.

Key words: sectioning line, monotone polygon, triangulation, singular condition