{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:07:40Z","timestamp":1762099660172,"version":"3.44.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,8,13]],"date-time":"1998-08-13T00:00:00Z","timestamp":902966400000},"content-version":"vor","delay-in-days":589,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/0925-7721(95)00047-x","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T18:53:11Z","timestamp":1051210391000},"page":"113-124","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":76,"title":["Geometric pattern matching under Euclidean motion"],"prefix":"10.1016","volume":"7","author":[{"given":"L.Paul","family":"Chew","sequence":"first","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Daniel P.","family":"Huttenlocher","sequence":"additional","affiliation":[]},{"given":"Klara","family":"Kedem","sequence":"additional","affiliation":[]},{"given":"Jon M.","family":"Kleinberg","sequence":"additional","affiliation":[]},{"given":"Dina","family":"Kravets","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00047-X_BIB1","series-title":"Proc. 3rd ACM-SIAM Symp. Discrete Algorithms","first-page":"72","article-title":"Applications of parametric searching in geometric optimization","author":"Agarwal","year":"1992"},{"key":"10.1016\/0925-7721(95)00047-X_BIB2","series-title":"Proc. 7th ACM Symp. Comput. Geom.","first-page":"186","article-title":"Measuring the resemblance of polygonal shapes","author":"Alt","year":"1991"},{"key":"10.1016\/0925-7721(95)00047-X_BIB3","series-title":"Proc. 8th ACM Symp. Comput. Geom.","first-page":"102","article-title":"Measuring the resemblance of polygonal curves","author":"Alt","year":"1992"},{"key":"10.1016\/0925-7721(95)00047-X_BIB4","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\/0925-7721(95)00047-X_BIB5","series-title":"Proc. 6th ACM Symp. Comput. Geom.","first-page":"225","article-title":"Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams","author":"Aonuma","year":"1990"},{"issue":"3","key":"10.1016\/0925-7721(95)00047-X_BIB6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/34.75509","article-title":"An efficiently computable metric for comparing polygonal shapes","volume":"13","author":"Arkin","year":"1991","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"issue":"4","key":"10.1016\/0925-7721(95)00047-X_BIB7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/ijoc.4.4.375","article-title":"Matching points into noise regions: combinatorial bounds and algorithms","volume":"4","author":"Arkin","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0925-7721(95)00047-X_BIB8","series-title":"Proc. 5th Symp. Theoret. Aspects Comput. Sci.","first-page":"322","article-title":"Polygon placement under translation and rotation","volume":"294","author":"Avnaim","year":"1988"},{"key":"10.1016\/0925-7721(95)00047-X_BIB9","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00047-X_BIB10","series-title":"Proc. 8th ACM Symp. Comput. Geom.","first-page":"120","article-title":"Diameter, width, closest line pair, and parametric searching","author":"Chazelle","year":"1992"},{"key":"10.1016\/0925-7721(95)00047-X_BIB11","series-title":"3rd Scandinavian Workshop on Algorithm Theory","first-page":"318","article-title":"Improvements on approximate pattern matching problems","volume":"621","author":"Chew","year":"1992"},{"issue":"1","key":"10.1016\/0925-7721(95)00047-X_BIB12","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","article-title":"Slowing down sorting networks to obtain faster sorting algorithms","volume":"34","author":"Cole","year":"1987","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0925-7721(95)00047-X_BIB13","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00047-X_BIB14","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1137\/0218055","article-title":"An optimal-time algorithm for slope selection","volume":"18","author":"Cole","year":"1989","journal-title":"SIAM J. Comput."},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/0925-7721(95)00047-X_BIB15"},{"year":"1987","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","key":"10.1016\/0925-7721(95)00047-X_BIB16"},{"issue":"4","key":"10.1016\/0925-7721(95)00047-X_BIB17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","article-title":"Triangulating a simple polygon","volume":"7","author":"Garey","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(95)00047-X_BIB18","series-title":"Proc. 19th IEEE Symp. Found. Comput. Sci.","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"key":"10.1016\/0925-7721(95)00047-X_BIB19","series-title":"Proc. 8th ACM Symp. Comput. Geom.","first-page":"93","article-title":"Approximate decision algorithms for point set congruence","author":"Heffernan","year":"1991"},{"key":"10.1016\/0925-7721(95)00047-X_BIB20","series-title":"Proc. 8th ACM Symp. Comput. Geom.","first-page":"110","article-title":"On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane","author":"Huttenlocher","year":"1992"},{"key":"10.1016\/0925-7721(95)00047-X_BIB21","doi-asserted-by":"crossref","unstructured":"D.P. Huttenlocher, K. Kedem and M. Sharir, The upper envelope of Voronoi surfaces and its applications, Discrete Comput. Geom. 9(3) 267\u2013291.","DOI":"10.1007\/BF02189323"},{"key":"10.1016\/0925-7721(95)00047-X_BIB22","series-title":"Proc. 5th ACM Symp. Comput. Geom.","first-page":"266","article-title":"Minimax geometric fitting of two corresponding sets of points","author":"Imai","year":"1989"},{"issue":"4","key":"10.1016\/0925-7721(95)00047-X_BIB23","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"year":"1985","series-title":"Computational Geometry: An Introduction","author":"Preparata","key":"10.1016\/0925-7721(95)00047-X_BIB24"},{"key":"10.1016\/0925-7721(95)00047-X_BIB25","series-title":"Proc. 5th Canad. Conf. Comput. Geom.","article-title":"Lower bounds for the complexity of the Hausdorff distance","author":"Rucklidge","year":"1993"},{"year":"1983","series-title":"Data Structures and Network Algorithms","author":"Tarjan","key":"10.1016\/0925-7721(95)00047-X_BIB26"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219500047X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219500047X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T16:40:01Z","timestamp":1757522401000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219500047X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["092577219500047X"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00047-x","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[1997,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Geometric pattern matching under Euclidean motion","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0925-7721(95)00047-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}