Sciweavers

RT
2004
Springer

A Self-Shadow Algorithm for Dynamic Hair using Density Clustering

13 years 10 months ago
A Self-Shadow Algorithm for Dynamic Hair using Density Clustering
Self-shadowing is an important factor in the appearance of hair and fur. In this paper we present a new rendering algorithm to accurately compute shadowed hair at interactive rates using graphics hardware. No constraint is imposed on the hair style, and its geometry can be dynamic. Similar to previously presented methods, a 1D visibility function is constructed for each line of sight of the light source view. Our approach differs from other work by treating the hair geometry as a 3D density field, which is sampled on the fly using simple rasterization. The rasterized fragments are clustered, effectively estimating the density of hair along a ray. Based hereon, the visibility function is constructed. We show that realistic selfshadowing of thousands of individual dynamic hair strands can be rendered at interactive rates using consumer graphics hardware. Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Color, shading, shadowing, and texture
Tom Mertens, Jan Kautz, Philippe Bekaert, Frank Va
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where RT
Authors Tom Mertens, Jan Kautz, Philippe Bekaert, Frank Van Reeth
Comments (0)