56 search results - page 3 / 12 » Smooth transitions between bump rendering algorithms |
141
Voted
CGF
2008
15 years 3 months ago
2008
In this paper we present a method for automatic interpolation between adjacent discrete levels of detail to achieve smooth LOD changes in image space. We achieve this by breaking ...
149
Voted
SIGGRAPH
1996
ACM
15 years 7 months ago
1996
ACM
Recent progress in acquiring shape from range data permits the acquisition of seamless million-polygon meshes from physical models. In this paper, we present an algorithm and syst...
130
Voted
AFRIGRAPH
2003
ACM
15 years 7 months ago
2003
ACM
We present a view-dependent level-of-detail algorithm for triangle meshes with subdivision connectivity. The algorithm is more suitable for textured meshes of arbitrary topology t...
103
Voted
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
123
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...