Environment Mapping and Other Applications of World Projections

@article{Greene1986EnvironmentMA,
  title={Environment Mapping and Other Applications of World Projections},
  author={Ned Greene},
  journal={IEEE Computer Graphics and Applications},
  year={1986},
  volume={6},
  pages={21-29}
}
  • Ned Greene
  • Published 1 November 1986
  • Environmental Science
  • IEEE Computer Graphics and Applications
Various techniques have been developed that employ projections of the world as seen from a particular viewpoint. [] Key Method Surface shading and texture filtering are discussed in the context of environment mapping, and methods are presented for obtaining diffuse and specular surface illumination from prefiltered environment maps. Comparisons are made with ray tracing, noting that two problems with ray tracing¿obtaining diffuse reflection and antialiasing specular reflection¿can be handled effectively by…

Real-time environment map interpolation

This paper presents an approach that sparsely samples environment maps of a moving object and rapidly interpolates them for high performance, and two techniques are introduced for fast environment map interpolation without computation of scene shading.

Environment Mapping for Efficient Sampling of the Diffuse Interreflection

Environment mapping is introduced to reduce the amount of computations involved in tracing secondary rays during rendering, instead of tracing the secondary rays all through the scene, values are taken from the maps for the rays that would otherwise hit distant objects.

Spherical environment maps for image-based rendering

A novel method for reconstructing views from a set of precaptured images that provides correct parallax information from the particular viewpoint and, therefore, enable occluded regions to be viewed.

Parameterized environment maps

Static environment maps fail to capture local reflections including effects like selfreflections and parallax in the reflected imagery. We instead propose parameterized environment maps (PEMs), a set

Indirect diffuse and glossy illumination on the GPU

A fast approximation method to obtain the indirect diffuse or glossy reflection on a dynamic object, caused by a diffuse or a moderately glossy environment, and suits very well to the GPU architecture, and can render these effects interactively.

Light field rendering

This paper describes a sampled representation for light fields that allows for both efficient creation and display of inward and outward looking views, and describes a compression system that is able to compress the light fields generated by more than a factor of 100:1 with very little loss of fidelity.

Capturing The Light

A basic IBL example using the freely available Radiance global illumination renderer to illuminate a simple scene with several different lighting environments and shows an example of an object illuminated entirely using IBL.

Image-based rendering of diffuse, specular and glossy surfaces from a single image

A new method to recover an approximation of the bidirectional reflectance distribution function (BRDF) of the surfaces present in a real scene from a single photograph and a 3D geometric model of the scene is presented.

Interactive Rendering with Real-World Illumination

A new procedure for approximating shadows cast by the real-world illumination using standard hardware-based shadow mapping, and a novel image composition algorithm that uses frame-buffer hardware to correctly overlay the synthetic objects and their shadows onto the background image are presented.

Exploiting Sphere Mapping

  • R. Bastos
  • Mathematics, Environmental Science
  • 2010
Sphere mapping is a useful tool for creating realistic computer-generated images. It is currently the only view-dependent texture mapping technique widely supported in hardware. Understanding how
...

References

SHOWING 1-10 OF 22 REFERENCES

Illumination and Reflection Maps : Simulated Objects in Simulated and Real Environments Gene

Blinn and Newell introduced reflection maps for computer simulated mirror highlights. This paper extends their method to cover a wider class of reflectance models. Panoramic images of real, painted

Creating Raster Omnimax Images from Multiple Perspective Views Using the Elliptical Weighted Average Filter

This application presents a method for creating Omnimax projections from multiple perspective views, and uses a space-variant filter for this application that computes a weighted average over an arbitrarily oriented elliptical area.

Pyramidal parametrics

This paper advances a “pyramidal parametric” prefiltering and sampling geometry which minimizes aliasing effects and assures continuity within and between target images.

An improved illumination model for shaded display

Consideration of all of these factors allows the shader to accurately simulate true reflection, shadows, and refraction, as well as the effects simulated by conventional shaders.

Survey of Texture Mapping

The fundamentals of texture mapping are surveyed, which can be spilt into two topics: the geometric mapping that warps a texture onto a surface, and the filtering necessary to avoid aliasing.

Distributed ray tracing

Motion blur and depth of field calculations can be integrated with the visible surface calculations, avoiding the problems found in previous methods.

A Reflectance Model for Computer Graphics

A new reflectance model for rendering computer synthesized images that describes the directional distribution of the reflected light and a color shift that occurs as the reflectance changes with incidence angle is presented.

Ray tracing with cones

A new approach to ray tracing is introduced, which tries to model light propagation with more fidelity and includes a better method of anti-aliasing, a way of calculating fuzzy shadows and dull reflections, and a method of calculating the correct level of detail in a procedural model and texture map.

Filtering by repeated integration

It is found that convolution of a signal with any piecewise polynomial kernel of degree n--1 can be computed by integrating the signal n times and point sampling it several times for each output sample.

Course notes

We present a new multiplication algorithm for the implementation of elliptic curve cryptography (ECC) over the finite extension fields where is a prime number greater than . In the context of ECC we