Geodesic
A survey of algorithms for constructing a Delaunay triangulation
Numerical methods and programming, Tome 3 (2002) no. 1, pp. 14-39 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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.
Mots-clés : triangulation, data structure.
Keywords: computational geometry, computer graphics, grid construction 
@article{VMP_2002_3_1_a1,
     author = {A. V. Skvortsov},
     title = {A survey of algorithms for constructing a {Delaunay} triangulation},
     journal = {Numerical methods and programming},
     pages = {14--39},
     year = {2002},
     volume = {3},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a1/}
}
TY  - JOUR
AU  - A. V. Skvortsov
TI  - A survey of algorithms for constructing a Delaunay triangulation
JO  - Numerical methods and programming
PY  - 2002
SP  - 14
EP  - 39
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a1/
LA  - ru
ID  - VMP_2002_3_1_a1
ER  - 
%0 Journal Article
%A A. V. Skvortsov
%T A survey of algorithms for constructing a Delaunay triangulation
%J Numerical methods and programming
%D 2002
%P 14-39
%V 3
%N 1
%U http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a1/
%G ru
%F VMP_2002_3_1_a1
A. V. Skvortsov. A survey of algorithms for constructing a Delaunay triangulation. Numerical methods and programming, Tome 3 (2002) no. 1, pp. 14-39. http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a1/