Efficient Open-Boundary Poisson Solves

Poisson equations arise pervasively in computer graphics, yet efficiently solving them on unbounded domains remains a long-standing challenge. Existing approaches attempting to model boundary conditions at infinity either incur prohibitive computational costs by expanding the simulation domain, sacrifice accuracy through artificial boundary conditions, or lack the flexibility to handle varying coefficients. In this paper, we introduce a simple and practical method for solving generalized Poisson equations on finite domains with open boundaries, enabling exact enforcement of asymptotic conditions at infinity. Our method couples a finite-volume interior solver with a boundary-element formulation of the exterior problem, enforcing continuity of both the solution and its normal derivative across an artificial boundary. Inspired by Johnson-Nédélec coupling and interface relaxation, we develop a partitioned, iterative scheme based on damped fixed-point iterations, which leverages fast, inexact boundary-element solves for the exterior problem and efficient sparse solves for the interior. Theoretical analysis and empirical tests confirm that our method provides superior accuracy and performance compared to existing ad-hoc solutions across a variety of graphics applications.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Graphics
Published
2026-11-09
DOI
https://doi.org/10.1145/3842558
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Efficient Open-Boundary Poisson Solves

Taku Komura, Xingyu Ni, Jiong Chen, Caoliwen Wang et al.
1 links
ACM Transactions on Graphics
Computer Graphics and Visualization Techniques
article

Efficient Open-Boundary Poisson Solves

Taku Komura, Xingyu Ni, Jiong Chen, Caoliwen Wang, Siyuan Chen, Mathieu Desbrun
article en

Abstract

Poisson equations arise pervasively in computer graphics, yet efficiently solving them on unbounded domains remains a long-standing challenge. Existing approaches attempting to model boundary conditions at infinity either incur prohibitive computational costs by expanding the simulation domain, sacrifice accuracy through artificial boundary conditions, or lack the flexibility to handle varying coefficients. In this paper, we introduce a simple and practical method for solving generalized Poisson equations on finite domains with open boundaries, enabling exact enforcement of asymptotic conditions at infinity. Our method couples a finite-volume interior solver with a boundary-element formulation of the exterior problem, enforcing continuity of both the solution and its normal derivative across an artificial boundary. Inspired by Johnson-Nédélec coupling and interface relaxation, we develop a partitioned, iterative scheme based on damped fixed-point iterations, which leverages fast, inexact boundary-element solves for the exterior problem and efficient sparse solves for the interior. Theoretical analysis and empirical tests confirm that our method provides superior accuracy and performance compared to existing ad-hoc solutions across a variety of graphics applications.

ACM Transactions on GraphicsVol. 45(6)
Institut national de recherche en sciences et technologies du numérique (FR), University of British Columbia (CA), École Polytechnique (FR), University of Hong Kong (HK)
Computer Graphics and Visualization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon