{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:09:09Z","timestamp":1757621349857,"version":"3.44.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ENG79-09246"],"award-info":[{"award-number":["ENG79-09246"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0031-3203(81)90001-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:41:01Z","timestamp":1056984061000},"page":"389-394","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["A method for detecting structure in polygons"],"prefix":"10.1016","volume":"13","author":[{"given":"Steven L.","family":"Tanimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(81)90001-7_BIB1","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","article-title":"On the encoding of arbitrary geometric configuration","volume":"EC-10","author":"Freeman","year":"1961","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/0031-3203(81)90001-7_BIB2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0146-664X(78)90115-6","article-title":"A review of algorithms for shape analysis","volume":"7","author":"Pavlidis","year":"1978","journal-title":"Comput. Graphics Image Process."},{"year":"1977","series-title":"Structural Pattern Recognition","author":"Pavlidis","key":"10.1016\/0031-3203(81)90001-7_BIB3"},{"key":"10.1016\/0031-3203(81)90001-7_BIB4","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/TC.1977.1674812","article-title":"Understand shape: angles and sides","volume":"C-26","author":"Davis","year":"1974","journal-title":"IEEE Trans. Comput."},{"article-title":"Shape measures for polygons based upon the distributions of angles, slopes and lengths of sides","year":"1980","author":"Tanimoto","key":"10.1016\/0031-3203(81)90001-7_BIB5"},{"key":"10.1016\/0031-3203(81)90001-7_BIB6","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TC.1977.1674859","article-title":"Storage reduction through minimal spanning trees and spanning forests","volume":"C-26","author":"Kang","year":"1977","journal-title":"IEEE Trans. Comput."},{"issue":"No. 4","key":"10.1016\/0031-3203(81)90001-7_BIB7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/TPAMI.1980.4767034","article-title":"Pattern recognition as rule-guided inductive inference","volume":"PAMI-2","author":"Michalski","year":"1980","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/0031-3203(81)90001-7_BIB8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1109\/TPAMI.1980.4766989","article-title":"A structural model of shape","volume":"PAMI-2","author":"Shapiro","year":"1980","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0031-3203(81)90001-7_BIB9"},{"key":"10.1016\/0031-3203(81)90001-7_BIB10","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1974"},{"key":"10.1016\/0031-3203(81)90001-7_BIB11","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. Ass. comput. Mach."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320381900017?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320381900017?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T12:35:07Z","timestamp":1757334907000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0031320381900017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1981]]}},"alternative-id":["0031320381900017"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(81)90001-7","relation":{},"ISSN":["0031-3203"],"issn-type":[{"type":"print","value":"0031-3203"}],"subject":[],"published":{"date-parts":[[1981]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A method for detecting structure in polygons","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0031-3203(81)90001-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1981 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}