@article{journals/prl/MitraC98,
  added-at = {2020-02-22T00:00:00.000+0100},
  author = {Mitra, P. and Chaudhuri, B. B.},
  biburl = {https://www.bibsonomy.org/bibtex/2a9d5c5a14b6c8f24c4af04ade0e7b41f/dblp},
  ee = {https://doi.org/10.1016/S0167-8655(98)00080-4},
  interhash = {5be1fbecbc01fed97d7ce5b4c0bbc8f3},
  intrahash = {a9d5c5a14b6c8f24c4af04ade0e7b41f},
  journal = {Pattern Recognit. Lett.},
  keywords = {dblp},
  number = 11,
  pages = {1027-1035},
  timestamp = {2020-02-25T12:24:30.000+0100},
  title = {Efficiently computing the closest point to a query line.},
  url = {http://dblp.uni-trier.de/db/journals/prl/prl19.html#MitraC98},
  volume = 19,
  year = 1998
}

{"_id":"gJtpWQCjf8sCTYa7N","bibbaseid":"mitra-chaudhuri-efficientlycomputingtheclosestpointtoaqueryline-1998","author_short":["Mitra, P.","Chaudhuri, B. B."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-02-22T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Mitra"],"firstnames":["P."],"suffixes":[]},{"propositions":[],"lastnames":["Chaudhuri"],"firstnames":["B.","B."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2a9d5c5a14b6c8f24c4af04ade0e7b41f/dblp","ee":"https://doi.org/10.1016/S0167-8655(98)00080-4","interhash":"5be1fbecbc01fed97d7ce5b4c0bbc8f3","intrahash":"a9d5c5a14b6c8f24c4af04ade0e7b41f","journal":"Pattern Recognit. Lett.","keywords":"dblp","number":"11","pages":"1027-1035","timestamp":"2020-02-25T12:24:30.000+0100","title":"Efficiently computing the closest point to a query line.","url":"http://dblp.uni-trier.de/db/journals/prl/prl19.html#MitraC98","volume":"19","year":"1998","bibtex":"@article{journals/prl/MitraC98,\n added-at = {2020-02-22T00:00:00.000+0100},\n author = {Mitra, P. and Chaudhuri, B. B.},\n biburl = {https://www.bibsonomy.org/bibtex/2a9d5c5a14b6c8f24c4af04ade0e7b41f/dblp},\n ee = {https://doi.org/10.1016/S0167-8655(98)00080-4},\n interhash = {5be1fbecbc01fed97d7ce5b4c0bbc8f3},\n intrahash = {a9d5c5a14b6c8f24c4af04ade0e7b41f},\n journal = {Pattern Recognit. Lett.},\n keywords = {dblp},\n number = 11,\n pages = {1027-1035},\n timestamp = {2020-02-25T12:24:30.000+0100},\n title = {Efficiently computing the closest point to a query line.},\n url = {http://dblp.uni-trier.de/db/journals/prl/prl19.html#MitraC98},\n volume = 19,\n year = 1998\n}\n\n","author_short":["Mitra, P.","Chaudhuri, B. B."],"key":"journals/prl/MitraC98","id":"journals/prl/MitraC98","bibbaseid":"mitra-chaudhuri-efficientlycomputingtheclosestpointtoaqueryline-1998","role":"author","urls":{"Link":"https://doi.org/10.1016/S0167-8655(98)00080-4","Paper":"http://dblp.uni-trier.de/db/journals/prl/prl19.html#MitraC98"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Chaudhuri?items=1000","dataSources":["xHWpCrSGkLBjtz7P2"],"keywords":["dblp"],"search_terms":["efficiently","computing","closest","point","query","line","mitra","chaudhuri"],"title":"Efficiently computing the closest point to a query line.","year":1998}