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.

In this paper we assume that each label is an orthogonal rectangle of fixed size and we want to place as many labels as possible. More precisely, let S be a set ...

In this paper we assume that each label is an orthogonal rectangle of fixed size and we want to place as many labels as possible. More precisely, let S be a set ...

In this paper we assume that each label is an orthogonal rectangle of xed size and we want to place as many labels as possible. More precisely, let S be a set ...

Motivated by the problem of labeling maps, we investiage the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our ...

Label placement by maximum independent set in rectangles · Contents. Computational Geometry: Theory and Applications. Volume 11, Issue 3-4 · PREVIOUS ARTICLE.

The goal is to place labels on a map in a way that provides an unambiguous association between the features and the labels, and ensures that labels do not ...

Semantic Scholar extracted view of "Label placement by maximum independent set in rectangles" by P. Agarwal et al.

Agarwal, P. K., van Kreveld, M. J., & Suri, S. (1998). Label placement by maximum independent set in rectangles. Computational geometry, 11, 209-218.

We study the Maximum Independent Set of Rectangles. (MISR) problem: given a collection R of n axis-parallel rectangles, find a maximum-cardinality subset of ...