2638 search results - page 53 / 528 » Random Geometric Complexes |
88
Voted
ISVC
2007
Springer
15 years 8 months ago
2007
Springer
Schlick’s approximation of the term xp is used primarily to reduce the complexity of specular lighting calculations in graphics applications. Since moment functions have a kernel...
115
Voted
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
115
Voted
VISUALIZATION
2002
IEEE
15 years 7 months ago
2002
IEEE
This paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approach...
112
click to vote
SI3D
1999
ACM
15 years 6 months ago
1999
ACM
We present a system for rendering very complex 3D models at interactive rates. We select a subset of the model as preferred viewpoints and partition the space into virtual cells. ...
157
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...