Scalable Real-Time Shadows using Clustering and Metric Trees

François Deves, Frédéric Mora, Lilian Aveneau & Djamchid Ghazanfarpour
Real-time shadow algorithms based on geometry generally produce high quality shadows. Recent works have considerably improved their efficiency. However, scalability remains an issue because these methods strongly depend on the geometric complexity. This paper focuses on this problem. We present a new real-time shadow algorithm for non-deformable models that scales the geometric complexity. Our method groups triangles into clusters by precomputing bounding spheres or bounding capsules (line-swept spheres). At each frame, we build a ternary...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.