{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:39:13Z","timestamp":1725831553087},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319250861"},{"type":"electronic","value":"9783319250878"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25087-8_18","type":"book-chapter","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T18:11:35Z","timestamp":1444155095000},"page":"191-203","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score"],"prefix":"10.1007","author":[{"given":"Yoichi","family":"Sasaki","sequence":"first","affiliation":[]},{"given":"Tetsuo","family":"Shibuya","sequence":"additional","affiliation":[]},{"given":"Kimihito","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Hiroki","family":"Arimura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,17]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0925-7721(97)00010-2","volume":"9","author":"T Akutsu","year":"1998","unstructured":"Akutsu, T.: On determining the congruence of point sets in d dimensions. Computational Geometry 9(4), 247\u2013256 (1998)","journal-title":"Computational Geometry"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Alt, H., Guibas, L.: Discrete geometric shapes: Matching, interpolation, and approximation, pp. 121\u2013153. Elsevier Science Publishers B.V. North-Holland (1999)","DOI":"10.1016\/B978-044482537-7\/50004-8"},{"key":"18_CR3","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":"18_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-75488-6_6","volume-title":"Discovery Science","author":"H Arimura","year":"2007","unstructured":"Arimura, H., Uno, T., Shimozono, S.: Time and space efficient discovery of maximal geometric graphs. In: Corruble, V., Takeda, M., Suzuki, E. (eds.) DS 2007. LNCS (LNAI), vol. 4755, pp. 42\u201355. Springer, Heidelberg (2007)"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/prot.20517","volume":"61","author":"M Carpentier","year":"2005","unstructured":"Carpentier, M., Brouillet, S., Pothier, J.: Yakusa: a fast structural database scanning method. Proteins 61(1), 137\u2013151 (2005)","journal-title":"Proteins"},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00453-007-9059-9","volume":"50","author":"M Cho","year":"2008","unstructured":"Cho, M., Mount, D.M.: Improved approximation bounds for planar point pattern matching. Algorithmica 50(2), 175\u2013207 (2008)","journal-title":"Algorithmica"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer-Verlag (2000)","DOI":"10.1007\/978-3-662-04245-8"},{"issue":"4","key":"18_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF01293487","volume":"13","author":"PJ Rezende de","year":"1995","unstructured":"de Rezende, P.J., Lee, D.: Point set pattern matching in \n                      \n                        \n                      \n                      $$d$$\n                    -dimensions. Algorithmica 13(4), 387\u2013404 (1995)","journal-title":"Algorithmica"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/34.761267","volume":"21","author":"MT Goodrich","year":"1999","unstructured":"Goodrich, M.T., Mitchell, J.S., Orletsky, M.W.: Approximate geometric pattern matching under rigid motions. IEEE Trans. PAMI 21(4), 371\u2013379 (1999)","journal-title":"IEEE Trans. PAMI"},{"issue":"5","key":"18_CR11","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1107\/S0567739476001873","volume":"A32","author":"W Kabsch","year":"1976","unstructured":"Kabsch, W.: A solution for the best rotation to relate two sets of vectors. Acta Crystallographica A32(5), 922\u2013923 (1976)","journal-title":"Acta Crystallographica"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, V., Ukkonen, E.: Point pattern matching. In: Kao, M. (ed.) Encyclopedia of Algorithms, pp. 657\u2013660. Springer (2008)","DOI":"10.1007\/978-0-387-30162-4_296"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Nowozin, S., Tsuda, K.: Frequent subgraph retrieval in geometric graph databases. In: 8th IEEE Int\u2019l Conf. on Data Mining, pp. 953\u2013958 (2008)","DOI":"10.1109\/ICDM.2008.38"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Pinsky, M., Karlin, S.: An introduction to stochastic modeling. Academic Press (2010)","DOI":"10.1016\/B978-0-12-381416-6.00001-0"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1177\/027836498700600203","volume":"6","author":"JT Schwartz","year":"1987","unstructured":"Schwartz, J.T., Sharir, M.: Identification of partially obscured objects in two and three dimensions by matching noisy characteristic curves. The Int\u2019l J. of Robotics Res. 6(2), 29\u201344 (1987)","journal-title":"The Int\u2019l J. of Robotics Res."},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1706591.1706595","volume":"57","author":"T Shibuya","year":"2010","unstructured":"Shibuya, T.: Geometric suffix tree: Indexing protein 3-d structures. Journal of the ACM 57(3), 15 (2010)","journal-title":"Journal of the ACM"},{"issue":"7","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1109\/TVCG.2012.310","volume":"19","author":"GK Tam","year":"2013","unstructured":"Tam, G.K., et al.: Registration of 3d point clouds and meshes: a survey from rigid to nonrigid. IEEE Trans. Vis. Comput. Graphics 19(7), 1199\u20131217 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graphics"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25087-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T03:47:31Z","timestamp":1559274451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25087-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319250861","9783319250878"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25087-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}