Covering a point set by two disjoint rectangles. (English) Zbl 1228.65089
The authors consider two variants of the following optimization problem: For a set \(S\) of \(n\) points in the plane, the two-rectangle covering problem is to find a pair of rectangles such that the union of the rectangles contains all the points in \(S\) and the area of the larger rectangle is minimized.
For both variants, the authors present \(O(n^2\log n)\)-time algorithms using \(O(n)\) space.
For both variants, the authors present \(O(n^2\log n)\)-time algorithms using \(O(n)\) space.
Reviewer: Hans Benker (Merseburg)
MSC:
| 65K05 | Numerical mathematical programming methods |
| 65D18 | Numerical aspects of computer graphics, image analysis, and computational geometry |
References:
| [1] | DOI: 10.1145/299917.299918 · doi:10.1145/299917.299918 |
| [2] | DOI: 10.1016/j.comgeo.2009.02.006 · Zbl 1175.49035 · doi:10.1016/j.comgeo.2009.02.006 |
| [3] | DOI: 10.1016/S0020-0190(00)00093-4 · Zbl 1338.68255 · doi:10.1016/S0020-0190(00)00093-4 |
| [4] | DOI: 10.1142/S0218195999000042 · Zbl 1026.65011 · doi:10.1142/S0218195999000042 |
| [5] | DOI: 10.1137/0213002 · Zbl 0537.68059 · doi:10.1137/0213002 |
| [6] | DOI: 10.1145/360881.360919 · Zbl 0308.68084 · doi:10.1145/360881.360919 |
| [7] | DOI: 10.1137/S0097539799348670 · Zbl 0994.68163 · doi:10.1137/S0097539799348670 |
| [8] | DOI: 10.1016/S0925-7721(99)00052-8 · Zbl 0952.68146 · doi:10.1016/S0925-7721(99)00052-8 |
| [9] | DOI: 10.1137/S0097539794268649 · Zbl 0888.68116 · doi:10.1137/S0097539794268649 |
| [10] | DOI: 10.1145/2157.322410 · Zbl 0627.68034 · doi:10.1145/2157.322410 |
| [11] | Sarir M., Davenport-Schinzel Sequences and their Geometric Applications (1995) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
