Iterated Nearest Neighbors and Finding Minimal Polytopes. Eppstein, D. & Erickson, J. Discrete & Computational Geometry, 11:321--350, 1994.
Iterated Nearest Neighbors and Finding Minimal Polytopes [link]Paper  doi  bibtex   
@article{DBLP:journals/dcg/EppsteinE94,
  author    = {David Eppstein and
               Jeff Erickson},
  title     = {Iterated Nearest Neighbors and Finding Minimal Polytopes},
  journal   = {Discrete {\&} Computational Geometry},
  volume    = {11},
  pages     = {321--350},
  year      = {1994},
  url       = {https://doi.org/10.1007/BF02574012},
  doi       = {10.1007/BF02574012},
  timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dcg/EppsteinE94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0