78
Voted
CCCG
1997
14 years 11 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...
CCCG
1997
14 years 11 months ago
1997
89
Voted
CCCG
1997
14 years 11 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...