Iterated Nearest Neighbors and Finding Minimal Polytopes. Eppstein, D. & Erickson, J. In Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas., pages 64--73, 1993.
Iterated Nearest Neighbors and Finding Minimal Polytopes [link]Paper  bibtex   
@inproceedings{DBLP:conf/soda/EppsteinE93,
  author    = {David Eppstein and
               Jeff Erickson},
  title     = {Iterated Nearest Neighbors and Finding Minimal Polytopes},
  booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
               Algorithms, 25-27 January 1993, Austin, Texas.},
  pages     = {64--73},
  year      = {1993},
  crossref  = {DBLP:conf/soda/1993},
  url       = {http://dl.acm.org/citation.cfm?id=313559.313612},
  timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/EppsteinE93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0