18 search results - page 1 / 4 » A Self-Shadow Algorithm for Dynamic Hair using Density Clust... |
RT
2004
Springer
13 years 10 months ago
2004
Springer
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 rate...
PG
2003
IEEE
13 years 10 months ago
2003
IEEE
We present a novel approach for adaptively grouping and subdividing hair using discrete level-of-detail (LOD) representations. The set of discrete LODs include hair strands, clust...
DIS
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
CIKM
2006
Springer
13 years 7 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
CGF
2008
13 years 5 months ago
2008
We present a new method for rapidly computing shadows from semi-transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a d...