CCCG
1998
13 years 8 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 8 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 8 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 8 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 8 months ago
1998
CCCG
1998
13 years 8 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 8 months ago
1998
CCCG
1998
13 years 8 months ago
1998
Molecular surface computations are often necessary in order to perform synthetic drug design. A critical step in this process is the computation and update of an exact boundary re...