@article{ dblp3281194,
  title = {Efficient Algorithms for Approximating Polygonal Chains},
  author = {Pankaj K. Agarwal and Kasturi R. Varadarajan},
  author_short = {Agarwal, P. K. and Varadarajan, K. R.},
  bibtype = {article},
  type = {article},
  year = {2000},
  key = {dblp3281194},
  id = {dblp3281194},
  biburl = {http://www.dblp.org/rec/bibtex/journals/dcg/AgarwalV00},
  url = {http://dx.doi.org/10.1007/PL00009500},
  journal = {Discrete & Computational Geometry (DCG)},
  pages = {273-291},
  number = {2},
  volume = {23},
  text = {Discrete & Computational Geometry (DCG) 23(2):273-291 (2000)}
}

{"_id":{"_str":"529bbc0f9eb585cc26000f76"},"__v":0,"authorIDs":[],"author_short":["Agarwal, P. K.","Varadarajan, K. R."],"bibbaseid":"agarwal-varadarajan-efficientalgorithmsforapproximatingpolygonalchains-2000","bibdata":{"html":"<div class=\"bibbase_paper\"> \n\n\n<span class=\"bibbase_paper_titleauthoryear\">\n\t<span class=\"bibbase_paper_title\"><a name=\"dblp3281194\"> </a>Efficient Algorithms for Approximating Polygonal Chains.</span>\n\t<span class=\"bibbase_paper_author\">\nAgarwal, P. K.; and Varadarajan, K. R.</span>\n\t<!-- <span class=\"bibbase_paper_year\">2000</span>. -->\n</span>\n\n\n\n<i>Discrete &amp; Computational Geometry (DCG)</i>,\n\n23(2):273-291.\n\n 2000.\n\n\n\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content\">\n \n \n <!-- <i -->\n <!-- onclick=\"javascript:log_download('agarwal-varadarajan-efficientalgorithmsforapproximatingpolygonalchains-2000', 'http://dx.doi.org/10.1007/PL00009500')\">DEBUG -->\n <!-- </i> -->\n\n <a href=\"http://dx.doi.org/10.1007/PL00009500\"\n onclick=\"javascript:log_download('agarwal-varadarajan-efficientalgorithmsforapproximatingpolygonalchains-2000', 'http://dx.doi.org/10.1007/PL00009500')\">\n <img src=\"http://bibbase.org/img/filetypes/blank.png\"\n\t alt=\"Efficient Algorithms for Approximating Polygonal Chains [.1007/PL00009500]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\" ><span class=\"bibbase_icon_text\">Paper</span></a> \n &nbsp;\n \n \n <a href=\"javascript:showBib('dblp3281194')\"\n class=\"bibbase link\">\n <!-- <img src=\"http://bibbase.org/img/filetypes/bib.png\" -->\n\t<!-- alt=\"Efficient Algorithms for Approximating Polygonal Chains [bib]\" -->\n\t<!-- class=\"bibbase_icon\" -->\n\t<!-- style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\"><span class=\"bibbase_icon_text\">Bibtex</span> -->\n BibTeX\n <i class=\"fa fa-caret-down\"></i></a>\n \n \n \n \n\n \n \n \n</span>\n\n<div class=\"well well-small bibbase\" id=\"bib_dblp3281194\"\n style=\"display:none\">\n <pre>@article{ dblp3281194,\n title = {Efficient Algorithms for Approximating Polygonal Chains},\n author = {Pankaj K. Agarwal and Kasturi R. Varadarajan},\n author_short = {Agarwal, P. K. and Varadarajan, K. R.},\n bibtype = {article},\n type = {article},\n year = {2000},\n key = {dblp3281194},\n id = {dblp3281194},\n biburl = {http://www.dblp.org/rec/bibtex/journals/dcg/AgarwalV00},\n url = {http://dx.doi.org/10.1007/PL00009500},\n journal = {Discrete &amp; Computational Geometry (DCG)},\n pages = {273-291},\n number = {2},\n volume = {23},\n text = {Discrete &amp; Computational Geometry (DCG) 23(2):273-291 (2000)}\n}</pre>\n</div>\n\n\n\n</div>\n","downloads":0,"bibbaseid":"agarwal-varadarajan-efficientalgorithmsforapproximatingpolygonalchains-2000","urls":{"Paper":"http://dx.doi.org/10.1007/PL00009500"},"role":"author","bibtex":"@article{ dblp3281194,\n title = {Efficient Algorithms for Approximating Polygonal Chains},\n author = {Pankaj K. Agarwal and Kasturi R. Varadarajan},\n author_short = {Agarwal, P. K. and Varadarajan, K. R.},\n bibtype = {article},\n type = {article},\n year = {2000},\n key = {dblp3281194},\n id = {dblp3281194},\n biburl = {http://www.dblp.org/rec/bibtex/journals/dcg/AgarwalV00},\n url = {http://dx.doi.org/10.1007/PL00009500},\n journal = {Discrete &amp; Computational Geometry (DCG)},\n pages = {273-291},\n number = {2},\n volume = {23},\n text = {Discrete &amp; Computational Geometry (DCG) 23(2):273-291 (2000)}\n}","text":"Discrete &amp; Computational Geometry (DCG) 23(2):273-291 (2000)","volume":"23","number":"2","pages":"273-291","journal":"Discrete &amp; Computational Geometry (DCG)","url":"http://dx.doi.org/10.1007/PL00009500","biburl":"http://www.dblp.org/rec/bibtex/journals/dcg/AgarwalV00","id":"dblp3281194","key":"dblp3281194","year":"2000","type":"article","bibtype":"article","author_short":["Agarwal, P. K.","Varadarajan, K. R."],"author":["Pankaj K. Agarwal","Kasturi R. Varadarajan"],"title":"Efficient Algorithms for Approximating Polygonal Chains"},"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/dcg/AgarwalV00","downloads":0,"search_terms":["efficient","algorithms","approximating","polygonal","chains","agarwal","varadarajan"],"title":"Efficient Algorithms for Approximating Polygonal Chains","year":2000,"dataSources":["enj3yJRvf7qx3FiLk"]}