Parallelized incomplete poisson preconditioner in cloth simulation

4Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Efficient cloth simulation is an important problem for interactive applications that involve virtual humans, such as computer games. A common aspect of many methods that have been developed to simulate cloth is a linear system of equations, which is commonly solved using conjugate gradient or multi-grid approaches. In this paper, we introduce to the computer gaming community a recently proposed preconditioner, the incomplete Poisson preconditioner (IPP ), for conjugate gradient solvers. We show that IPP performs as well as the current state-of-the-art preconditioners, while being much more amenable to standard thread-level parallelism. We demonstrate our results on an 8-core Mac Pro and a 32-core Emerald Rigde system. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Sideris, C., Kapadia, M., & Faloutsos, P. (2011). Parallelized incomplete poisson preconditioner in cloth simulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7060 LNCS, pp. 389–399). Springer Verlag. https://doi.org/10.1007/978-3-642-25090-3_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free