Adaptive global visibility sampling

Bittner, Jiřı́; Mattausch, Oliver; Wonka, Peter; Havran, Vlastimil; Wimmer, Michael

doi:10.1145/1576246.1531400

Cited by 14 publications

(13 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar to from-point visibility, the sampling in from-region algorithms introduces spatial aliasing. In this case, the primitive D is marked as hidden even though there exists at least one ray from the view-region that reaches the primitive D. However, these methods are fast compared to exact and conservative from-region visibility algorithms and can easily be applied to complex models [34,35].…”

Section: From-region Visibilitymentioning

confidence: 99%

Fast and Accurate Geometric Sound Propagation Using Visibility Computations

et al. 2011

View full text Add to dashboard Cite

Geometric Acoustics (GA) techniques based on the image-source method, ray tracing, beam tracing, and ray-frustum tracing, are widely used to compute sound propagation paths. In this paper, we highlight the connection between these propagation techniques with the research on visibility computation in computer graphics and computational geometry. We give a brief overview of visibility algorithms and apply some of these methods to accelerate GA, specifically early specular reflections and finite-edge diffraction. Moreover, we survey our recent work on fast and accurate GA methods that use accurate and conservative visibility techniques. This includes: a) an algorithm for fast computation of early specular reflections using conservative from-point visibility computation; and b) a fast method for finite-edge diffraction using conservative from-region visibility computation. Our approach for computing specular reflections is based on the image-source method and we reduce the number of image sources by using conservative visibility computations. The edge diffraction computation is based on the well known Biot-Tolstoy-Medwin (BTM) diffraction model and we combine it with efficient algorithms for region-based visibility to significantly reduce the number of edge pairs that need to be processed for higher-order diffraction computation. We highlight the performance of these methods on many complex models. Our initial results indicate that we obtain considerable speedups over prior methods for accurate geometric sound propagation. ISRA 2010

show abstract

Section: From-region Visibilitymentioning

confidence: 99%

Fast and Accurate Geometric Sound Propagation Using Visibility Computations

et al. 2011

View full text Add to dashboard Cite

show abstract

“… Comparison of view frustum culling (VFC), view frustum culling and potentially visible sets (VFC+PVS), and online visibility culling using CHC++ [ BMW*09 ]. …”

Section: Applicationsmentioning

confidence: 99%

Temporal Coherence Methods in Real‐Time Rendering

Scherzer¹,

Yang²,

Mattausch³

et al. 2012

Computer Graphics Forum

Self Cite

View full text Add to dashboard Cite

Nowadays, there is a strong trend towards rendering to higher‐resolution displays and at high frame rates. This development aims at delivering more detail and better accuracy, but it also comes at a significant cost. Although graphics cards continue to evolve with an ever‐increasing amount of computational power, the speed gain is easily counteracted by increasingly complex and sophisticated shading computations. For real‐time applications, the direct consequence is that image resolution and temporal resolution are often the first candidates to bow to the performance constraints (e.g. although full HD is possible, PS3 and XBox often render at lower resolutions). In order to achieve high‐quality rendering at a lower cost, one can exploit temporal coherence (TC). The underlying observation is that a higher resolution and frame rate do not necessarily imply a much higher workload, but a larger amount of redundancy and a higher potential for amortizing rendering over several frames. In this survey, we investigate methods that make use of this principle and provide practical and theoretical advice on how to exploit TC for performance optimization. These methods not only allow incorporating more computationally intensive shading effects into many existing applications, but also offer exciting opportunities for extending high‐end graphics applications to lower‐spec consumer‐level hardware. To this end, we first introduce the notion and main concepts of TC, including an overview of historical methods. We then describe a general approach, image‐space reprojection, with several implementation algorithms that facilitate reusing shading information across adjacent frames. We also discuss data‐reuse quality and performance related to reprojection techniques. Finally, in the second half of this survey, we demonstrate various applications that exploit TC in real‐time rendering.

show abstract

“…with those queries known before the start of the algorithm. This has been tested with a performance gain between 5% and 12% by Bittner et al [BMW*09], although the results depended strongly on the architecture and the compiler.…”

Section: Latency‐aware Motivated Modificationsmentioning

confidence: 99%

Review: Kd‐tree Traversal Algorithms for Ray Tracing

Hapala

Havran

2011

Computer Graphics Forum

View full text Add to dashboard Cite

In this paper we review the traversal algorithms for kd-trees for ray tracing. Ordinary traversal algorithms such as sequential, recursive, and those with neighbour-links have different limitations, which led to several new developments within the last decade. We describe algorithms exploiting ray coherence and algorithms designed with specific hardware architecture limitations such as memory latency and consumption in mind. We also discuss the robustness of traversal algorithms as one issue that has been neglected in previous research.

show abstract

Adaptive global visibility sampling

Cited by 14 publications

References 27 publications

Fast and Accurate Geometric Sound Propagation Using Visibility Computations

Fast and Accurate Geometric Sound Propagation Using Visibility Computations

Temporal Coherence Methods in Real‐Time Rendering

Review: Kd‐tree Traversal Algorithms for Ray Tracing

Contact Info

Product

Resources

About