{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:58Z","timestamp":1725490318566},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74472-6_3","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T16:31:01Z","timestamp":1188318661000},"page":"26-40","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Colored Point Set Matching Under Noise"],"prefix":"10.1007","author":[{"given":"Yago","family":"Diez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Antoni","family":"Sellar\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Akutsu, T., Kanaya, K., Ohyama, A., Fujiyama, A.: Point Matching Under Non-Uniform Distortions. Discrete Applied Mathematics, special issue: computational biology series IV, 5-21 (2003)","DOI":"10.1016\/S0166-218X(02)00282-2"},{"key":"3_CR2","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. Discrete & Computational Geometry\u00a03, 237\u2013256 (1988)","journal-title":"Discrete & Computational Geometry"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-540-27801-6_21","volume-title":"Combinatorial Pattern Matching","author":"V. Choi","year":"2004","unstructured":"Choi, V., Goyal, N.: A Combinatorial Shape Matching Algorithm for Rigid Protein Docking. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 285\u2013296. Springer, Heidelberg (2004)"},{"key":"3_CR4","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.J.: Geometry helps in Bottleneck Matching and related problems. Algorithmica\u00a031, 1\u201328 (2001)","journal-title":"Algorithmica"},{"key":"3_CR5","first-page":"296","volume-title":"21st ACM Symp. on Comp. Geom.","author":"D. Eppstein","year":"2005","unstructured":"Eppstein, D., Goodrich, M.T., Sun, J.Z.: The skip quadtree: a simple dynamic data structure for multidimensional data. In: 21st ACM Symp. on Comp. Geom., pp. 296\u2013305. ACM Press, New York (2005)"},{"key":"3_CR6","first-page":"324","volume-title":"Proc. 13th ACM Symp. Comp. Geom.","author":"P. Finn","year":"1997","unstructured":"Finn, P., Kavraki, L.E., Latombe, J.C., Motwani, R., Shelton, C., Venkatasubramanian, S., Yao, A.: Rapid: Randomized pharmacophore identification for drug design. In: Proc. 13th ACM Symp. Comp. Geom., pp. 324\u2013333. ACM Press, New York (1997)"},{"issue":"3","key":"3_CR7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0925-7721(94)90004-3","volume":"4","author":"P.J. Heffernan","year":"1994","unstructured":"Heffernan, P.J., Schirra, S.: Approximate decision algorithms for point set congruence. Computational Geometry: Theory and Applications\u00a04(3), 137\u2013156 (1994)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR9","volume-title":"Kinematic Geometry of Mechanisms","author":"K.H. Hunt","year":"1978","unstructured":"Hunt, K.H.: Kinematic Geometry of Mechanisms, ch. 4,7. Oxford University Press, Oxford (1978)"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0925-7721(02)00095-0","volume":"24","author":"P. Indyk","year":"2003","unstructured":"Indyk, P., Venkatasubramanian, S.: Approximate congruence in nearly linear time. Comput. Geom.\u00a024(2), 115\u2013128 (2003)","journal-title":"Comput. Geom."},{"key":"3_CR11","first-page":"1","volume":"11","author":"G. Weber","year":"1994","unstructured":"Weber, G., Knipping, L., Alt, H.: An Application of Point Pattern Matching in Astronautics. J. Symbolic Computation\u00a011, 1\u201320 (1994)","journal-title":"J. Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74472-6_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:31:31Z","timestamp":1619519491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74472-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744689"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74472-6_3","relation":{},"subject":[]}}