33 search results - page 7 / 7 » Two Algorithms for Fast Reclustering of Dynamic Meshed Surfa... |
SI3D
2009
ACM
14 years 17 days ago
2009
ACM
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
CGF
1998
13 years 5 months ago
1998
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
EGH
2010
Springer
13 years 3 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...