{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:30:08Z","timestamp":1754152208004,"version":"3.41.2"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1983,1]]},"DOI":"10.1109\/tit.1983.1056600","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"148-150","source":"Crossref","is-referenced-by-count":17,"title":["A combinational approach to polygon similarity"],"prefix":"10.1109","volume":"29","author":[{"given":"D.","family":"Avis","sequence":"first","affiliation":[]},{"given":"H.","family":"Elgindy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/356827.356830"},{"key":"ref11","first-page":"1324","article-title":"Pattern recognition and geometrical complexity","author":"toussaint","year":"1980","journal-title":"Proc Fifth Int?l Conf Pattern Recognition"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675001"},{"journal-title":"An algorithm to decompose a simple polygon by the relative neighborhood graph","year":"1981","author":"elgindy","key":"ref13"},{"key":"ref14","first-page":"202","article-title":"Algorithms for inexact matching","author":"shapiro","year":"1980","journal-title":"Proc 5th Int Conf Pattern Recognition"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1979.4766871"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90073-X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90092-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90019-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90102-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","author":"harary","year":"1969","journal-title":"Graph Theory"},{"key":"ref2","first-page":"208","article-title":"On similarity measures for oriented line patterns","author":"chang","year":"1976","journal-title":"Proc 3rd Int Joint Conf on Pattern Recognition"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-88304-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22730\/01056600.pdf?arnumber=1056600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:30Z","timestamp":1753121250000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":15,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.1983.1056600","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}