Efficient Image-Space Shape Splatting for Monte Carlo Rendering

A typical Monte Carlo rendering method contributes one light path only to a single pixel at a time. Reusing light paths across multiple pixels, however, can amortize the cost and improve the efficiency. The state of the art of path reuse is to employ shift mapping to reduce the cost of path reuse, while its computation cost is still proportional to the number of pixels processed in shift mapping. We propose a general framework for efficiently reusing light paths to multiple pixels arranged in arbitrary two-dimensional shapes. Our shape is defined as a set of multiple pixels, and the framework allows us to reuse light paths among pixels in a shape faster than simply evaluating all pixels via shift mapping. The key idea is to sparsely evaluate the contribution of shifted paths at random pixels within the shape and interpolate the contribution to the other pixels. We apply a debiasing estimator to ensure unbiasedness. Our method can be integrated with many existing rendering methods and brings consistent improvement over its single-pixel counterpart.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Graphics
Published
2024-11-19
DOI
https://doi.org/10.1145/3687943
Citations
3
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
1.90

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Image-Space Shape Splatting for Monte Carlo Rendering

Xiaochun Tong, Toshiya Hachisuka
3 citations
ACM Transactions on Graphics
Computer Graphics and Visualization Techniques
1.90
article

Efficient Image-Space Shape Splatting for Monte Carlo Rendering

Xiaochun Tong, Toshiya Hachisuka
article en
3 citations

Abstract

A typical Monte Carlo rendering method contributes one light path only to a single pixel at a time. Reusing light paths across multiple pixels, however, can amortize the cost and improve the efficiency. The state of the art of path reuse is to employ shift mapping to reduce the cost of path reuse, while its computation cost is still proportional to the number of pixels processed in shift mapping. We propose a general framework for efficiently reusing light paths to multiple pixels arranged in arbitrary two-dimensional shapes. Our shape is defined as a set of multiple pixels, and the framework allows us to reuse light paths among pixels in a shape faster than simply evaluating all pixels via shift mapping. The key idea is to sparsely evaluate the contribution of shifted paths at random pixels within the shape and interpolate the contribution to the other pixels. We apply a debiasing estimator to ensure unbiasedness. Our method can be integrated with many existing rendering methods and brings consistent improvement over its single-pixel counterpart.

ACM Transactions on GraphicsVol. 43(6)
University of Waterloo (CA)
Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 8%
Computer Graphics and Visualization Techniques
1.90
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.

Efficient Image-Space Shape Splatting for Monte Carlo Rendering — Xiaochun Tong, Toshiya Hachisuka · ACM Transactions on Graphics (2024) | TGRS Research Map | TGRS