{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:33:31Z","timestamp":1676961211792},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2009,12]]},"abstract":"<jats:p> We describe an O(n<jats:sup>2<\/jats:sup>)-time algorithm for computing a minimum-area convex polygon that intersects a set of n isothetic line segments. <\/jats:p>","DOI":"10.1142\/s021819590900312x","type":"journal-article","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T10:22:17Z","timestamp":1262859737000},"page":"557-577","source":"Crossref","is-referenced-by-count":3,"title":["ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA"],"prefix":"10.1142","volume":"19","author":[{"given":"ASISH","family":"MUKHOPADHYAY","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Windsor, 401 Sunset Avenue, Windsor, ON N9B 3P4, Canada"}]},{"given":"EUGENE","family":"GREENE","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Windsor, 401 Sunset Avenue, Windsor, ON N9B 3P4, Canada"}]},{"given":"S. V.","family":"RAO","sequence":"additional","affiliation":[{"name":"Department of Comp. Sc. and Engg., IIT Guwahati, Guwahati, Assam 781039, India"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume":"21","author":"O'Rourke","journal-title":"SIGGRAPHB: Computer Graphics (SIGGRAPH)"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(90)90135-I"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.08.029"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195995000143"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934440"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021819590900312X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:24:10Z","timestamp":1565137450000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021819590900312X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":5,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2009,12]]}},"alternative-id":["10.1142\/S021819590900312X"],"URL":"https:\/\/doi.org\/10.1142\/s021819590900312x","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}