CCCG
1997
13 years 5 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
13 years 5 months ago
1997
CCCG
1997
13 years 5 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
1998
13 years 5 months ago
1998
Fast and efficient exploration of large terrains in a virtual reality manner requires different levels of detail to speedup processing of terrain parts in background. Thus, the tr...
CCCG
1998
13 years 5 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
CCCG
1998
13 years 5 months ago
1998
Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E2 , i.e., bounded intersection of halfplanes whose normal directions of edges belong to a
CCCG
1998
13 years 5 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
CCCG
1998
13 years 5 months ago
1998
CCCG
1998
13 years 5 months ago
1998
We show that three /6 vertex floodlights suffice to illuminate any triangle, and we prove that any quadrilateral can be illuminated by three /4 vertex floodlights.
CCCG
1998
13 years 5 months ago
1998