By Topic

Covering a Set of Points in a Plane Using Two Parallel Rectangles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Saha, C. ; Indian Inst. of Technol., Kanpur ; Das, S.

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(n3) time using O(n2) space. Without altering the complexity, our approach can be used to solve another optimization problem namely, to minimize the sum of the areas of two arbitrarily oriented parallel rectangles covering a given set of points in a plane

Published in:

Computing: Theory and Applications, 2007. ICCTA '07. International Conference on

Date of Conference:

5-7 March 2007