Geodesic
Iterated Nearest Neighbors and Finding Minimal Polytopes.
Discrete & computational geometry, Tome 11 (1994) no. 3, pp. 321-350

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

@article{DCG_1994__11_3_131305,
     author = {D. Eppstein and J. Erickson},
     title = {Iterated {Nearest} {Neighbors} and {Finding} {Minimal} {Polytopes.}},
     journal = {Discrete & computational geometry},
     pages = {321--350},
     publisher = {mathdoc},
     volume = {11},
     number = {3},
     year = {1994},
     zbl = {0807.68094},
     url = {http://geodesic.mathdoc.fr/item/DCG_1994__11_3_131305/}
}
TY  - JOUR
AU  - D. Eppstein
AU  - J. Erickson
TI  - Iterated Nearest Neighbors and Finding Minimal Polytopes.
JO  - Discrete & computational geometry
PY  - 1994
SP  - 321
EP  - 350
VL  - 11
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1994__11_3_131305/
ID  - DCG_1994__11_3_131305
ER  - 
%0 Journal Article
%A D. Eppstein
%A J. Erickson
%T Iterated Nearest Neighbors and Finding Minimal Polytopes.
%J Discrete & computational geometry
%D 1994
%P 321-350
%V 11
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1994__11_3_131305/
%F DCG_1994__11_3_131305
D. Eppstein; J. Erickson. Iterated Nearest Neighbors and Finding Minimal Polytopes.. Discrete & computational geometry, Tome 11 (1994) no. 3, pp. 321-350. http://geodesic.mathdoc.fr/item/DCG_1994__11_3_131305/