Net and prune: a linear time algorithm for euclidean distance problems. Har-Peled, S. & Adam Raichel, B. In Proceedings of Symposium on the Theory of Computing (STOC), pages 605-614, 2013.
Net and prune: a linear time algorithm for euclidean distance problems [link]Paper  bibtex   
@inproceedings{ dblp2398592,
  title = {Net and prune: a linear time algorithm for euclidean distance problems},
  author = {Sariel Har-Peled and Benjamin Adam Raichel},
  author_short = {Har-Peled, S. and Adam Raichel, B.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2013},
  key = {dblp2398592},
  id = {dblp2398592},
  biburl = {http://www.dblp.org/rec/bibtex/conf/stoc/Har-PeledR13},
  url = {http://doi.acm.org/10.1145/2488608.2488684},
  conference = {STOC},
  pages = {605-614},
  text = {STOC 2013:605-614},
  booktitle = {Proceedings of Symposium on the Theory of Computing (STOC)}
}

Downloads: 0