Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. Har-Peled, S. & Raichel, B. CoRR, 2014.
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems [link]Paper  bibtex   
@article{ dblp1981748,
  title = {Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems},
  author = {Sariel Har-Peled and Benjamin Raichel},
  author_short = {Har-Peled, S. and Raichel, B.},
  bibtype = {article},
  type = {article},
  year = {2014},
  key = {dblp1981748},
  id = {dblp1981748},
  biburl = {http://www.dblp.org/rec/bibtex/journals/corr/Har-PeledR14b},
  url = {http://arxiv.org/abs/1409.7425},
  journal = {CoRR},
  volume = {abs/1409.7425},
  text = {CoRR abs/1409.7425 (2014)}
}

Downloads: 0