{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:53Z","timestamp":1725664193668},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_164","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:45:10Z","timestamp":1330253110000},"page":"38-46","source":"Crossref","is-referenced-by-count":1,"title":["On determining the congruity of point sets in higher dimensions"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"T. Akutsu. Algorithms for determining geometrical congruity in two and three dimensions. Proc. 3rd International Symp. on Algorithms and Computation, pp. 279\u2013288, 1992.","DOI":"10.1007\/3-540-56279-6_81"},{"key":"6_CR2","unstructured":"T. Akutsu. A parallel algorithm for determining the congruity of point sets in three dimensions. Technical Report AL31-3, Information Processing Society of Japan, 1993."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"H. Alt and M. Godau. Measuring the resemblance of polygonal curves. Proc. ACM Symp. Computational Geometry, pp. 102\u2013109, 1992.","DOI":"10.1145\/142675.142699"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02187910","volume":"3","author":"H. Alt","year":"1988","unstructured":"H. Alt, K. Melhorn, H. Wagener and E. Welzl. Congruence, similarity, and symmetries of geometric objects. Discrete and Computational Geometry, Vol. 3, pp. 237\u2013256, 1988.","journal-title":"Discrete and Computational Geometry"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/TC.1985.1676605","volume":"C-34","author":"M. J. Atallah","year":"1985","unstructured":"M. J. Atallah. On symmetry detection. IEEE Trans. Computers, Vol. C-34, pp. 663\u2013666, 1985.","journal-title":"IEEE Trans. Computers"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"M. D. Atkinson. An optimal algorithm for geometrical congruence. Journal of Algorithms, Vol. 8, pp. 159\u2013172.","DOI":"10.1016\/0196-6774(87)90036-8"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"L. Babai and L. Ku\u010dera. Canonical labeling of graphs in linear average time. Proc. IEEE Symp. Foundations of Computer Science, pp. 39\u201346, 1979.","DOI":"10.1109\/SFCS.1979.8"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"R. Cole. Parallel merge sort. Proc. IEEE Symp. Foundations of Computer Science, pp. 511\u2013516, 1986.","DOI":"10.1109\/SFCS.1986.41"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","volume":"39","author":"P. Flajolet","year":"1992","unstructured":"P. Flajolet, D. Gardy and L. Thimonier. Birthday paradox, coupon collectors, cashing algorithms and self-organizing search. Discrete Applied Mathematics, Vol. 39, pp. 207\u2013229, 1992.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"H. Gazit and J. Reif. A randomized parallel algorithm for planar garph isomorphism. Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 210\u2013219, 1990.","DOI":"10.1145\/97444.97687"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"P. J. Heffernan and S. Schirra. Approximate decision algorithm for point sets congruence. Proc. ACM Symp. Computational Geometry, pp. 93\u2013101, 1992.","DOI":"10.1145\/142675.142697"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(86)90097-9","volume":"22","author":"P. T. Highnam","year":"1986","unstructured":"P. T. Highnam. Optimal algorithms for finding the symmetries of a planar point set. Information Processing Letters, Vol. 22, pp. 219\u2013222, 1986.","journal-title":"Information Processing Letters"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/0020-0190(76)90092-2","volume":"5","author":"G. Manacher","year":"1976","unstructured":"G. Manacher. An application of pattern matching to a problem in geometrical complexity. Information Processing Letters, Vol. 5, pp. 6\u20137, 1976.","journal-title":"Information Processing Letters"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0022-0000(84)90011-4","volume":"29","author":"K. Sugihara","year":"1984","unstructured":"K. Sugihara. An n log n algorithm for determining the congruity of polyhedra. Journal of Computer and System Sciences, Vol. 29, pp. 36\u20134, 1984.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_164.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:19:25Z","timestamp":1605629965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_164","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}