Compressing Fluid Subspaces
| dc.contributor.author | Jones, Aaron Demby | en_US |
| dc.contributor.author | Sen, Pradeep | en_US |
| dc.contributor.author | Kim, Theodore | en_US |
| dc.contributor.editor | Ladislav Kavan and Chris Wojtan | en_US |
| dc.date.accessioned | 2016-07-10T12:51:52Z | |
| dc.date.available | 2016-07-10T12:51:52Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | Subspace fluid simulations, also known as reduced-order simulations, can be extremely fast, but also require basis matrices that consume an enormous amount of memory. Motivated by the extreme sparsity of Laplacian eigenfunctions in the frequency domain, we design a frequency-space codec that is capable of compressing basis matrices by up to an order of magnitude. However, if computed naïvely, decompression can be highly inefficient and dominate the running time, effectively negating the advantage of the subspace approach. We show how to significantly accelerate the decompressor by performing the key matrix-vector product in the sparse frequency domain. Subsequently, our codec only adds a factor of three or four to the overall runtime. The compression preserves the overall quality of the simulation, which we show in a variety of examples. | en_US |
| dc.description.sectionheaders | Flows | |
| dc.description.seriesinformation | Eurographics/ ACM SIGGRAPH Symposium on Computer Animation | |
| dc.identifier.doi | 10.2312/sca.20161225 | |
| dc.identifier.isbn | 978-3-03868-009-3 | |
| dc.identifier.issn | 1727-5288 | |
| dc.identifier.pages | 77-84 | |
| dc.identifier.uri | https://doi.org/10.2312/sca.20161225 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.2312/sca20161225 | |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | I.6.8 [Computer Graphics] | |
| dc.subject | Simulation and Modeling | |
| dc.subject | Types of Simulation | |
| dc.subject | Animation | |
| dc.subject | Computer Graphics | |
| dc.title | Compressing Fluid Subspaces | en_US |