Covering a Point Set by Two Disjoint Rectangles

  • Hee-Kap Ahn
  • Sang Won Bae
Conference paper

DOI: 10.1007/978-3-540-92182-0_64

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5369)
Cite this paper as:
Ahn HK., Bae S.W. (2008) Covering a Point Set by Two Disjoint Rectangles. In: Hong SH., Nagamochi H., Fukunaga T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg

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(n2logn)-time algorithms using O(n) space.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Hee-Kap Ahn
    • 1
  • Sang Won Bae
    • 2
  1. 1.Department of Computer Science and EngineeringPOSTECHKorea
  2. 2.Division of Computer ScienceKAISTKorea

Personalised recommendations