Stochastic Billboard Clouds for Interactive Foliage Rendering

Lacewell, J. Dylan; Edwards, David; Shirley, Peter; Thompson, William B.

doi:10.1080/2151237x.2006.10129213

Cited by 16 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Techniques such as sprites and billboard clouds [Décoret et al 2003;Lacewell et al 2006] allow reflectance from complex geometries to be properly pre-filtered and renderer at low cost but betray their lack of 3D information when viewed up close. Further, they do not encode surface attributes for dynamic shading and incur large storage cost for animated objects.…”

Section: Related Workmentioning

confidence: 99%

Aggregate G-buffer anti-aliasing

Crassin

McGuire

Fatahalian

et al. 2015

Proceedings of the 19th Symposium on Interactive 3D Graphics and Games

View full text Add to dashboard Cite

1 2 3 AGAA 8x MSAA Figure 1: Large image rendered with Agregate G-Buffer Anti-Aliasing (AGAA). The AGAA results (red outlines) shade only twice per pixel,give comparable results to the MSAA reference image shaded eight times per pixel, and use 33% less memory. AGAA reduces aliasing by prefiltering the scene's sub-pixel geometric detail (foliage, thin railings, etc.) into an aggregate G-buffer that models the distribution of geometry projecting into each pixel. AbstractWe present Aggregate G-Buffer Anti-Aliasing (AGAA), a new technique for efficient anti-aliased deferred rendering of complex geometry using modern graphics hardware. In geometrically complex situations, where many surfaces intersect a pixel, current rendering systems shade each contributing surface at least once per pixel. As the sample density and geometric complexity increase, the shading cost becomes prohibitive for real-time rendering. Under deferred shading, so does the required framebuffer memory. AGAA uses the rasterization pipeline to generate a compact, pre-filtered geometric representation inside each pixel. We then shade this at a fixed rate, independent of geometric complexity. By decoupling shading rate from geometric sampling rate, the algorithm reduces the storage and bandwidth costs of a geometry buffer, and allows scaling to high visibility sampling rates for anti-aliasing. AGAA with 2 aggregate surfaces per-pixel generates results comparable to 8x MSAA, but requires 30% less memory (45% savings for 16x MSAA), and is up to 1.3x faster.

show abstract

Section: Related Workmentioning

confidence: 99%

Aggregate G-buffer anti-aliasing

Crassin

McGuire

Fatahalian

et al. 2015

Proceedings of the 19th Symposium on Interactive 3D Graphics and Games

View full text Add to dashboard Cite

show abstract

“…Hough transform, Stochastic method (Lacewell et al, 2006) and K-means clustering algorithm (Huang, 2004) are well known methods for identifying planes for billboard clouds. The original method introduced by Décoret (Décoret et al, 2003) uses Hough transform and greedy method.…”

Section: Proposed Methodsmentioning

confidence: 99%

Simplification of Moving 3D Scene Data on GPU

Chenchu

Michiels

Rogmans

et al. 2016

Proceedings of the 13th International Joint Conference on E-Business and Telecommunications

View full text Add to dashboard Cite

Abstract:Real-time large scale continuous image and geometry based data visualization, with an uninterrupted content delivery, quality and rendering, on home and mobile devices is difficult or even mostly impossible because of the low processing capabilities of these hardware devices. However, a gracefully simplified version of the same data can enable us to view the content without significant quality degradation. To do this in a graceful manner, we extended a well-known concept -called 'billboard cloud' -for animated scene data and implemented this technique using the capabilities of the GPU to generate the simplified versions of large scale data sets.

show abstract

“…Billboard [6,7] is popular for real-time rendering because of its low costs. Billboard Clouds [8][9][10] directly analyzes tree models and simplify them into a set of textured planes. Stochastic simplification [11] is able to aggregate details by randomly sampling a subset of the geometric elements and altering them statistically to preserve the overall appearance.…”

Section: Introductionmentioning

confidence: 99%

GPU-based dynamic quad stream for forest rendering

Liu

Wei

Bao

2010

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Rendering large-scale forest scenes in real-time is a challenging problem, since the geometric complexity is far beyond the capabilities of current graphics hardware. In this paper, we propose a novel approach that adopts a dynamic quad stream residing on GPU buffers for view-dependent forest rendering. The incremental quad stream updating process is well-suited to the massively parallel architecture of the GPU pipeline, and it requires no continuous data exchange between CPU and GPU. The implementation of the algorithm is quite straightforward. Despite its simplicity, the algorithm achieves good performance with low memory, storage, and CPU costs.

show abstract

Stochastic Billboard Clouds for Interactive Foliage Rendering

Cited by 16 publications

References 15 publications

Aggregate G-buffer anti-aliasing

Aggregate G-buffer anti-aliasing

Simplification of Moving 3D Scene Data on GPU

GPU-based dynamic quad stream for forest rendering

Contact Info

Product

Resources

About