Covering a set of points in a plane using two parallel rectangles

Authors:
Chandan Saha;Sandip Das
Affiliations:
Indian Institute of Technology Kanpur, Kanpur 208016, India;Indian Statistical Institute, Kolkata 700108, India
Venue:
Information Processing Letters
Year:
2009

Citing 4
Cited 1

Discrete rectilinear 2-center problems

Computational Geometry: Theory and Applications
Covering a set of points by two axis-parallel boxes

Information Processing Letters
Determining the minimum-area encasing rectangle for an arbitrary closed curve

Communications of the ACM
On some geometric selection and optimization problems via sorted matrices

Computational Geometry: Theory and Applications

Covering points by disjoint boxes with outliers

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we consider the problem of finding two parallel rectangles in arbitrary orientation for covering a given set of n points in a plane, such that the area of the larger rectangle is minimized. We propose an algorithm that solves the problem in O(n^3) time using O(n^2) space. Without altering the complexity, our approach can be used to solve another optimization problem namely, minimize the sum of the areas of two arbitrarily oriented parallel rectangles covering a given set of points in a plane.