{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T22:58:05Z","timestamp":1682463485388},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":10608,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,8]]},"DOI":"10.1016\/0022-0000(84)90011-4","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"36-47","source":"Crossref","is-referenced-by-count":30,"title":["An n log n algorithm for determining the congruity of polyhedra"],"prefix":"10.1016","volume":"29","author":[{"given":"K\u014dkichi","family":"Sugihara","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90011-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(84)90011-4_BIB2","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1147\/rd.206.0590","article-title":"Determining the three-dimensional convex hull of a polyhedron","author":"Appel","year":"1976","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0022-0000(84)90011-4_BIB3","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0734-189X(83)80031-0","article-title":"Representation of three-dimensional motion in dynamic scenes","volume":"21","author":"Asada","year":"1983","journal-title":"Comput. Vision Gr. Image Process."},{"key":"10.1016\/0022-0000(84)90011-4_BIB4","series-title":"The Many Facets of Graph Theory","first-page":"27","article-title":"On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs","author":"Barnette","year":"1969"},{"key":"10.1016\/0022-0000(84)90011-4_BIB5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/359046.359048","article-title":"Interference detection among solids and surfaces","volume":"22","author":"Boyse","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(84)90011-4_BIB6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/360715.360727","article-title":"The synthesis of solids bounded by many faces","volume":"18","author":"Braid","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(84)90011-4_BIB7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0209025","article-title":"A theoretical analysis of various heuristics for the graph isomorphism problem","volume":"9","author":"Corneil","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(84)90011-4_BIB8","series-title":"Computer Aided Design","year":"1980"},{"key":"10.1016\/0022-0000(84)90011-4_BIB9","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(84)90011-4_BIB10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0022-0000(73)80013-3","article-title":"A V log V algorithm for isomorphism of triconnected planar graphs","volume":"7","author":"Hopcroft","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90011-4_BIB11","series-title":"Proceedings, 6th Annual ACM Symposium on Theory of Computing","first-page":"172","article-title":"Linear time algorithm for isomorphism of planar graphs","author":"Hopcroft","year":"1974"},{"key":"10.1016\/0022-0000(84)90011-4_BIB12","series-title":"Information Processing 77","first-page":"167","article-title":"An interactive geometrical design system with handwriting input","author":"Hosaka","year":"1977"},{"key":"10.1016\/0022-0000(84)90011-4_BIB13","series-title":"Proceedings, 7th International Joint Conference on Artificial Intelligence","first-page":"595","article-title":"Recognition of 3-D objects using the extended Gaussian image","author":"Ikeuchi","year":"1981"},{"key":"10.1016\/0022-0000(84)90011-4_BIB14","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","article-title":"An algorithm for planning collision-free paths among polyhedral obstacles","volume":"22","author":"Lozano-P\u00e9res","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(84)90011-4_BIB15","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","article-title":"Finding the intersection of two convex polyhedra","volume":"7","author":"Muller","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90011-4_BIB16","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0031-3203(79)90024-4","article-title":"A scene description method using three-dimensional information","volume":"11","author":"Oshima","year":"1979","journal-title":"Pattern Recognition"},{"key":"10.1016\/0022-0000(84)90011-4_BIB17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets of points in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(84)90011-4_BIB18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(79)90004-3","article-title":"Range-data analysis guided by a junction dictionary","volume":"12","author":"Sugihara","year":"1979","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0022-0000(84)90011-4_BIB19","first-page":"405","article-title":"The interpretation of structure from motion","volume":"203","author":"Ullman","year":"1979"},{"key":"10.1016\/0022-0000(84)90011-4_BIB20","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/TCT.1966.1082573","article-title":"A simple and efficient algorithm for determining isomorphism of planar triply connected graphs","volume":"CT-13","author":"Weinberg","year":"1966","journal-title":"IEEE Trans. Circuit Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:51:38Z","timestamp":1550307098000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["0022000084900114"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90011-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}