Adaptive Data Structure for Efficient Hair Collision Handling of Fine-Detailed Hair
スポンサーリンク
概要
- 論文の詳細を見る
We introduce an efficient hair collision handling for fine-detailed hair simulation systems. Recent fine-detailed hair simulation systems represent a hair strand as connected segments, but handling segment-based hair collisions is highly costly. In our method, we efficiently handle the collisions of a large number of hair segments by integrating an adaptive data structure of hair. A large number of hair segments are dynamically merged into a small number of groups during a simulation according to the orientations of hair segments. Our method efficiently handles collisions between groups of hair segments that have consistent orientations, reducing the computational cost significantly while preserving the detail of hair motion.
- 一般社団法人映像情報メディア学会の論文
- 2013-03-08
著者
-
NISHITA Tomoyuki
The University of Tokyo
-
KANAMORI Yoshihiro
University of Tsukuba
-
Rungjiratananon Witawat
The University of Tokyo
関連論文
- Real-Time Reflection and Refraction on a Per-Vertex Basis
- Deterministic Blue Noise Sampling by Solving Largest Empty Circle Problems
- Real-Time Line Drawing of 3D Models Taking into Account Curvature-Based Importance
- Visual Simulation of Solar Photosphere Based on Magnetohydrodynamics and Quantum Theory
- Interactive Composition of Seamless and Color-matched Images of Overlapping Objects
- Adaptive Data Structure for Efficient Hair Collision Handling of Fine-Detailed Hair
- A Simplified Plane-parallel Scattering Model for Rendering Densely Distributed Objects such as Foliage
- A Simplified Plane-parallel Scattering Model for Rendering Densely Distributed Objects such as Foliage
- Rendering Translucent Materials with Plane-parallel Solution