{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T01:35:39Z","timestamp":1726191339307},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7290,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0925-7721(93)90031-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:41:31Z","timestamp":1027640491000},"page":"121-137","source":"Crossref","is-referenced-by-count":2,"title":["Linear-time algorithms for weakly-monotone polygons"],"prefix":"10.1016","volume":"3","author":[{"given":"Paul J.","family":"Heffernan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90031-Z_BIB1","series-title":"RM No. 90-15","article-title":"Monotone pieces of chains","author":"Chandru","year":"1990"},{"key":"10.1016\/0925-7721(93)90031-Z_BIB2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90031-Z_BIB3","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\/0925-7721(93)90031-Z_BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/BF01840397","article-title":"Computational geometry in a curved world","volume":"5","author":"Dobkin","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(93)90031-Z_BIB5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/BF01901482","article-title":"On geodesic properties of polygons relevant to linear time triangulation","volume":"5","author":"ElGindy","year":"1989","journal-title":"The Visual Computer"},{"key":"10.1016\/0925-7721(93)90031-Z_BIB6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/357337.357341","article-title":"Triangulating simple polygons and equivalent problems","volume":"3","author":"Fournier","year":"1984","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0925-7721(93)90031-Z_BIB7","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":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(93)90031-Z_BIB8","first-page":"507","article-title":"Planar separators and parallel polygon triangulation","author":"Goodrich","year":"1992","journal-title":"Proc. 24th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0925-7721(93)90031-Z_BIB9","author":"Heffernan","year":"1990","journal-title":"manuscript"},{"key":"10.1016\/0925-7721(93)90031-Z_BIB10","series-title":"Proc. of the Conf. on Foundations of Computing Theory","first-page":"207","article-title":"Fast triangulation of simple polygons","author":"Hertel","year":"1983"},{"key":"10.1016\/0925-7721(93)90031-Z_BIB11","article-title":"O(n log log n) polygon triangulation with simple data structures","author":"Kirkpatrick","year":"1990","journal-title":"Proc. 6th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0925-7721(93)90031-Z_BIB12","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. ACM"},{"key":"10.1016\/0925-7721(93)90031-Z_BIB13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(81)90091-0","article-title":"Testing a simple polygon for monotinicity","volume":"12","author":"Preparata","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(93)90031-Z_BIB14","series-title":"Snapshots of Computational and Discrete Geometry","article-title":"An output-complexity-sensitive polygon triangulation algorithm","author":"Toussaint","year":"1988"},{"key":"10.1016\/0925-7721(93)90031-Z_BIB15","series-title":"CTI-TR 89.03.81","article-title":"A linear triangulation algorithm for weakly-visible polygons","author":"Tsikopoulos","year":"1989"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390031Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390031Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:55:54Z","timestamp":1555124154000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219390031Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["092577219390031Z"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90031-z","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}