Geodesic
Classes of Graphs Which Approximate the Complete Euclidean Graph.
Discrete & computational geometry, Tome 7 (1992) no. 4, pp. 13-28.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : euclidean graphs, approximation, Delaunay-triangulation 
@article{DCG_1992__7_4_131177,
     author = {J.M. Keil and C.A. Gutwin},
     title = {Classes of {Graphs} {Which} {Approximate} the {Complete} {Euclidean} {Graph.}},
     journal = {Discrete & computational geometry},
     pages = {13--28},
     publisher = {mathdoc},
     volume = {7},
     number = {4},
     year = {1992},
     zbl = {0751.52004},
     url = {http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131177/}
}
TY  - JOUR
AU  - J.M. Keil
AU  - C.A. Gutwin
TI  - Classes of Graphs Which Approximate the Complete Euclidean Graph.
JO  - Discrete & computational geometry
PY  - 1992
SP  - 13
EP  - 28
VL  - 7
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131177/
ID  - DCG_1992__7_4_131177
ER  - 
%0 Journal Article
%A J.M. Keil
%A C.A. Gutwin
%T Classes of Graphs Which Approximate the Complete Euclidean Graph.
%J Discrete & computational geometry
%D 1992
%P 13-28
%V 7
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131177/
%F DCG_1992__7_4_131177
J.M. Keil; C.A. Gutwin. Classes of Graphs Which Approximate the Complete Euclidean Graph.. Discrete & computational geometry, Tome 7 (1992) no. 4, pp. 13-28. http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131177/