{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:25:11Z","timestamp":1760487911750,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0925-7721(02)00095-0","type":"journal-article","created":{"date-parts":[[2002,10,21]],"date-time":"2002-10-21T14:05:17Z","timestamp":1035209117000},"page":"115-128","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Approximate congruence in nearly linear time"],"prefix":"10.1016","volume":"24","author":[{"given":"Piotr","family":"Indyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suresh","family":"Venkatasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(02)00095-0_BIB001","series-title":"Proc. llth ACM Symp. Comp. Geom.","first-page":"186","article-title":"Approximate matching of polygonal shapes","author":"Alt","year":"1995"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB002","unstructured":"H. Alt, L. Guibas, Discrete geometric shapes: Matching, interpolation, and approximation. A Survey, Tech. Rep. B96-11, Freie Universit\u00e4t Berlin, December 1996"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB003","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."},{"issue":"1","key":"10.1016\/S0925-7721(02)00095-0_BIB004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1995.1047","article-title":"Efficient 2-dimensional approximate matching of non-rectangular figures","volume":"118","author":"Amir","year":"1995","journal-title":"Inform. Comput."},{"issue":"4","key":"10.1016\/S0925-7721(02)00095-0_BIB005","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."},{"year":"1996","series-title":"Algorithmic Number Theory, Vol. I: Efficient Algorithms","author":"Bach","key":"10.1016\/S0925-7721(02)00095-0_BIB006"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB007","series-title":"Proc. 39th IEEE Symp. Foundations of Computer Science","first-page":"156","article-title":"Pattern matching for spatial point sets","author":"Cardoze","year":"1998"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB008","series-title":"Proc. 5th Canadian Conference on Computational Geometry","first-page":"151","article-title":"Geometric pattern matching under euclidean motion","author":"Chew","year":"1993"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB009","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"Dinic","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0925-7721(02)00095-0_BIB010","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0021-9045(74)90120-8","article-title":"Metric entropy of some classes of sets with differentiable boundaries","volume":"10","author":"Dudley","year":"1974","journal-title":"Approx. Theory"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB011","series-title":"Proc. 12th ACM Symp. Comp. Geom.","first-page":"301","article-title":"Improvements on bottleneck matching and related problems using geometry","author":"Efrat","year":"1996"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB012","series-title":"1996 ACM Workshop on Applied Computational Geometry","first-page":"67","article-title":"Geometric manipulation of flexible ligands","volume":"1148","author":"Finn","year":"1996"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB013","series-title":"Proc. 13th ACM Symp. Comp. Geom.","first-page":"324","article-title":"Rapid: Randomized pharmacophore identification for drug design","author":"Finn","year":"1997"},{"year":"1974","series-title":"Complexity of Computation","author":"Fischer","key":"10.1016\/S0925-7721(02)00095-0_BIB014"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB015","series-title":"Proc. 5th ACM-SIAM Symp. Disc. Algorithms","first-page":"103","article-title":"Practical methods for approximate geometric pattern matching under rigid motions","author":"Goodrich","year":"1994"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB016","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On representatives of subsets","volume":"10","author":"Hall","year":"1935","journal-title":"J. London Math. Soc."},{"issue":"3","key":"10.1016\/S0925-7721(02)00095-0_BIB017","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0925-7721(94)90004-3","article-title":"Approximate decision algorithms for point set congruence","volume":"4","author":"Heffernan","year":"1994","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB018","series-title":"Proc. 8th ACM Symp. Comp. Geom.","first-page":"110","article-title":"On dynamic Voronoi diagrams and the minimum Hausdorff distance for points sets under Euclidean motion in the plane","author":"Huttenlocher","year":"1992"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB019","series-title":"Proc. 10th ACM-SIAM Symp. Disc. Algorithms","first-page":"457","article-title":"Geometric matching under noise: Combinatorial bounds and algorithms","author":"Indyk","year":"1999"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB020","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1145\/195613.195663","article-title":"Average-case analysis of algorithms for matchings and related problems","volume":"41","author":"Motwani","year":"1994","journal-title":"J. ACM"},{"year":"1995","series-title":"Randomized Algorithms","author":"Motwani","key":"10.1016\/S0925-7721(02)00095-0_BIB021"},{"key":"10.1016\/S0925-7721(02)00095-0_BIB022","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0031-3203(98)00086-7","article-title":"Efficient algorithms for robust point pattern matching and applications to image registration","volume":"32","author":"Mount","year":"1999","journal-title":"Pattern Recognition"},{"issue":"1","key":"10.1016\/S0925-7721(02)00095-0_BIB023","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1093\/protein\/7.1.39","article-title":"Molecular surface recognition by a computer vision-based technique","volume":"7","author":"Norel","year":"1994","journal-title":"Protein Engineering"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102000950?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102000950?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T07:50:15Z","timestamp":1760428215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772102000950"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0925772102000950"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(02)00095-0","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximate congruence in nearly linear time","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0925-7721(02)00095-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}