Visibility Silhouettes for Semi‐Analytic Spherical Integration

Nowrouzezahrai, Derek; Baran, Ilya; Mitchell, Kim; Jarosz, Wojciech

doi:10.1111/cgf.12257

Cited by 14 publications

(8 citation statements)

References 61 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We believe that it will be beneficial to continue investigate methods that are continuous in one or more domains, such as our method and the one proposed by Nowrouzezahrai et al [NBMJ13]. This type of algorithms is in its infancy, and so while the results are not yet fully competitive to point sampling, they could become so with more research in this field.…”

Section: Discussionmentioning

confidence: 95%

See 1 more Smart Citation

Time‐Continuous Quasi‐Monte Carlo Ray Tracing

Gribel

Akenine-Möller

2016

Computer Graphics Forum

View full text Add to dashboard Cite

Domain-continuous visibility determination algorithms have proved to be very efficient at reducing noise otherwise prevalent in stochastic sampling. Even though they come with an increased overhead in terms of geometrical tests and visibility information management, their analytical nature provides such a rich integral that the pay-off is often worth it. This paper presents a time-continuous, primary visibility algorithm for motion blur aimed at ray tracing. Two novel intersection tests are derived and implemented. The first is for ray versus moving triangle and the second for ray versus moving AABB intersection. A novel take on shading is presented as well, where the time continuum of visible geometry is adaptively point-sampled. Static geometry is handled using supplemental stochastic rays in order to reduce spatial aliasing. Finally, a prototype ray tracer with a full time-continuous traversal kernel is presented in detail. The results are based on a variety of test scenarios and show that even though our time-continuous algorithm has limitations, it outperforms multi-jittered quasi-Monte Carlo ray tracing in terms of image quality at equal rendering time, within wide sampling rate ranges.

show abstract

Section: Discussionmentioning

confidence: 95%

“…Nowrouzezahrai et al [NBMJ13] presented a framework for fast high-quality rendering. Contour edges were stored in a dual-space BVH and an integral of visibility-masked spherical visibility was computed over u-isolines over the sphere.…”

Section: Miscellaneousmentioning

confidence: 99%

Time‐Continuous Quasi‐Monte Carlo Ray Tracing

Gribel

Akenine-Möller

2016

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…These two methods aim for generating the shadows, rather than rendering the illumination from lighting environments. To utilize the idea of silhouette edges for the direct illumination, [30] evaluates the lighting with the 1D SAT model along the zenith lines.…”

Section: A Prt Methods and Summed Area Tablementioning

confidence: 99%

All Frequency Direct Illumination Using Visibility Correspondence Generated With Spherical Voronoi Diagrams

Leung

Wang

et al. 2021

IEEE Access

View full text Add to dashboard Cite

Vectorized visibility is a powerful visibility representation for rendering direct illumination with all frequency quality. However, the existing rendering method requires the visibility functions to be synthesized three times, followed with three radiance evaluation, for each triangle of the 3D model. We propose an alternative method to enhance vectorized visibility, such that we can directly interpolate the vectorized visibility, and therefore, reduce the computation bottleneck, i.e. the radiance evaluation, to just once. To facilitate the interpolation, we need to generate the correspondence among the three sampled visibility functions for each triangular patch. This paper uses spherical Voronoi diagram as a tool to conduct a preliminary correspondence generation, instead of doing brute force search. Additional treatments are also implemented to ensure that the interpolated visibility functions have smooth transition across the 3D model. With our method, we have more flexibility to manipulate the visibility functions in the favour of rendering speed and render the all frequency direct illumination twice as fast as the previous method.

show abstract

“…MC line sampling and analytic integration in rendering. Recently, researchers have increasingly started employing Monte Carlo‐like estimators using line or segment samples for rendering problems as diverse as anti‐aliased scan‐conversion [JP00; Max86; Max90], motion blur [GDA10], depth of field [TPD∗12], hair rendering [BGA12], volumetric [BJ17; GKH∗13; HCJ13; JNSJ11; JNT∗11; JZJ08; KGH∗14; NNDJ12a; NNDJ12b; SZLG10] and transient [JMM∗14; MGJ∗19; MJGJ17] light transport, and soft shadows from hemispherical [GBA11], area [BD16] or environment [NBMJ14] lights. We build most directly on the work of Billen and Dutré [BD16], who proposed an efficient intersection approach to evaluate shadow line samples, and coupled this with an analytic integration of the shading integrand along visible line segments.…”

Section: Related Workmentioning

confidence: 99%

“…We refer to standard texts [PJH16] on the subject, and instead focus on the less explored area of line sampling and its combination with points. [BD16] or environment [NBMJ14] lights. We build most directly on the work of Billen and Dutré [BD16], who proposed an efficient intersection approach to evaluate shadow line samples, and coupled this with an analytic integration of the shading integrand along visible line segments.…”

Section: Related Workmentioning

confidence: 99%

Combining Point and Line Samples for Direct Illumination

Salesin

Jarosz

2019

Computer Graphics Forum

Self Cite

View full text Add to dashboard Cite

We develop a unified framework for combining point and line samples in direct lighting calculations. While line samples have proven beneficial in a variety of rendering contexts, their application in direct lighting has been limited due to a lack of formulas for evaluating advanced BRDFs along a line and performance tied to the orientation of occluders in the scene. We lift these limitations by elevating line samples to a shared higher‐dimensional space with point samples. Our key insight is to separate the probability distribution functions of line samples and points that lie along a line sample. This simple conceptual change allows us to apply multiple importance sampling (MIS) between points and lines, and lines with each other, in order to leverage their respective strengths. We also show how to improve the convergence rate of MIS between points and lines in an unbiased way using a novel discontinuity‐smoothing balance heuristic. We verify through a set of rendering experiments that our proposed MISing of points and lines, and lines with each other, reduces variance of the direct lighting estimate while supporting an increased range of BSDFs compared to analytic line integration.

show abstract

Visibility Silhouettes for Semi‐Analytic Spherical Integration

Abstract: Abstract

Cited by 14 publications

References 61 publications

Time‐Continuous Quasi‐Monte Carlo Ray Tracing

Time‐Continuous Quasi‐Monte Carlo Ray Tracing

All Frequency Direct Illumination Using Visibility Correspondence Generated With Spherical Voronoi Diagrams

Combining Point and Line Samples for Direct Illumination

Contact Info

Product

Resources

About