{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:19:26Z","timestamp":1648621166822},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1007\/bf01408289","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T23:59:02Z","timestamp":1112486342000},"page":"109-121","source":"Crossref","is-referenced-by-count":2,"title":["Parallel algorithms for separation of two sets of points and recognition of digital convex polygons"],"prefix":"10.1007","volume":"21","author":[{"given":"Dilip","family":"Sarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Stojmenovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01408289_CR1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0890-5401(88)90049-1","volume":"77","author":"H. Edelsbrunner","year":"1988","unstructured":"H. Edelsbrunner and F. P. Preparata, Minimum Polygon SeparationInformation and Computation,77:218\u2013232 (1988).","journal-title":"Information and Computation"},{"key":"BF01408289_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"S. A. Cook, A Taxonomy of Problems with Fast Parallel Algorithms,Information and Control,64:2\u201323 (1985).","journal-title":"Information and Control"},{"key":"BF01408289_CR3","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/3318.3478","volume":"7","author":"I. Bar-On","year":"1985","unstructured":"I. Bar-On and U. Vishkin, Optimal Parallel Generation of Computation Tree Form,ACM Trans. Prog. Lang. and Syst.,7:348\u2013357 (1985).","journal-title":"ACM Trans. Prog. Lang. and Syst."},{"key":"BF01408289_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. ShamosComputational Geometry, Springer-Verlag, New York (1985)."},{"key":"BF01408289_CR5","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/0743-7315(86)90011-0","volume":"3","author":"M. J. Atallah","year":"1986","unstructured":"M. J. Atallah and M. T. Goodrich, Efficient Parallel Solutions to Some Geometric Problems.J. Parallel and Distributed Computing,3:492\u2013507 (1986).","journal-title":"J. Parallel and Distributed Computing"},{"key":"BF01408289_CR6","doi-asserted-by":"crossref","unstructured":"R. Cole, Parallel Merge Sort,Proc. IEEE Symp. Found. Comput. Science, pp. 511\u2013516 (1986).","DOI":"10.1109\/SFCS.1986.41"},{"key":"BF01408289_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(87)90002-0","volume":"26","author":"M. T. Goodrich","year":"1987","unstructured":"M. T. Goodrich, Finding the Convex Hull of a Sorted Point Set in Parallel,Info. Proc. Lett.,26:173\u2013179 (1987).","journal-title":"Info. Proc. Lett."},{"key":"BF01408289_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/34.16713","volume":"11","author":"C. Ronse","year":"1989","unstructured":"C. Ronse, A Bibliography on Digital and Computational Convexity (1961\u20131988),IEEE Trans. PAMI,11:181\u2013190 (1989).","journal-title":"IEEE Trans. PAMI"},{"key":"BF01408289_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0020-0190(89)90060-4","volume":"32","author":"D. Sarkar","year":"1989","unstructured":"D. Sarkar and I. Stojmenovic, An Optimal Parallel Circle-Cover Algorithm,Infor. Proc. Lett.,32:3\u20136 (1989).","journal-title":"Infor. Proc. Lett."},{"key":"BF01408289_CR10","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1109\/TPAMI.1982.4767315","volume":"4","author":"C. E. Kim","year":"1982","unstructured":"C. E. Kim, Digital Convexity, Straightness and Convex Polygons,IEEE Trans. PAMI,4:618\u2013626 (1982).","journal-title":"IEEE Trans. PAMI"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01408289.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01408289\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01408289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:00:44Z","timestamp":1556863244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01408289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["BF01408289"],"URL":"https:\/\/doi.org\/10.1007\/bf01408289","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}