In Proceedings Conf. S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons . Fast Triangulation of Simple Polygons . Theory, volume 158 of Lecture Notes Comput.
P is assumed to have been decomposed into a collection of convex polygons.
Fast triangulation of simple polygons . Hertel, S., Mehlhorn, K. Fast triangulation of a simple polygon , Proc. The process is then repeated with another leaf if any. The algorithm is linear in the number of vertices of the initial polygon. Table 1 gives some statistics on the convex partitioning of the polygons of the GO collection.