Abstract
Decomposing simple polygon into simpler components is one of the basic tasks in computational geometry and its applications. The most important simple polygon decomposition is triangulation. Different techniques for triangulating simple polygon were designed. The first part of the paper is an overview of triangulation algorithms based on diagonal inserting. In the second part we present algorithms based on Delaunay triangulation. The basic ideas and approach for each algorithm are presented in this paper. The last part of the paper some representative algorithm by its efficiency are compared.