{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:45:17Z","timestamp":1776681917125,"version":"3.51.2"},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0167-8655(89)90093-7","type":"journal-article","created":{"date-parts":[[2004,8,26]],"date-time":"2004-08-26T19:00:20Z","timestamp":1093546820000},"page":"229-235","source":"Crossref","is-referenced-by-count":43,"title":["Polygonal entropy: A convexity measure"],"prefix":"10.1016","volume":"10","author":[{"given":"Helman I.","family":"Stern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(89)90093-7_BIB1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/357337.357340","article-title":"Triangulation and shape-complexity","volume":"3","author":"Chazelle","year":"1984","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0167-8655(89)90093-7_BIB2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","article-title":"A combinatorial theorem in plane geometry","volume":"18","author":"Chvatal","year":"1975","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0167-8655(89)90093-7_BIB3","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","article-title":"A linear algorithm for computing the visibility polygon from a point","volume":"2","author":"El Gindy","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-8655(89)90093-7_BIB4","series-title":"Proc. Conf. Foundations of Computing Theory","article-title":"Fast triangulation of a simple polygon","author":"Hertel","year":"1983"},{"key":"10.1016\/0167-8655(89)90093-7_BIB5","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","article-title":"An optimal algorithm for finding the kernel of a polygon","volume":"26","author":"Lee","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0167-8655(89)90093-7_BIB6","article-title":"The visible area function of a polygon","author":"Stern","year":"1988","journal-title":"Technical Report"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865589900937?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865589900937?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T11:57:49Z","timestamp":1549281469000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167865589900937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0167865589900937"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(89)90093-7","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}