{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T11:53:10Z","timestamp":1774007590286,"version":"3.50.1"},"reference-count":14,"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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[1981,1]]},"DOI":"10.1016\/0031-3203(81)90002-9","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"395-398","source":"Crossref","is-referenced-by-count":82,"title":["An efficient algorithm for decomposing a polygon into star-shaped polygons"],"prefix":"10.1016","volume":"13","author":[{"given":"D.","family":"Avis","sequence":"first","affiliation":[]},{"given":"G.T.","family":"Toussaint","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(81)90002-9_BIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0031-3203(72)90016-7","article-title":"Representation of figures by labelled graphs","volume":"4","author":"Pavlidis","year":"1972","journal-title":"Pattern Recognition"},{"key":"10.1016\/0031-3203(81)90002-9_BIB2","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1109\/TC.1978.1675001","article-title":"Decomposition of polygons into convex sets","volume":"C-27","author":"Schacter","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0031-3203(81)90002-9_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/T-C.1975.224276","article-title":"Decomposition of polygons into simpler components: feature generation for syntactic pattern recognition","volume":"C-24","author":"Feng","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0031-3203(81)90002-9_BIB4","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0206043","article-title":"Location of a point in a planar sub-division and applications","volume":"6","author":"Lee","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0031-3203(81)90002-9_BIB5","article-title":"A review of algorithms for shape analysis","author":"Pavlidis","year":"1976"},{"key":"10.1016\/0031-3203(81)90002-9_BIB6","series-title":"A study of visual shape perception","author":"Maruyama","year":"1972"},{"key":"10.1016\/0031-3203(81)90002-9_BIB7","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0095-8956(78)90059-X","article-title":"A short proof of Chv\u00e1tal's watchman theorem","volume":"24","author":"Fisk","year":"1978","journal-title":"J. combin. Theory, B"},{"key":"10.1016\/0031-3203(81)90002-9_BIB8","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":"Chv\u00e1tal","year":"1975","journal-title":"J. combin. Theory, B"},{"key":"10.1016\/0031-3203(81)90002-9_BIB9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","article-title":"Triangulating a simple polygon","volume":"7","author":"Garey","year":"1978","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0031-3203(81)90002-9_BIB10","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0031-3203(81)90002-9_BIB11","series-title":"11th ACM Symp. Theory of Computing","first-page":"38","article-title":"Decomposing a polygon into its convex parts","author":"Chazelle","year":"1979"},{"key":"10.1016\/0031-3203(81)90002-9_BIB12","series-title":"Proc. 5th Int. Conf. Pattern Recognition","first-page":"1040","article-title":"Minimal rectangular partitions of digitized blobs","author":"Ferrari","year":"1980"},{"key":"10.1016\/0031-3203(81)90002-9_BIB13","series-title":"Proc. 5th Int. Conf. Pattern Recognition","first-page":"1324","article-title":"Pattern recognition and geometrical complexity","author":"Toussaint","year":"1980"},{"key":"10.1016\/0031-3203(81)90002-9_BIB14","series-title":"Proc. Allerton Conf.","article-title":"Decomposing a simple polygon with the relative neighborhood graph","author":"Toussaint","year":"1980"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320381900029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320381900029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:53:02Z","timestamp":1552902782000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0031320381900029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,1]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1981,1]]}},"alternative-id":["0031320381900029"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(81)90002-9","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1981,1]]}}}