3 search results - page 1 / 1 » cccg 1997 |
83
Voted
CCCG
1997
15 years 1 months ago
1997
103
click to vote
CCCG
1997
15 years 1 months ago
1997
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 follow...
CCCG
1997
15 years 1 months ago
1997
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...