{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:07:03Z","timestamp":1743109623979,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":13,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_296","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:15Z","timestamp":1214505015000},"page":"657-660","source":"Crossref","is-referenced-by-count":2,"title":["Point Pattern Matching"],"prefix":"10.1007","author":[{"given":"Veli","family":"M\u00e4kinen","sequence":"first","affiliation":[]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"296_CR1_296","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0166-218X(02)00282-2","volume":"127","author":"T. Akutsu","year":"2003","unstructured":"Akutsu, T., Kanaya, K., Ohyama, A., Fujiyama, A.: Point matching under non-uniform distortions. Discret. Appl. Math. 127, 5\u201321 (2003)","journal-title":"Discret. Appl. Math."},{"key":"296_CR2_296","doi-asserted-by":"crossref","unstructured":"Alt, H., Guibas, L.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp.\u00a0121\u2013153. Elsevier Science Publishers B.V. North-Holland, Amsterdam (1999)","DOI":"10.1016\/B978-044482537-7\/50004-8"},{"key":"296_CR3_296","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF02187910","volume":"3","author":"H. Alt","year":"1988","unstructured":"Alt, H., Mehlhorn, K., Wagener, H., Welzl, E.: Congruence, similarity and symmetries of geometric objects. Discret. Comput. Geom. 3, 237\u2013256 (1988)","journal-title":"Discret. Comput. Geom."},{"key":"296_CR4_296","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0196-6774(87)90036-8","volume":"8","author":"M.D. Atkinson","year":"1997","unstructured":"Atkinson, M.D.: An optimal algorithm for geometric congruence. J.\u00a0Algorithms 8, 159\u2013172 (1997)","journal-title":"J. Algorithms"},{"issue":"4","key":"296_CR5_296","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1142\/S0218195901000596","volume":"11","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., Har-Peled, S.: Polygon containment and translational min\u2010hausdorff\u2010distance between segment sets are 3SUM-hard. Int. J.\u00a0Comput. Geom. Appl. 11(4), 465\u2013474 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"296_CR6_296","first-page":"183","volume-title":"Proc. 21st European Workshop on Computational Geometry (EWCG'05)","author":"S. B\u00f6cker","year":"2005","unstructured":"B\u00f6cker, S., M\u00e4kinen, V.: Maximum line-pair stabbing problem and its variations. In: Proc. 21st European Workshop on Computational Geometry (EWCG'05), pp.\u00a0183\u2013186. Technische Universit\u00e4t Eindhoven, The Netherlands (2005)"},{"key":"296_CR7_296","doi-asserted-by":"crossref","unstructured":"Brass, P., Pach, J.: Problems and results on geometric patterns. In: Avis, D. et al. (eds.) Graph Theory and Combinatorial Optimization, pp. 17\u201336. Springer Science + Business Media Inc., NY, USA (2005)","DOI":"10.1007\/0-387-25592-3_2"},{"key":"296_CR8_296","first-page":"318","volume-title":"Proc. Scandinavian Workshop Algorithm Theory (SWAT). LNCS, vol. 621","author":"L.P. Chew","year":"1992","unstructured":"Chew, L.P., Kedem, K.: Improvements on geometric pattern matching problems. In: Proc. Scandinavian Workshop Algorithm Theory (SWAT). LNCS, vol.\u00a0621, pp.\u00a0318\u2013325. Springer, Berlin (1992)"},{"key":"296_CR9_296","first-page":"298","volume-title":"Proc. 7th Latin American Symposium on Theoretical Informatics (LATIN 2006). LNCS, vol. 3882","author":"V. Choi","year":"2006","unstructured":"Choi, V., Goyal, N.: An efficient approximation algorithm for point pattern matching under noise. In: Proc.\u00a07th Latin American Symposium on Theoretical Informatics (LATIN 2006). LNCS, vol.\u00a03882, pp.\u00a0298\u2013310. Springer, Berlin (2006)"},{"key":"296_CR10_296","unstructured":"Clifford, R., Christodoukalis, M., Crawford, T., Meredith, D., Wiggins, G.: A\u00a0Fast, Randomised, Maximum Subset Matching Algorithm for Document-Level Music Retrieval. In: Proc.\u00a0International Conference on Music Information Retrieval (ISMIR 2006), University of Victoria, Canada (2006)"},{"issue":"1","key":"296_CR11_296","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-001-0016-8","volume":"31","author":"A. Efrat","year":"2001","unstructured":"Efrat, A., Itai, A., Katz, M.: Geometry Helps in Bottleneck Matching and Related Problems. Algorithmica 31(1), 1\u201328 (2001)","journal-title":"Algorithmica"},{"key":"296_CR12_296","first-page":"115","volume-title":"Proc. 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002). LNCS, vol. 2373","author":"V. M\u00e4kinen","year":"2002","unstructured":"M\u00e4kinen, V., Ukkonen, E.: Local Similarity Based Point-Pattern Matching. In: Proc. 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002). LNCS, vol.\u00a02373, pp.\u00a0115\u2013132. Springer, Berlin (2002)"},{"key":"296_CR13_296","doi-asserted-by":"crossref","unstructured":"Ukkonen, E., Lemstr\u00f6m, K., M\u00e4kinen, V.: Sweepline the music! In: Klein, R. Six, H.W., Wegner, L. (eds.) Computer Science in Perspective, Essays Dedicated to Thomas Ottmann. LNCS, vol.\u00a02598, pp. 330\u2013342. Springer (2003)","DOI":"10.1007\/3-540-36477-3_25"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:21:08Z","timestamp":1662175268000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_296"}},"subtitle":["2003; Ukkonen, Lemstr\u00f6m, M\u00e4kinen"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_296","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}