A self-shadow algorithm for dynamic hair using density clustering

  • Authors:
  • Tom Mertens;Jan Kautz;Philippe Bekaert;Frank Van Reeth

  • Affiliations:
  • Expertise Centre for Digital Media, Limburgs Universitair Centrum Universitaire Campus, Belgium;Massachusetts Institute of Technology, Cambridge, MA;Expertise Centre for Digital Media, Limburgs Universitair Centrum Universitaire Campus, Belgium;Expertise Centre for Digital Media, Limburgs Universitair Centrum Universitaire Campus, Belgium

  • Venue:
  • EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.