Geodesic
Delaunay Graphs Are Almost as Good as Complete Graphs.
Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 399-408 Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : Delaunay triangulation, Euclidean distance, shortest path 
@article{DCG_1990__5_2_131128,
     author = {D.P. Dobkin and S.J. Friedman and K.J. Supowit},
     title = {Delaunay {Graphs} {Are} {Almost} as {Good} as {Complete} {Graphs.}},
     journal = {Discrete & computational geometry},
     pages = {399--408},
     year = {1990},
     volume = {5},
     number = {2},
     zbl = {0693.05045},
     url = {http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131128/}
}
TY  - JOUR
AU  - D.P. Dobkin
AU  - S.J. Friedman
AU  - K.J. Supowit
TI  - Delaunay Graphs Are Almost as Good as Complete Graphs.
JO  - Discrete & computational geometry
PY  - 1990
SP  - 399
EP  - 408
VL  - 5
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131128/
ID  - DCG_1990__5_2_131128
ER  - 
%0 Journal Article
%A D.P. Dobkin
%A S.J. Friedman
%A K.J. Supowit
%T Delaunay Graphs Are Almost as Good as Complete Graphs.
%J Discrete & computational geometry
%D 1990
%P 399-408
%V 5
%N 2
%U http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131128/
%F DCG_1990__5_2_131128
D.P. Dobkin; S.J. Friedman; K.J. Supowit. Delaunay Graphs Are Almost as Good as Complete Graphs.. Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 399-408. http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131128/