{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:39:30Z","timestamp":1649201970597},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1016\/0167-8191(92)90081-h","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"221-229","source":"Crossref","is-referenced-by-count":0,"title":["Parallel enclosing rectangle on SIMD machines"],"prefix":"10.1016","volume":"18","author":[{"given":"Chang-Sung","family":"Jeong","sequence":"first","affiliation":[]},{"given":"Jung-Ju","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Der-Tsai","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(92)90081-H_BIB1","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1979.1675280","article-title":"A model of SIMD machines and a comparison of various interconnection networks","volume":"28","author":"Siegel","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(92)90081-H_BIB2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/12.21120","article-title":"Mesh computer algorithms for computational geometry","author":"Miller","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(92)90081-H_BIB3","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/BF01840383","article-title":"Parallel geometric algorithms on a mesh connected computer","volume":"5","author":"Jeong","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0167-8191(92)90081-H_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","article-title":"Data broadcasting in SIMD computers","author":"Nassimi","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(92)90081-H_BIB5","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"},{"key":"10.1016\/0167-8191(92)90081-H_BIB6","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0743-7315(90)90130-H","article-title":"Hierarchical gate-array routing on a hypercube multiprocessor","volume":"8","author":"Olukotun","year":"1990","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0167-8191(92)90081-H_BIB7","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/0743-7315(90)90132-9","article-title":"Squashed embedding of E-R schemes in hypercubes","volume":"8","author":"Baru","year":"1990","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0167-8191(92)90081-H_BIB8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0743-7315(90)90135-C","article-title":"Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry","volume":"8","author":"Dehen","year":"1990","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0167-8191(92)90081-H_BIB9","first-page":"83","article-title":"Parallel Hough transform algorithms on SIMD hypercube arrays","author":"Pan","year":"1990"},{"key":"10.1016\/0167-8191(92)90081-H_BIB10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/360881.360919","article-title":"Determining the minimal-area encasing rectangle for an arbitrary closed curve","author":"Freeman","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(92)90081-H_BIB11","series-title":"Proc. 5th Internat. Conf. Pattern Recognition","first-page":"1324","article-title":"Pattern recognition and geometrical complexity","author":"Toussaint","year":"1980"},{"key":"10.1016\/0167-8191(92)90081-H_BIB12","series-title":"Proc. 26th IEEE Symp. Foundations of Computer Science","first-page":"468","article-title":"Parallel computational geometry","author":"Aggarwal","year":"1985"},{"key":"10.1016\/0167-8191(92)90081-H_BIB13","article-title":"Efficient plane sweeping in parallel","author":"Atallah","year":"1986","journal-title":"Purdue University Computer Science Tech Report CSD-TR-563"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919290081H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919290081H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:26:38Z","timestamp":1551068798000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919290081H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["016781919290081H"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(92)90081-h","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}