{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:06:26Z","timestamp":1760439986049},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6956,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1016\/0925-7721(94)90004-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:41:31Z","timestamp":1027654891000},"page":"137-156","source":"Crossref","is-referenced-by-count":37,"title":["Approximate decision algorithms for point set congruence"],"prefix":"10.1016","volume":"4","author":[{"given":"Paul J.","family":"Heffernan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schirra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(94)90004-3_BIB1","first-page":"211","article-title":"Network flows","volume":"Vol. 1","author":"Ahuja","year":"1990"},{"key":"10.1016\/0925-7721(94)90004-3_BIB2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02187910","article-title":"Congruence, similarity, and symmetries of geometric objects","author":"Alt","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(94)90004-3_BIB3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/ijoc.4.4.375","article-title":"Matching points into pairwise-disjoint noise regions: combinatorial bounds and algorithms","volume":"4","author":"Arkin","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0925-7721(94)90004-3_BIB4","series-title":"Manuscript","article-title":"Algorithms for generalized matching of point sets","author":"Arkin","year":"1989"},{"key":"10.1016\/0925-7721(94)90004-3_BIB5","series-title":"Model-Based Image Matching Using Location","author":"Baird","year":"1984"},{"key":"10.1016\/0925-7721(94)90004-3_BIB6","series-title":"Diplomarbeit","article-title":"Algorithmen zur Erkennung der \u03b5-Kongruenz von Punktmengen","author":"Behrends","year":"1990"},{"key":"10.1016\/0925-7721(94)90004-3_BIB7","article-title":"Improvements on geometric pattern matching problems","volume":"Vol 621","author":"Chew","year":"1992"},{"key":"10.1016\/0925-7721(94)90004-3_BIB8","first-page":"123","article-title":"Clique partitions, graph compression and speeding-up algorithms","author":"Feder","year":"1991","journal-title":"Proceedings of the 23rd Symposium on Theory of Computing"},{"key":"10.1016\/0925-7721(94)90004-3_BIB9","series-title":"Paths, Flows, and VLSI-Layout","first-page":"101","article-title":"Network flow algorithms","author":"Goldberg","year":"1990"},{"key":"10.1016\/0925-7721(94)90004-3_BIB10","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"J. the ACM"},{"key":"10.1016\/0925-7721(94)90004-3_BIB11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(91)90112-U","article-title":"The translation square map and approximate congruence","volume":"39","author":"Heffernan","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(94)90004-3_BIB12","first-page":"340","article-title":"Efficiently computing the Hausdorff distance for point sets under translation","author":"Huttenlocher","year":"1990","journal-title":"Proc. of the 6th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0925-7721(94)90004-3_BIB13","first-page":"110","article-title":"On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidian motion in the plane","author":"Huttenlocher","year":"1992","journal-title":"proc. of the 8th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0925-7721(94)90004-3_BIB14","first-page":"194","article-title":"The upper envelope of Voronoi-surfaces and its applications","author":"Huttenlocher","year":"1991","journal-title":"Proc. of the 7th ACM Comp. Geom. Conference"},{"key":"10.1016\/0925-7721(94)90004-3_BIB15","series-title":"Proc. of the 5th ACM Symp. on Computational Geometry","first-page":"276","article-title":"Minimax geometric fitting of two corresponding sets of points","author":"Imai","year":"1989"},{"key":"10.1016\/0925-7721(94)90004-3_BIB16","series-title":"Ph.D. Thesis","article-title":"Approximate Congruence and Symmetry Detection in the Plane","author":"Iwanowski","year":"1990"},{"key":"10.1016\/0925-7721(94)90004-3_BIB17","first-page":"349","article-title":"An optimal construction method for generalized convex layers","volume":"Vol. 557","author":"Lenhof","year":"1991"},{"key":"10.1016\/0925-7721(94)90004-3_BIB18","series-title":"Transformation Geometry","author":"Martin","year":"1982"},{"key":"10.1016\/0925-7721(94)90004-3_BIB19","series-title":"Data Structures and Algorithms 2: Graph Algorithms and NP-completeness","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0925-7721(94)90004-3_BIB20","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/0925-7721(94)90004-3_BIB21","series-title":"Dimplomarbeit","article-title":"\u00dcber die Bitkomplexit\u00e4t der \u03b5-Kongruenz","author":"Schirra","year":"1988"},{"key":"10.1016\/0925-7721(94)90004-3_BIB22","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0020-0190(92)90025-Q","article-title":"Approximate decision algorithms for approximate congruence","volume":"43","author":"Schirra","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(94)90004-3_BIB23","series-title":"Technical Report STAN-CS-80-831","article-title":"An O(n log n) algorithm for maximum network flow","author":"Sleator","year":"1980"},{"key":"10.1016\/0925-7721(94)90004-3_BIB24","first-page":"114","article-title":"A data structure for dynamic trees","author":"Sleator","year":"1981","journal-title":"Proceedings of the 13th Symposium on Theory of Computing"},{"key":"10.1016\/0925-7721(94)90004-3_BIB25","series-title":"Master's Thesis","author":"Sprinzak","year":"1990"},{"key":"10.1016\/0925-7721(94)90004-3_BIB26","article-title":"Data Structures and Network Algorithms","volume":"Vol. 44","author":"Tarjan","year":"1983"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772194900043?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772194900043?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:56:11Z","timestamp":1555138571000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772194900043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0925772194900043"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(94)90004-3","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}