{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T17:49:58Z","timestamp":1789926598601,"version":"4.0.1"},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2002,6]]},"abstract":"<jats:p> We show that a decomposition of a simple polygon having n vertices, r of which are reflex, into a minimum number of convex regions without the addition of Steiner vertices can be computed in O(n + r<jats:sup>2<\/jats:sup> min {r<jats:sup>2<\/jats:sup>, n}) time and space. A Java demo is available at . <\/jats:p>","DOI":"10.1142\/s0218195902000803","type":"journal-article","created":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T20:07:50Z","timestamp":1033502870000},"page":"181-192","source":"Crossref","is-referenced-by-count":42,"title":["ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS"],"prefix":"10.1142","volume":"12","author":[{"given":"MARK","family":"KEIL","sequence":"first","affiliation":[{"name":"Department of Computer Science,  University of Saskatchewan, 57 Campus Drive, Saskatoon, Saskatchewan, Canada S7N 5A9, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"JACK","family":"SNOEYINK","sequence":"additional","affiliation":[{"name":"Department of Computer Science,  University of North Carolina, Sitterson Hall, Chapel Hill,  NC 27599-3175, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01377183"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187747"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90019-5"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80044-9"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1137\/0214056"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195902000803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:28:22Z","timestamp":1565137702000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195902000803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":5,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,6]]}},"alternative-id":["10.1142\/S0218195902000803"],"URL":"https:\/\/doi.org\/10.1142\/s0218195902000803","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}