{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T19:44:41Z","timestamp":1778615081768,"version":"3.51.4"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Graphics"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0097-8493(01)00180-7","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T07:06:34Z","timestamp":1034319994000},"page":"281-289","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["A fast trapezoidation technique for planar polygons"],"prefix":"10.1016","volume":"26","author":[{"given":"Gian Paolo","family":"Lorenzetto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitava","family":"Datta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard C","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0097-8493(01)00180-7_BIB1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/S0097-8493(99)00044-8","article-title":"A universal trapezoidation algorithm for planar polygons","volume":"23","author":"vZalik","year":"1999","journal-title":"Computers & Graphics"},{"key":"10.1016\/S0097-8493(01)00180-7_BIB2","unstructured":"Bern M. Handbook of discrete and computational geometry. Boca Raton, FL: CRC Press, 1997 [chapter 22] p. 413\u201328."},{"issue":"2","key":"10.1016\/S0097-8493(01)00180-7_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 Transactions Graphics"},{"issue":"2","key":"10.1016\/S0097-8493(01)00180-7_BIB4","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 Transactions Graphics"},{"issue":"1","key":"10.1016\/S0097-8493(01)00180-7_BIB5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0925-7721(91)90012-4","article-title":"A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons","volume":"1","author":"Seidel","year":"1991","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S0097-8493(01)00180-7_BIB6","series-title":"Computational geometry: an introduction through randomized algorithms","author":"Mulmuley","year":"1994"},{"key":"10.1016\/S0097-8493(01)00180-7_BIB7","series-title":"Computational geometry in C","author":"O'Rourke","year":"1993"},{"key":"10.1016\/S0097-8493(01)00180-7_BIB8","series-title":"Data structures, algorithms, and performance","author":"Wood","year":"1993"}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849301001807?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849301001807?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T17:18:42Z","timestamp":1758820722000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097849301001807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0097849301001807"],"URL":"https:\/\/doi.org\/10.1016\/s0097-8493(01)00180-7","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A fast trapezoidation technique for planar polygons","name":"articletitle","label":"Article Title"},{"value":"Computers & Graphics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0097-8493(01)00180-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}