Show simple item record

dc.contributor.authorJones, Aaron Dembyen_US
dc.contributor.authorSen, Pradeepen_US
dc.contributor.authorKim, Theodoreen_US
dc.contributor.editorLadislav Kavan and Chris Wojtanen_US
dc.date.accessioned2016-07-10T12:51:52Z
dc.date.available2016-07-10T12:51:52Z
dc.date.issued2016
dc.identifier.isbn978-3-03868-009-3
dc.identifier.issn1727-5288
dc.identifier.urihttp://dx.doi.org/10.2312/sca.20161225
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/sca20161225
dc.description.abstractSubspace 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.publisherThe Eurographics Associationen_US
dc.subjectI.6.8 [Computer Graphics]
dc.subjectSimulation and Modeling
dc.subjectTypes of Simulation
dc.subjectAnimation
dc.subjectComputer Graphics
dc.titleCompressing Fluid Subspacesen_US
dc.description.seriesinformationEurographics/ ACM SIGGRAPH Symposium on Computer Animation
dc.description.sectionheadersFlows
dc.identifier.doi10.2312/sca.20161225
dc.identifier.pages77-84


Files in this item

Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record