Label placement by maximum independent set in rectangles

Motivated by the problem of labeling maps, we investigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follows. In Onlogn time, we can nd an Ologn-factor approximation of the maximum subset in a set of n arbitrary axis-parallel rectangles in the plane. If all rectangles have unit height, we can nd a 2-approximation in Onlogn time. Extending this result, we obtain a 1 + 1 k -approximation in time Onlogn + n2k,1 time, for

• Type: Conference
• Year: 1997
• Where: CCCG
• Authors: Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri
• Keywords: CCCG 1997, CCCG 2007, Large Non-intersecting Subset, Onlogn Time, Rectangles