{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:03:38Z","timestamp":1648865018522},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1991,8]]},"DOI":"10.1016\/0020-0190(91)90112-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"153-159","source":"Crossref","is-referenced-by-count":5,"title":["The translation square map and approximate congruence"],"prefix":"10.1016","volume":"39","author":[{"given":"Paul J.","family":"Heffernan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90112-U_BIB1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02187910","article-title":"Congruence, similarity, and symmetries of geometric objects","volume":"3","author":"Alt","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(91)90112-U_BIB2","first-page":"42","article-title":"Matching points into noise regions: Combinatorial bounds and algorithms","author":"Arkin","year":"1991","journal-title":"Proc. Symp. on Discrete Algorithms"},{"key":"10.1016\/0020-0190(91)90112-U_BIB3","article-title":"Algorithms for generalized matching of point sets","author":"Arkin","year":"1988","journal-title":"CORS\/ORSA\/TIMS National Meeting, Vanvouver, B.C., May 1989"},{"key":"10.1016\/0020-0190(91)90112-U_BIB4","series-title":"Model-Based Image Matching Using Location","author":"Baird","year":"1984"},{"key":"10.1016\/0020-0190(91)90112-U_BIB5","first-page":"374","article-title":"Linear Programming","author":"Chvatal","year":"1983"},{"key":"10.1016\/0020-0190(91)90112-U_BIB6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.4153\/CJM-1957-024-0","article-title":"A simple algorithm for finding maximal network flows and an application to the Hitchcock problem","volume":"9","author":"Ford","year":"1957","journal-title":"Canad. J. Math."},{"key":"10.1016\/0020-0190(91)90112-U_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5\/2 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(91)90112-U_BIB8","first-page":"340","article-title":"Computing the minimum Hausdorff distance for point sets under translation","author":"Huttenlocher","year":"1990","journal-title":"Proc. 6th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0020-0190(91)90112-U_BIB9","article-title":"The upper envelope of Voronoi surfaces: Theory and applications","author":"Huttenlocher","year":"1991","journal-title":"Proc. 7th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0020-0190(91)90112-U_BIB10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(78)90016-9","article-title":"An O(|V|3) algorithm for finding maximum flows in networks","volume":"7","author":"Malhotra","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90112-U_BIB11","series-title":"Tech. Rept. A21\/90","article-title":"Approximate algorithms for approximate congruence","author":"Schirra","year":"1990"},{"key":"10.1016\/0020-0190(91)90112-U_BIB12","series-title":"Master's Thesis.","author":"Sprinzak","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190112U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190112U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:24:52Z","timestamp":1555143892000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190112U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["002001909190112U"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90112-u","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}