Geodesic
Algorithms for constructing triangulations with constraints
Numerical methods and programming, Tome 3 (2002) no. 1, pp. 82-92.

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider the problem of constructing triangulations with constraints and discuss a number of the corresponding algorithms. The problem of computing stability of these algorithms is studied. A stable modification of the algorithm for constructing a Delaunay triangulation with constraints is proposed.
Mots-clés : triangulation, data structure
Keywords: computational geometry, computer graphycs, grid construction, numerical stability. 
@article{VMP_2002_3_1_a4,
     author = {A. V. Skvortsov},
     title = {Algorithms for constructing triangulations with constraints},
     journal = {Numerical methods and programming},
     pages = {82--92},
     publisher = {mathdoc},
     volume = {3},
     number = {1},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a4/}
}
TY  - JOUR
AU  - A. V. Skvortsov
TI  - Algorithms for constructing triangulations with constraints
JO  - Numerical methods and programming
PY  - 2002
SP  - 82
EP  - 92
VL  - 3
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a4/
LA  - ru
ID  - VMP_2002_3_1_a4
ER  - 
%0 Journal Article
%A A. V. Skvortsov
%T Algorithms for constructing triangulations with constraints
%J Numerical methods and programming
%D 2002
%P 82-92
%V 3
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a4/
%G ru
%F VMP_2002_3_1_a4
A. V. Skvortsov. Algorithms for constructing triangulations with constraints. Numerical methods and programming, Tome 3 (2002) no. 1, pp. 82-92. http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a4/