A Self-Shadow Algorithm for Dynamic Hair using Density Clustering

Mertens, Tom; Kautz, Jan; Bekaert, Philippe; Reeth, Frank Van

A Self-Shadow Algorithm for Dynamic Hair using Density Clustering

Files

173-178.pdf (3.47 MB)

Date

2004

Authors

Mertens, Tom
Kautz, Jan
Bekaert, Philippe
Reeth, Frank Van

Publisher

The Eurographics Association

Abstract

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.

        @inproceedings{10.2312:EGWR/EGSR04/173-178
,
booktitle = {Eurographics Workshop on Rendering
},
editor = {Alexander Keller and Henrik Wann Jensen
},
title = {{A Self-Shadow Algorithm for Dynamic Hair using Density Clustering
}},
author = {Mertens, Tom and 
Kautz, Jan and 
Bekaert, Philippe and 
Reeth, Frank Van
},
year = {2004
},
publisher = {The Eurographics Association
},
ISSN = {1727-3463
},
ISBN = {3-905673-12-6
},
DOI = {10.2312/EGWR/EGSR04/173-178
}
}