{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:09:35Z","timestamp":1725494975790},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540656852"},{"type":"electronic","value":"9783540491262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49126-0_22","type":"book-chapter","created":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T22:44:17Z","timestamp":1194734657000},"page":"286-297","source":"Crossref","is-referenced-by-count":3,"title":["Measuring Resemblance of Complex Patterns"],"prefix":"10.1007","author":[{"given":"Michiel","family":"Hagedoorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Remco","family":"Veltkamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,15]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1142\/S0218195997000211","volume":"7","author":"O. Aichholzer","year":"1997","unstructured":"O. Aichholzer, H. Alt, and G. Rote. Matching shapes with a reference point. In Int. J. of Computational Geometry and Applications, volume 7, pages 349\u2013363, August 1997.","journal-title":"Int. J. of Computational Geometry and Applications"},{"key":"22_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/3-540-61680-2_65","volume-title":"Matching convex shapes with respect to the symmetric difference","author":"H. Alt","year":"1996","unstructured":"H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. In Algorithms ESA\u2019 96, Proc. 4th Annual European Symp. on Algorithms, Barcelona, Spain, September\u2019 96, pages 320\u2013333. LNCS1136, Springer, 1996."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"H. Alt and M. Godeau. Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. of Computational Geometry & Applications, pages 75\u201391, 1995.","DOI":"10.1142\/S0218195995000064"},{"key":"22_CR4","unstructured":"L.P. Chew, M.T. Goodrich, D.P. Huttenlocher, K. Kedem, Jon M. Kleinberg, and Dina Kravets. Geometric pattern matching under Euclidean motion. In Fifth Canadian Conference on Computational Geometry, pages 151\u2013156, 1993."},{"key":"22_CR5","unstructured":"S.D. Cohen and L.J. Guibas. Partial matching of planar polylines under similarity transformations. In Eight Annual ACM-SIAM Symp. on Discrete Algorithms, pages 777\u2013786, January 1997."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"E.T. Copson. Metric spaces. Cambridge University Press, 1968.","DOI":"10.1017\/CBO9780511566141"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"M. Hagedoorn and R.C. Veltkamp. A general method for partial point set matching. In Jean-Daniel Boissonnat, editor, Proc. 13th Annual ACM Symp. Computational Geometry, pages 406\u2013408. ACM Press, 1997.","DOI":"10.1145\/262839.263030"},{"key":"22_CR8","unstructured":"M. Hagedoorn and R.C. Veltkamp. Reliable and e_cient pattern matching using an affine invariant metric. Technical Report UU-CS-1997-33, Utrecht University, 1997. revision accepted for publication in IJCV."},{"key":"22_CR9","unstructured":"M. Hagedoorn and R.C. Veltkamp. New visibility partitions with applications in affine pattern matching. Manuscript, 1998."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"D.P. Huttenlocher and K. Kedem. Computing the minimum Hausdorff distance for point sets under translation. In Proc. 6th Annual ACM Symp. Computational Geometry, pages 340\u2013349, 1990.","DOI":"10.1145\/98524.98599"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"D.P. Huttenlocher","year":"1993","unstructured":"D.P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete and Computational Geometry, 9:267\u2013291, 1993.","journal-title":"Discrete and Computational Geometry"},{"key":"22_CR12","unstructured":"D.P. Huttenlocher and W.J. Rucklidge. A multi-resolution technique for comparing images using the Hausdorff distance. Technical Report 92-1321, Cornell University, 1992."},{"key":"22_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0015091","volume-title":"Efficient Visual Recognition Using the Hausdorff Distance","author":"W. Rucklidge","year":"1996","unstructured":"W. Rucklidge. Efficient Visual Recognition Using the Hausdorff Distance. Lecture Notes in Computer Science. Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49126-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T23:14:08Z","timestamp":1551050048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49126-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656852","9783540491262"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-49126-0_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}