EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Boundary Value Caching for Walk on Spheres

Bailey Miller, Rohan Sawhney, Keenan Crane, Ioannis Gkioulekas

ACM Transactions on Graphics · 2023-08 · 42 (4) · 1-11

DOI: 10.1145/3592400 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Graphics, online erschienen am 26.07.2023. Verfasst von Bailey Miller und 3 weiteren Autor:innen. Die Arbeit wurde bisher 34-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation, Alfred P. Sloan Research Fellowship, National Science Foundation Graduate Research Fellowship Program.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Grid-free Monte Carlo methods such as walk on spheres can be used to solve elliptic partial differential equations without mesh generation or global solves. However, such methods independently estimate the solution at every point, and hence do not take advantage of the high spatial regularity of solutions to elliptic problems. We propose a fast caching strategy which first estimates solution values and derivatives at randomly sampled points along the boundary of the domain (or a local region of interest). These cached values then provide cheap, output-sensitive evaluation of the solution (or its gradient) at interior points, via a boundary integral formulation. Unlike classic boundary integral methods, our caching scheme introduces zero statistical bias and does not require a dense global solve. Moreover we can handle imperfect geometry (e.g., with self-intersections) and detailed boundary/source terms without repairing or resampling the boundary representation. Overall, our scheme is similar in spirit to virtual point light methods from photorealistic rendering: it suppresses the typical salt-and-pepper noise characteristic of independent Monte Carlo estimates, while still retaining the many advantages of Monte Carlo solvers: progressive evaluation, trivial parallelization, geometric robustness, etc. We validate our approach using test problems from visual and geometric computing.

Förderung

  • National Science Foundation
  • Alfred P. Sloan Research Fellowship
  • National Science Foundation Graduate Research Fellowship Program

Zitieren

APA

Miller, B., Sawhney, R., Crane, K., & Gkioulekas, I. (2023). Boundary Value Caching for Walk on Spheres. ACM Transactions on Graphics, 42(4), 1-11. https://doi.org/10.1145/3592400

Vancouver

Miller B, Sawhney R, Crane K, Gkioulekas I. Boundary Value Caching for Walk on Spheres. ACM Transactions on Graphics. 2023;42(4):1-11. doi:10.1145/3592400

BibTeX
@article{Miller2023,
  author = {Miller, Bailey and Sawhney, Rohan and Crane, Keenan and Gkioulekas, Ioannis},
  title = {Boundary Value Caching for Walk on Spheres},
  journal = {ACM Transactions on Graphics},
  year = {2023},
  volume = {42},
  number = {4},
  pages = {1--11},
  doi = {10.1145/3592400}
}
Kostenlos starten →