8 search results - page 2 / 2 » cccg 1998 |
CCCG
1998
13 years 6 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 6 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 6 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...