{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T14:14:58Z","timestamp":1672928098050},"reference-count":18,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0925-7721(97)00010-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T15:57:07Z","timestamp":1051113427000},"page":"247-256","source":"Crossref","is-referenced-by-count":17,"title":["On determining the congruence of point sets in d dimensions"],"prefix":"10.1016","volume":"9","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00010-2_BIB1","series-title":"Proc. 3rd Internat. Sympos. Algorithms Comput.","first-page":"279","article-title":"Algorithms for determining geometrical congruity in two and three dimensions","volume":"650","author":"Akutsu","year":"1992"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB2","series-title":"Proc. 5th Internat. Sympos. Algorithms Comput.","first-page":"38","article-title":"On determining the congruity of point sets in higher dimensions","volume":"834","author":"Akutsu","year":"1994"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB3","first-page":"321","article-title":"A parallel algorithm for determining the congruence of point sets in three-dimensions","volume":"E78-D","author":"Akutsu","year":"1994","journal-title":"IEICE Trans. Inform. Systems"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB4","series-title":"Proc. 8th ACM Sympos. Comput. Geom.","first-page":"102","article-title":"Measuring the resemblance of polygonal curves","author":"Alt","year":"1992"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02187910","article-title":"Congruence, similarity, and symmetries of geometric objects","volume":"3","author":"Alt","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(97)00010-2_BIB6","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/TC.1985.1676605","article-title":"On symmetry detection","volume":"34","author":"Atallah","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0925-7721(97)00010-2_BIB7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0196-6774(87)90036-8","article-title":"An optimal algorithm for geometrical congruence","volume":"8","author":"Atkinson","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB8","series-title":"Proc. 20th IEEE Sympos. Found. Comput. Sci.","first-page":"39","article-title":"Canonical labeling of graphs in linear average time","author":"Babai","year":"1979"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB9","series-title":"Proc. 27th IEEE Sympos. Found. Comput. Sci.","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","article-title":"Birthday paradox, coupon collectors, cashing algorithms and self-organizing search","volume":"39","author":"Flajolet","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(97)00010-2_BIB11","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB12","series-title":"Proc. ACM Sympos. Parallel Algorithms and Architectures","first-page":"210","article-title":"A randomized parallel algorithm for planar graph isomorphism","author":"Gazit","year":"1990"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB13","series-title":"Proc. 8th ACM Sympos. Comput. Geom.","first-page":"93","article-title":"Approximate decision algorithm for point sets congruence","author":"Heffernan","year":"1992"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(86)90097-9","article-title":"Optimal algorithms for finding the symmetries of a planar point set","volume":"18","author":"Highnam","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(97)00010-2_BIB15","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/0020-0190(76)90092-2","article-title":"An application of pattern matching to a problem in geometrical complexity","volume":"5","author":"Manacher","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(97)00010-2_BIB16","unstructured":"J. Matou\u0161ek, Private communication."},{"key":"10.1016\/S0925-7721(97)00010-2_BIB17","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF01293487","article-title":"Point set pattern matching in d-dimensions","volume":"13","author":"de Rezende","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(97)00010-2_BIB18","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0022-0000(84)90011-4","article-title":"An n log n algorithm for determining the congruity of polyhedra","volume":"30","author":"Sugihara","year":"1984","journal-title":"J. Comput. System. Sci."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000102?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000102?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:25:39Z","timestamp":1555197939000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0925772197000102"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00010-2","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}