Adaptive Data Structure for Efficient Hair Collision Handling of Fine-Detailed Hair
Details
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.
