Iterated Nearest Neighbors and Finding Minimal Polytopes.
Eppstein, D. ; Erickson, J.
Discrete & computational geometry, Tome 11 (1994), p. 321-350 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1994-01-01
EUDML-ID : urn:eudml:doc:131305 
@article{GDZPPN000366528,
     title = {Iterated Nearest Neighbors and Finding Minimal Polytopes.},
     journal = {Discrete \& computational geometry},
     volume = {11},
     year = {1994},
     pages = {321-350},
     zbl = {0807.68094},
     url = {http://dml.mathdoc.fr/item/GDZPPN000366528}
}

Eppstein, D.; Erickson, J. Iterated Nearest Neighbors and Finding Minimal Polytopes.. Discrete & computational geometry, Tome 11 (1994) pp. 321-350. http://gdmltest.u-ga.fr/item/GDZPPN000366528/