A Self-Shadow Algorithm for Dynamic Hair using Density Clustering
Tom Mertens, Jan Kautz, Philippe Bekaert, Frank Van Reeth
, June 2004, pp. 173--178.
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 eld, 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.
BibTeX format:
@inproceedings{Mertens:2004:ASA,
  author = {Tom Mertens and Jan Kautz and Philippe Bekaert and Frank Van Reeth},
  title = {A Self-Shadow Algorithm for Dynamic Hair using Density Clustering},
  booktitle = {},
  pages = {173--178},
  month = jun,
  year = {2004},
}
Search for more articles by Tom Mertens.
Search for more articles by Jan Kautz.
Search for more articles by Philippe Bekaert.
Search for more articles by Frank Van Reeth.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."