{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:46Z","timestamp":1725487186326},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414292"},{"type":"electronic","value":"9783540444671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44467-x_18","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:21:46Z","timestamp":1184588506000},"page":"194-203","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Congruent Regions on a Mesh-Connected Computer"],"prefix":"10.1007","author":[{"given":"Chang-Sung","family":"Jeong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sun-Chul","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Je","family":"Woo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sun-Mi","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,8]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0167-8191(90)90142-V","volume":"13","author":"Z. C. Shih","year":"1990","unstructured":"Z. C. Shih, R. C. T. Lee and S. N. Yang, A Parallel Algorithm for Finding Congruent Regions, Parallel Computing 13 (1990) 135\u2013142.","journal-title":"Parallel Computing"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"L. Boxer, Finding congruent Regions in Parallel, Parallel Computing (1992) 807\u2013810.","DOI":"10.1016\/0167-8191(92)90046-A"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"L. Boxer, Scalable Parallel Algorithms for Geometric Pattern Recognition, Journal of Parallel and Distributed Computing (1999) 466\u2013486.","DOI":"10.1006\/jpdc.1999.1565"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF01293487","volume":"13","author":"P. J. Renzende de","year":"1995","unstructured":"P. J. de Renzende and D. T. Lee, Point Set Pattern Matching in d-dimensions, Algorithmica 13(1995), 387\u2013404.","journal-title":"Algorithmica"},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0022-0000(84)90011-4","volume":"29","author":"K. Sugihara","year":"1984","unstructured":"K. Sugihara, An nlogn Algorithm for Determining the Congruity of Polyhedra, J. Computer and System Sciences 29 (1984) 36\u201347.","journal-title":"J. Computer and System Sciences"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0196-6774(87)90036-8","volume":"8","author":"M. D. Atkinson","year":"1987","unstructured":"M. D. Atkinson, An Optimal Algorithm for Geometrical Congruence, J. Algorithms 8 (1987) 159\u2013172.","journal-title":"J. Algorithms"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"D. Nassimi and S. Sahni, Data Broadcasting in SIMD Computers, IEEE Trans. on Computer (1981) 101\u2013106.","DOI":"10.1109\/TC.1981.6312172"},{"key":"18_CR8","unstructured":"M. Lu, Constructing the Voronoi Diagram on a Mesh-connected Computer, Proc. of 1986 Int. Conf. on Parallel Processing (1986) 806\u2013811."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2014 HiPC 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44467-X_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T19:22:14Z","timestamp":1550431334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44467-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414292","9783540444671"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44467-x_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}