DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn H.-K. | ko |
dc.contributor.author | Bae S.W. | ko |
dc.date.accessioned | 2013-03-26T01:20:26Z | - |
dc.date.available | 2013-03-26T01:20:26Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2008-12-15 | - |
dc.identifier.citation | 19th International Symposium on Algorithms and Computation, ISAAC 2008, pp.728 - 739 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/156728 | - |
dc.description.abstract | 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 free to rotate but must remain parallel to each other, and (2) one rectangle is axis-parallel but the other rectangle is allowed to have an arbitrary orientation. For both of the problems, we present O(n(2) log n)-time algorithms using O(n) space. | - |
dc.language | English | - |
dc.publisher | ISAAC Committee | - |
dc.title | Covering a point set by two disjoint rectangles | - |
dc.type | Conference | - |
dc.identifier.wosid | 000264205500061 | - |
dc.identifier.scopusid | 2-s2.0-58549115112 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 728 | - |
dc.citation.endingpage | 739 | - |
dc.citation.publicationname | 19th International Symposium on Algorithms and Computation, ISAAC 2008 | - |
dc.identifier.conferencecountry | AT | - |
dc.identifier.conferencelocation | Gold Coast, QLD | - |
dc.identifier.doi | 10.1007/978-3-540-92182-0_64 | - |
dc.contributor.nonIdAuthor | Bae S.W. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.