Cloth Simulation Using AABB Hierarchies and GPU Parallelism

Frizzi Alejandra San Roman Salazar, Bruno Brandoli Machado, Alexander Victor Ocsa Mamani, Maria Cristina Ferreira de Oliveira
Math. & Comput. Sci. Inst. (ICMC), Sao Paulo Univ., Sao Carlos, Brazil
Brazilian Symposium on Games and Digital Entertainment (SBGAMES), 2010


   author={Frizzi Alejandra San Roman Salazar and Bruno Brandoli Machado and Alexander Victor Ocsa Mamani and Maria Cristina Ferreira de Oliveira},

   title={Cloth Simulation Using AABB Hierarchies and GPU Parallelism},

   journal={Games and Digital Entertainment, Brazilian Symposium on},






   publisher={IEEE Computer Society},

   address={Los Alamitos, CA, USA}


Source Source   



Providing realistic, high-resolution and high fidelity representation of motions ia essential in the cloth simulation problem. In order to make high resolution simulations tractable, several algorithms have been developed that manage cloth-object interactions efficiently through specialized data structures such as AABB trees. However, implementation restrictions on single CPU architectures impose certain limits on quality and performance in high-demanding simulations, motivating the study of new implementation techniques. In this paper we address several critical issues in high resolution cloth simulation, enabling us to represent and simulate intricate folds and wrinkles. We employ AABB hierarchies to optimize detection and response in cloth-object collisions. By employing a multi-processor approach on multi-threaded CPU and an emerging multi-core GPU-CUDA architecture, we quantitatively evaluate the workload and computational effort of the cloth simulation application. In addition to this quantitative performance evaluation on multi-processor architectures we illustrate the potential of our approach by presenting a variety of high-quality and high-resolution simulations of cloth behavior under different cloth-object interactions.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: