{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:12:39Z","timestamp":1774465959288,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":[[1993,9]]},"DOI":"10.1016\/0167-8655(93)90141-y","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:46:52Z","timestamp":1056980812000},"page":"719-722","source":"Crossref","is-referenced-by-count":28,"title":["Slicing an ear using prune-and-search"],"prefix":"10.1016","volume":"14","author":[{"given":"Hossam","family":"ElGindy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hazel","family":"Everett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Godfried","family":"Toussaint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(93)90141-Y_BIB1","series-title":"Proc. 31st Annual Symposium on Foundations of Computer Science","first-page":"220","article-title":"Triangulating a simple polygon in linear time","author":"Chazelle","year":"1990"},{"key":"10.1016\/0167-8655(93)90141-Y_BIB2","doi-asserted-by":"crossref","first-page":"648","DOI":"10.2307\/2319703","article-title":"Polygons have ears","author":"Meisters","year":"1975","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0167-8655(93)90141-Y_BIB3","series-title":"Geometry: Modern Mathematics via the Euclidean Plane","author":"Levy","year":"1970"},{"key":"10.1016\/0167-8655(93)90141-Y_BIB4","first-page":"132","article-title":"Decomposition of a polygon into triangles","volume":"59","author":"Ho","year":"1975","journal-title":"Math. Gaz."},{"key":"10.1016\/0167-8655(93)90141-Y_BIB5","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/BF01905693","article-title":"Efficient triangulation of simple polygons","volume":"7","author":"Toussaint","year":"1991","journal-title":"Visual Computer"},{"key":"10.1016\/0167-8655(93)90141-Y_BIB6","doi-asserted-by":"crossref","DOI":"10.1137\/0217010","article-title":"An O(n log log n)-time algorithm for triangulating simple polygons","author":"Tarjan","year":"1988","journal-title":"SIAM J. Comput."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559390141Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559390141Y?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:55:13Z","timestamp":1552902913000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016786559390141Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":6,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["016786559390141Y"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(93)90141-y","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}