Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. Baran, I. & Demaine, E. D. In Proceedings of Symposium on Computational Geometry (SoCG), pages 220-229, 2004.
Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve [link]Paper  bibtex   
@inproceedings{ dblp3723364,
  title = {Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve},
  author = {Ilya Baran and Erik D. Demaine},
  author_short = {Baran, I. and Demaine, E. D.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2004},
  key = {dblp3723364},
  id = {dblp3723364},
  biburl = {http://www.dblp.org/rec/bibtex/conf/compgeom/BaranD04},
  url = {http://doi.acm.org/10.1145/997817.997852},
  conference = {SoCG},
  pages = {220-229},
  text = {SoCG 2004:220-229},
  booktitle = {Proceedings of Symposium on Computational Geometry (SoCG)}
}

Downloads: 0