Good vibrations: modal dynamics for graphics and animation
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Design and simulation of opera lighting and projection effects
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
A rapid hierarchical radiosity algorithm
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Galerkin radiosity: a higher order solution method for global illumination
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Realistic animation of liquids
Graphical Models and Image Processing
Interactive update of global illumination using a line-space hierarchy
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
DyRT: dynamic response textures for real time deformation simulation with graphics hardware
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Modeling the interaction of light between diffuse surfaces
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Precomputing interactive dynamic deformable scenes
ACM SIGGRAPH 2003 Papers
Physically Based Rendering: From Theory to Implementation
Physically Based Rendering: From Theory to Implementation
Numerical Challenges in the Use of Polynomial Chaos Representations for Stochastic Processes
SIAM Journal on Scientific Computing
Animating gases with hybrid meshes
ACM SIGGRAPH 2005 Papers
Real-Time subspace integration for St. Venant-Kirchhoff deformable models
ACM SIGGRAPH 2005 Papers
Local, deformable precomputed radiance transfer
ACM SIGGRAPH 2005 Papers
Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation
Fluid animation with dynamic meshes
ACM SIGGRAPH 2006 Papers
Model reduction for real-time fluids
ACM SIGGRAPH 2006 Papers
Stable, circulation-preserving, simplicial fluids
ACM Transactions on Graphics (TOG)
SCA '07 Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation
Real-time control of physically based simulations using gentle forces
ACM SIGGRAPH Asia 2008 papers
Optimizing cubature for efficient integration of subspace deformations
ACM SIGGRAPH Asia 2008 papers
Energy-preserving integrators for fluid animation
ACM SIGGRAPH 2009 papers
Modular bases for fluid dynamics
ACM SIGGRAPH 2009 papers
Harmonic shells: a practical nonlinear sound model for near-rigid thin shells
ACM SIGGRAPH Asia 2009 papers
Skipping steps in deformable simulation with online model reduction
ACM SIGGRAPH Asia 2009 papers
Physics-based character skinning using multi-domain subspace deformations
SCA '11 Proceedings of the 2011 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Proceedings of the 2011 SIGGRAPH Asia Conference
Fluid simulation using Laplacian eigenfunctions
ACM Transactions on Graphics (TOG)
I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Fast fluid simulation using residual distribution schemes
NPH'07 Proceedings of the Third Eurographics conference on Natural Phenomena
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
| Hi-index | 0.00 |
This paper extends Galerkin projection to a large class of non-polynomial functions typically encountered in graphics. We demonstrate the broad applicability of our approach by applying it to two strikingly different problems: fluid simulation and radiosity rendering, both using deforming meshes. Standard Galerkin projection cannot efficiently approximate these phenomena. Our approach, by contrast, enables the compact representation and approximation of these complex non-polynomial systems, including quotients and roots of polynomials. We rely on representing each function to be model-reduced as a composition of tensor products, matrix inversions, and matrix roots. Once a function has been represented in this form, it can be easily model-reduced, and its reduced form can be evaluated with time and memory costs dependent only on the dimension of the reduced space.