@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)}
}

{"_id":"k9ATzgkFEqZzNEFeB","bibbaseid":"baran-demaine-optimaladaptivealgorithmsforfindingthenearestandfarthestpointonaparametricblackboxcurve-2004","downloads":0,"creationDate":"2015-06-13T03:01:22.492Z","title":"Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve","author_short":["Baran, I.","Demaine, E. D."],"year":2004,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/compgeom/BaranD04","bibdata":{"title":"Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve","author":["Ilya Baran","Erik D. Demaine"],"author_short":["Baran, I.","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)","bibtex":"@inproceedings{ dblp3723364,\n title = {Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve},\n author = {Ilya Baran and Erik D. Demaine},\n author_short = {Baran, I. and Demaine, E. D.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2004},\n key = {dblp3723364},\n id = {dblp3723364},\n biburl = {http://www.dblp.org/rec/bibtex/conf/compgeom/BaranD04},\n url = {http://doi.acm.org/10.1145/997817.997852},\n conference = {SoCG},\n pages = {220-229},\n text = {SoCG 2004:220-229},\n booktitle = {Proceedings of Symposium on Computational Geometry (SoCG)}\n}","bibbaseid":"baran-demaine-optimaladaptivealgorithmsforfindingthenearestandfarthestpointonaparametricblackboxcurve-2004","role":"author","urls":{"Paper":"http://doi.acm.org/10.1145/997817.997852"},"downloads":0},"search_terms":["optimal","adaptive","algorithms","finding","nearest","farthest","point","parametric","black","box","curve","baran","demaine"],"keywords":[],"authorIDs":["557ac9564e99777d36000593"],"dataSources":["yF8F8DTQGAa3ShBCx"]}