2008
DOI: 10.1111/j.1467-8659.2008.01256.x
|View full text |Cite
|
Sign up to set email alerts
|

Geometry‐Aware Framebuffer Level of Detail

Abstract: This paper introduces a framebuffer level of detail algorithm for controlling the pixel workload in an interactive rendering application. Our basic strategy is to evaluate the shading in a low resolution buffer and, in a second rendering pass, resample this buffer at the desired screen resolution. The size of the lower resolution buffer provides a trade-off between rendering time and the level of detail in the final shading. In order to reduce approximation error we use a feature-preserving reconstruction tech… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 28 publications
(30 citation statements)
references
References 19 publications
0
29
0
Order By: Relevance
“…Variable Shading Rates. Yang et al [2008] apply global levelof-detail per frame in a general real-time rendering system by rendering a subsampled image and using edge-preserving upsampling to the final resolution. Several earlier authors have also described adaptive subsampling and intelligent upsampling in particular use cases.…”
Section: Decoupled Shading and Reusementioning
confidence: 99%
“…Variable Shading Rates. Yang et al [2008] apply global levelof-detail per frame in a general real-time rendering system by rendering a subsampled image and using edge-preserving upsampling to the final resolution. Several earlier authors have also described adaptive subsampling and intelligent upsampling in particular use cases.…”
Section: Decoupled Shading and Reusementioning
confidence: 99%
“…In our case, however, we do not rely on random or error driven sparse pixel sampling, but we group pixel batches in sub-frames aligned on a quincunx lattice, in order to avoid destroying neighboring ray coherence. Our method also bears a number of similarities with interleaved sampling [20,23,10], which reconstructs a smooth approximation of some shading component from an estimate based on a subset of the pixels.…”
Section: Related Workmentioning
confidence: 99%
“…This effectively reduces the shading cost in a spatially consistent manner that facilitates upsampling. The newly shaded samples are upsampled as in Yang et al (2008), keeping the bilateral weights. Then the previously stored payload (with full resolution) is reprojected to the current frame, and blend with the upsampled new contribution using…”
Section: Spatio-temporal Upsamplingmentioning
confidence: 99%