A large number of widely used algorithms for constructing a Delaunay triangulation are considered. A classification of these algorithms is proposed. Their performance evaluation is given for the average and worst cases. Some peculiarities of their realization are discussed. Four data structures for the representation of triangulation are analyzed. Several procedures for checking the Delaunay condition and for the triangulation merging are described.

• PostScript (in Russian) (1734KB)
• PDF (in Russian) (585йB)



• PostScript. zip (in Russian) (434йB)
• PDF. zip (in Russian) (372йB)