{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:28:51Z","timestamp":1648578531894},"reference-count":4,"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":[[2011,6]]},"abstract":"<jats:p> We show that an arrangement [Formula: see text] of n lines in general position in the plane has an inducing polygon of size O(n). Additionally, we present a simple algorithm for finding an inducing n-path for [Formula: see text] in O(n log n) time and an algorithm that constructs an inducing n-gon for a special class of line arrangements within the same time bound. <\/jats:p>","DOI":"10.1142\/s021819591100369x","type":"journal-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T11:33:53Z","timestamp":1309260833000},"page":"351-368","source":"Crossref","is-referenced-by-count":0,"title":["INDUCING POLYGONS OF LINE ARRANGEMENTS"],"prefix":"10.1142","volume":"21","author":[{"given":"LUDMILA","family":"SCHARF","sequence":"first","affiliation":[{"name":"Institute of Computer Science, Freie Universit\u00e4t Berlin, Takustr. 9, 14195 Berlin, Germany"}]},{"given":"MARC","family":"SCHERFENBERG","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Freie Universit\u00e4t Berlin, Takustr. 9, 14195 Berlin, Germany"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195903001281"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0040"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03427-9"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01994880"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021819591100369X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:23:56Z","timestamp":1565123036000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021819591100369X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":4,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,6]]}},"alternative-id":["10.1142\/S021819591100369X"],"URL":"https:\/\/doi.org\/10.1142\/s021819591100369x","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}