Non-Polynomial Galerkin Projection of Deformable Scenes - Robotics Institute Carnegie Mellon University

Non-Polynomial Galerkin Projection of Deformable Scenes

M. Stanton, Y. Sheng, M. Wicke, F. Perazzi, A. Yuen, S. G. Narasimhan, and A. Treuille
Journal Article, ACM Transactions on Graphics (TOG), Vol. 32, No. 4, July, 2013

Abstract

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.

BibTeX

@article{Stanton-2013-120208,
author = {M. Stanton and Y. Sheng and M. Wicke and F. Perazzi and A. Yuen and S. G. Narasimhan and A. Treuille},
title = {Non-Polynomial Galerkin Projection of Deformable Scenes},
journal = {ACM Transactions on Graphics (TOG)},
year = {2013},
month = {July},
volume = {32},
number = {4},
}