Sciweavers

72
Voted
CCCG
1997
14 years 10 months ago
On the number of internal and external visibility edges of polygons
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...
Jorge Urrutia
CCCG
1997
14 years 10 months ago
On folding rulers in regular polygons
Naixun Pei, Sue Whitesides
87
Voted
CCCG
1997
14 years 10 months ago
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 follow...
Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Su...