56 search results - page 3 / 12 » Smooth transitions between bump rendering algorithms |
CGF
2008
13 years 8 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 ...
SIGGRAPH
1996
ACM
14 years 1 days 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...
AFRIGRAPH
2003
ACM
13 years 11 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...
FOCS
1993
IEEE
14 years 1 days 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 ...
ICML
2007
IEEE
14 years 8 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...