{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T04:43:09Z","timestamp":1771562589023,"version":"3.50.1"},"reference-count":11,"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> Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pair of disjoint rectangles such that their union contains S and the area of the larger rectangle is minimized. In this paper we consider two variants of this optimization problem: (1) the rectangles are allowed to be reoriented freely while restricting them to be parallel to each other, and (2) one rectangle is restricted to be axis-parallel but the other rectangle is allowed to be reoriented freely. For both of the problems, we present O(n<jats:sup>2<\/jats:sup> log n)-time algorithms using O(n) space. <\/jats:p>","DOI":"10.1142\/s0218195911003676","type":"journal-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T15:33:53Z","timestamp":1309275233000},"page":"313-330","source":"Crossref","is-referenced-by-count":10,"title":["COVERING A POINT SET BY TWO DISJOINT RECTANGLES"],"prefix":"10.1142","volume":"21","author":[{"given":"SANG-SUB","family":"KIM","sequence":"first","affiliation":[{"name":"Graduate School for Information Technology, POSTECH, South Korea"}]},{"given":"SANG WON","family":"BAE","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Kyonggi University, South Korea"}]},{"given":"HEE-KAP","family":"AHN","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, POSTECH, South Korea"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1145\/299917.299918"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2009.02.006"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00093-4"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195999000042"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1137\/0213002"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1145\/360881.360919"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799348670"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00052-8"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794268649"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1145\/2157.322410"},{"key":"rf15","volume-title":"Davenport-Schinzel Sequences and their Geometric Applications","author":"Sarir M.","year":"1995"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195911003676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:23:54Z","timestamp":1565137434000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195911003676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":11,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,6]]}},"alternative-id":["10.1142\/S0218195911003676"],"URL":"https:\/\/doi.org\/10.1142\/s0218195911003676","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}