{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:54:28Z","timestamp":1648976068495},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"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":[[1990,2]]},"DOI":"10.1016\/0167-8191(90)90142-v","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"135-142","source":"Crossref","is-referenced-by-count":8,"title":["A parallel algorithm for finding congruent regions"],"prefix":"10.1016","volume":"13","author":[{"given":"Z.C","family":"Shih","sequence":"first","affiliation":[]},{"given":"R.C.T","family":"Lee","sequence":"additional","affiliation":[]},{"given":"S.N","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90142-V_BIB1","series-title":"Proc. 26th IEEE Annual Symposium on Foundations of Computer Science","first-page":"468","article-title":"Parallel computational geometry","author":"Aggarwal","year":"1985"},{"issue":"3","key":"10.1016\/0167-8191(90)90142-V_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(78)90073-X","article-title":"An improved algorithm to check for polygon similarity","volume":"7","author":"Akl","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(90)90142-V_BIB3","series-title":"Proc. 3rd ACM Annual Symp. on Computational Geometry","first-page":"308","article-title":"Congruence, similarity, and symmetrics of geometric objects","author":"Alt","year":"1987"},{"issue":"4","key":"10.1016\/0167-8191(90)90142-V_BIB4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00977833","article-title":"Checking similarity of planar figures","volume":"13","author":"Atallah","year":"1984","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"10.1016\/0167-8191(90)90142-V_BIB5","series-title":"Proc. 1985 International Conference on Parallel Processing","first-page":"411","article-title":"Efficient parallel solutions to geometric problems","author":"Atallah","year":"1985"},{"key":"10.1016\/0167-8191(90)90142-V_BIB6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0196-6774(87)90036-8","article-title":"An optimal algorithm for geometrical congruence","volume":"8","author":"Atkinson","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-8191(90)90142-V_BIB7","series-title":"Computer Vision","author":"Ballard","year":"1982"},{"issue":"1","key":"10.1016\/0167-8191(90)90142-V_BIB8","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TC.1978.1674957","article-title":"Optimal sorting algorithms for parallel computers","volume":"27","author":"baudet","year":"1978","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0167-8191(90)90142-V_BIB9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(79)90102-9","article-title":"On polygon similarity","volume":"9","author":"Byka","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(90)90142-V_BIB10","article-title":"Parallel algorithms for geometric problems","author":"Chow","year":"1981"},{"issue":"3","key":"10.1016\/0167-8191(90)90142-V_BIB11","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/TC.1977.1674832","article-title":"Pattern matching under affine transformation","volume":"26","author":"Dirilten","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90142-V_BIB12","volume":"Vol. 3","author":"Knuth","year":"1972"},{"issue":"1","key":"10.1016\/0167-8191(90)90142-V_BIB13","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/0020-0190(76)90092-2","article-title":"An application of pattern matching to a problem in geometrical complexity","volume":"5","author":"Manacher","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(90)90142-V_BIB14","series-title":"Geometry","author":"Seydel","year":"1980"},{"issue":"1","key":"10.1016\/0167-8191(90)90142-V_BIB15","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0022-0000(84)90011-4","article-title":"An n log n algorithm for determining the congruity of polyhedra","volume":"29","author":"Sugihara","year":"1984","journal-title":"J. Comput. System. Sci."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090142V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090142V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:25:31Z","timestamp":1551086731000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090142V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["016781919090142V"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90142-v","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}