Fast and Exact (Poisson) Solvers on Symmetric Geometries

In computer graphics, numerous geometry processing applications reduce to the solution of a Poisson equation. When considering geometries with symmetry, a natural question to consider is whether and how the symmetry can be leveraged to derive an efficient solver for the underlying system of linear e...

Full description

Saved in:
Bibliographic Details
Published inComputer graphics forum Vol. 34; no. 5; pp. 153 - 165
Main Author Kazhdan, M.
Format Journal Article
LanguageEnglish
Published Oxford Blackwell Publishing Ltd 01.08.2015
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In computer graphics, numerous geometry processing applications reduce to the solution of a Poisson equation. When considering geometries with symmetry, a natural question to consider is whether and how the symmetry can be leveraged to derive an efficient solver for the underlying system of linear equations. In this work we provide a simple representation‐theoretic analysis that demonstrates how symmetries of the geometry translate into block diagonalization of the linear operators and we show how this results in efficient linear solvers for surfaces of revolution with and without angular boundaries.
Bibliography:ark:/67375/WNG-KPSZL2N1-9
ArticleID:CGF12704
istex:40F2BB4F272B83ED17664EE9AC13B30A9878D86B
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12704