{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T03:31:24Z","timestamp":1707103884749},"reference-count":15,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0167-8655(91)90003-5","type":"journal-article","created":{"date-parts":[[2004,8,19]],"date-time":"2004-08-19T09:10:49Z","timestamp":1092906649000},"page":"665-669","source":"Crossref","is-referenced-by-count":22,"title":["On the recognition of digital planes in three-dimensional space"],"prefix":"10.1016","volume":"12","author":[{"given":"Chul E","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Stojmenovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(91)90003-5_BIB1","series-title":"Proc. IEEE Symp. FOCS","first-page":"468","article-title":"Parallel computational geometry","author":"Aggarwal","year":"1986"},{"key":"10.1016\/0167-8655(91)90003-5_BIB2","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"key":"10.1016\/0167-8655(91)90003-5_BIB3","series-title":"Proc. IEEE Symp. FOCS","first-page":"348","article-title":"Parallel merge sort","author":"Cole","year":"1986"},{"key":"10.1016\/0167-8655(91)90003-5_BIB4","series-title":"Proc. 3rd ACM Symp. on Comput. Geom","first-page":"205","article-title":"Parallel processing for efficient subdivision search","author":"Dadoun","year":"1987"},{"key":"10.1016\/0167-8655(91)90003-5_BIB5","first-page":"154","article-title":"A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors","volume":"318","author":"Dehne","year":"1988"},{"key":"10.1016\/0167-8655(91)90003-5_BIB6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01840383","article-title":"Parallel geometric algorithms on mesh-connected computers","volume":"5","author":"Jeong","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0167-8655(91)90003-5_BIB7","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1109\/TPAMI.1982.4767315","article-title":"Digital convexity, straightness and convex polygons","volume":"4","author":"Kim","year":"1982","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/0167-8655(91)90003-5_BIB8","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1109\/TPAMI.1984.4767578","article-title":"Three-dimensional digital planes","volume":"6","author":"Kim","year":"1984","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/0167-8655(91)90003-5_BIB9","first-page":"18","article-title":"Optimal search in planar subdivision","volume":"12","author":"Kirkpatrick","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8655(91)90003-5_BIB10","series-title":"Proc. IEEE Parallel Proc. Conf","first-page":"806","article-title":"Constructing the Voronoi diagram on a mesh-connected computer","author":"Lu","year":"1986"},{"issue":"4","key":"10.1016\/0167-8655(91)90003-5_BIB11","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0209058","article-title":"Finding connected components and connected ones on a mesh-connected parallel computer","volume":"9","author":"Nassimi","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0167-8655(91)90003-5_BIB12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","article-title":"Data broadcasting in SIMD computers","volume":"30","author":"Nassimi","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8655(91)90003-5_BIB13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets of points in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"Commun. ACM"},{"key":"10.1016\/0167-8655(91)90003-5_BIB14","series-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1985"},{"issue":"4","key":"10.1016\/0167-8655(91)90003-5_BIB15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","article-title":"Sorting on a mesh-connected parallel computer","volume":"20","author":"Thompson","year":"1977","journal-title":"Comm. ACM"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865591900035?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865591900035?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T16:20:36Z","timestamp":1549297236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167865591900035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":15,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0167865591900035"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(91)90003-5","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}