Towards real-time photorealistic rendering

Schilling, Andreas

doi:10.1145/258694.258701

Cited by 23 publications

(16 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The normal map pre-filtering methods [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], presented below, start from Hypothesis 1. Then (7) becomes:…”

Section: Hypothesesmentioning

confidence: 99%

“…Schilling [20] models the µNDF f A with a Gaussian. He represents it with the 2 × 2 covariance matrix of the micro-scale slopes, expressed in a tangent frame aligned with n, the average micro-scale normal.…”

Section: Single Lobe Algorithmsmentioning

confidence: 99%

“…This is necessary but not sufficient: the mesh details removed by the simplification must also be incorporated in the maps. Here the methods proposed by Becker et al [65] and Schilling [20] could be inspiring, although they start from a bump map instead of a mesh, as well as the ocean filtering method of Bruneton et al [63].…”

Section: Mesh Pre-filteringmentioning

confidence: 99%

See 2 more Smart Citations

A Survey of Nonlinear Prefiltering Methods for Efficient and Accurate Surface Shading

Bruneton

Neyret

2012

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Abstract-Rendering a complex surface accurately and without aliasing requires the evaluation of an integral for each pixel, namely a weighted average of the outgoing radiance over the pixel footprint on the surface. The outgoing radiance is itself given by a local illumination equation as a function of the incident radiance and of the surface properties. Computing all this numerically during rendering can be extremely costly. For efficiency, especially for real-time rendering, it is necessary to use precomputations. When the fine scale surface geometry, reflectance and illumination properties are specified with maps on a coarse mesh (such as color maps, normal maps, horizon maps or shadow maps), a frequently used simple idea is to pre-filter each map linearly and separately. The averaged outgoing radiance, i.e., the average of the values given by the local illumination equation is then estimated by applying this equation to the averaged surface parameters. But this is really not accurate because this equation is non-linear, due to self-occlusions, self-shadowing, non-linear reflectance functions, etc. Some methods use more complex pre-filtering algorithms to cope with these non-linear effects. This paper is a survey of these methods. We start with a general presentation of the problem of pre-filtering complex surfaces. We then present and classify the existing methods according to the approximations they make to tackle this difficult problem. Finally, an analysis of these methods allows us to highlight some generic tools to pre-filter maps used in non-linear functions, and to identify open issues to address the general problem.

show abstract

“…The normal map pre-filtering methods [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], presented below, start from Hypothesis 1. Then (7) becomes:…”

Section: Hypothesesmentioning

confidence: 99%

Section: Single Lobe Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

A Survey of Nonlinear Prefiltering Methods for Efficient and Accurate Surface Shading

Bruneton

Neyret

2012

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

show abstract

“…[Schilling 1997] described the lobe using covariance matrices, while [Olano and North 1997] mapped normal distributions consisting of a single 3D Gaussian. A simple GPU method is described in [Toksvig 2005].…”

Section: Normal Map Filteringmentioning

confidence: 99%

Frequency domain normal map filtering

Han

Sun

Ramamoorthi

et al. 2007

ACM SIGGRAPH 2007 Papers

View full text Add to dashboard Cite

Filtering is critical for representing detail, such as color textures or normal maps, across a variety of scales. While MIP-mapping texture maps is commonplace, accurate normal map filtering remains a challenging problem because of nonlinearities in shading-we cannot simply average nearby surface normals. In this paper, we show analytically that normal map filtering can be formalized as a spherical convolution of the normal distribution function (NDF) and the BRDF, for a large class of common BRDFs such as Lambertian, microfacet and factored measurements. This theoretical result explains many previous filtering techniques as special cases, and leads to a generalization to a broader class of measured and analytic BRDFs. Our practical algorithms leverage a significant body of work that has studied lighting-BRDF convolution. We show how spherical harmonics can be used to filter the NDF for Lambertian and low-frequency specular BRDFs, while spherical von Mises-Fisher distributions can be used for high-frequency materials. *

show abstract

“…, using the bump mapping operations described by Schilling [15]. The normal to the displacement map, ! "…”

Section: And Y Xmentioning

confidence: 99%

Adaptive view dependent tessellation of displacement maps

Doggett

Hirche

2000

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Workshop on Graphics Hardware

View full text Add to dashboard Cite

Displacement Mapping is an effective technique for encoding the high levels of detail found in today's triangle based surface models. Extending the hardware rendering pipeline to be capable of handling displacement maps as geometric primitives, will allow highly detailed models to be constructed without requiring large numbers of triangles to be passed from the CPU to the graphics pipeline. We present a new approach based on recursive tessellation that adapts to the surface complexity described by the displacement map. We also ensure that the resolution of the displaced mesh is tessellated with respect to the current view point. Our tessellation scheme performs all tests only on triangle edges to avoid generating cracks on the displaced surface. The main decision for vertex insertion is based on two comparisons involving the average height surrounding the vertices and the normals at the vertices. Individually, the tests will fail to tessellate a mesh satisfactorily, but their combination achieves good results.We propose several additions to the typical hardware rendering pipeline in order to achieve displacement map rendering in hardware. The mesh tessellation is placed within the rendering pipeline so that we can take advantage of the pre-existing vertex transformation units to perform the setup calculations for our view dependent test. Our method adds only simple arithmetic and comparison operations to the graphics pipeline and makes use of existing units for calculations wherever possible.

show abstract

Towards real-time photorealistic rendering

Cited by 23 publications

References 10 publications

A Survey of Nonlinear Prefiltering Methods for Efficient and Accurate Surface Shading

A Survey of Nonlinear Prefiltering Methods for Efficient and Accurate Surface Shading

Frequency domain normal map filtering

Adaptive view dependent tessellation of displacement maps

Contact Info

Product

Resources

About