“A Self-Shadow Algorithm for Dynamic Hair using Density Clustering” by Mertens, Kautz, Bekaert and Reeth
Conference:
Type:
Title:
- A Self-Shadow Algorithm for Dynamic Hair using Density Clustering
Presenter(s)/Author(s):
Abstract:
We present a novel approach to rendering self-shadows for dynamic hair. Using programmable consumer graphics hardware, thousands of moving, individual hair strands can be rendered at interactive frame rates. Since we do not impose any constraints on the hair — hair is defined as a collection of line segments — any hair style can be given as input. The key innovation in our approach is the use of clustering.
References:
Kim, T.-Y., and Neumann, U. 2001. Opacity Shadow Maps. In Proceedings of the Eurographics Workshop on Rendering, 177–182.
Lokovic, T., and Veach, E. 2000. Deep Shadow Maps. In Proceedings of SIGGRAPH 2000, 385–392.
