Bounding Stratified Bernoulli Impulses for Ray Marching Gaussian Process Implicit Surfaces
Open Access
- 3 July 2026
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-15
Abstract
The theory of light transport on Gaussian process implicit surface (GPIS) provides a unified framework for rendering surfaces, participating media, and the intermediate spectrum. However, previous approaches rely on brute-force ray marching for surface intersections, requiring full noise evaluations at each marching point, whether using multivariate Gaussian sampling or sparse convolution noise approximation. This imposes a severe limitation on the rendering efficiency. In this paper, we derive bounds to significantly reduce the total number of full noise evaluations, leading to efficient ray marching for ray-surface intersections. We introduce stratified Bernoulli impulses, enabling a fast point-level bound for individual realizations to replace unnecessary full noise evaluations. To further reduce the number of point-level bound evaluations, we propose a region-level bound, leveraging a spatial acceleration structure to prune probabilistically empty regions, thereby avoiding unnecessary marching points in advance. By combining these two bounds, our bounded ray marching accelerates ray-surface intersections in GPIS, and consequently significantly improves overall GPIS rendering efficiency. Code for this paper are at https://github.com/Cchen-77/bounded-gpis.Keywords
Funding Information
- National Natural Science Foundation of China (62032011)
- Nanjing Major Science and Technology Special Projects (202209003)
- Fundamental and Interdisciplinary Disciplines Breakthrough Plan of the Ministry of Education of China (JYB2025XDXM118)
This publication has 30 references indexed in Scilit:
- Lipschitz Pruning: Hierarchical Simplification of Primitive‐Based SDFsComputer Graphics Forum, 2025
- Fast sphere tracing of procedural volumetric noise for very large and detailed scenesComputer Graphics Forum, 2025
- Generalized Lipschitz Tracing of Implicit SurfacesComputer Graphics Forum, 2024
- A unifying perspective on non-stationary kernels for deeper Gaussian processesAPL Machine Learning, 2024
- Segment Tracing Using Local Lipschitz BoundsComputer Graphics Forum, 2020
- Texton NoiseComputer Graphics Forum, 2017
- Gaussian process implicit surfaces for shape estimation and grasping2011
- Improving Gabor NoiseIEEE Transactions on Visualization and Computer Graphics, 2010
- Foundations of Modern Probability1997
- Sphere tracing: a geometric method for the antialiased ray tracing of implicit surfacesThe Visual Computer, 1996