Adaptive mesh generation for global diffuse illumination

Campbell, A. T.; Fussell, Donald S.

doi:10.1145/97879.97896

Cited by 25 publications

(4 citation statements)

References 21 publications

(23 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, only the critical elements need more computation. Whereas the adaptive method described by Campbell and Fussell [5] or the discontinuity method described by Lischinsky [8] test all the elements and increase the work load needed to determine the subdivision, in our method the use of ray-tracing and event classification allows to test a low number of elements. In the tests we have made, only 15 to 35 percent of the elements require expensive treatment.…”

Section: Discussion and Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive mesh generation for progressive radiosity: A ray‐tracing based algorithm.

Paulin¹,

Jessel²

1994

Computer Graphics Forum

View full text Add to dashboard Cite

The radiosity method is one of the most popular rendering algorithms. It allows to simulate interreflections of light accurately between surfaces as energy transfers are well designed. However, this algorithm and its derivatives need to break scenes into a relatively large number of small elements to approximate the illumination function. Even with a very large number of elements, not all the illumination effects can be simulated. In fact, there are always artefacts when modelling sharp shadows, besides shadows falling between mesh vertices can be missed entirely. To reduce the computational cost of such methods and to increase the accuracy of the radiosity solution, adaptive mesh generation is well suited. In this paper, we present a ray‐tracing based algorithm for adaptive mesh generation which resolves all the illumination problems without lengthening computation time too much. This method allows a small number of initial elements and increases element density in critical locations while solving the illumination problem.

show abstract

Section: Discussion and Resultsmentioning

confidence: 99%

“…Moreover, this solution is not view-independent and computation time for rendering is considerably increased. To compute an appropriate mesh automatically, Campbell and Fussell [5] use environmental projection. Each area light source is subdivided into a set of point light sources.…”

Section: Previous Workmentioning

confidence: 99%

Adaptive mesh generation for progressive radiosity: A ray‐tracing based algorithm.

Paulin¹,

Jessel²

1994

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…Ray shooting Wallace et al (1989) proposed a progressive radiosity algorithm that samples visibility by ray shooting. Campbell and Fussell (1990) extend this method by using a shadow volume BSP tree to resolve visibility.…”

Section: Form Factorsmentioning

confidence: 99%

Visibility in Computer Graphics

Bittner

Wonka

2003

Environ Plann B Plann Des

View full text Add to dashboard Cite

Visibility computation was crucial for computer graphics from its very beginning. The first visibility algorithms in computer graphics aimed to determine visible surfaces in a synthesized image of a three-dimensional scene. Nowadays there are many different visibility algorithms for various visibility problems. We propose a new taxonomy of visibility problems that is based on a classification according to the problem domain. We provide a broad overview of visibility problems and algorithms in computer graphics grouped by the proposed taxonomy. We survey visible surface algorithms, visibility culling algorithms, visibility algorithms for shadow computation, global illumination, point-based and image-based rendering, and global visibility computations. Finally, we discuss common concepts of visibility algorithm design and several criteria for the classification of visibility algorithms.

show abstract

“…b) To improve image quality, regions of high intensity gradients must be subdivided into finer and finer patches. The first automatic meshing algorithms [CG86] [CF90] were based on surface or intensity gradient subdivision criteria. Another important solution has been proposed by Hanrahan et al [HS91] with the use of hierarchical representation.…”

Section: Arques Et Al / a New Radiosity Approach For Regular Objectsmentioning

confidence: 99%

A new radiosity approach for regular objects: application to ruled surfaces

ARQUES¹,

MICHELIN²

1995

Computer Graphics Forum

View full text Add to dashboard Cite

This paper introduces a new approach in the radiosity method. The main principle applied here, is the improvement of form factor computation by the knowledge of the model properties. More precisely, if surfaces describing a scene are "regular", the values of the form factor and its "derivatives" between any patch B and a patch A intervening in the meshing of a given surface, enable us to evaluate (with a required precision) the form factors values between B and the neighboring patches of A. We will also show that the mathematical relation we have obtained, 1) is especially efficient with ruled surfaces, 2) significantly decreases the computation time, 3) is well-adapted to refinement or subdivision techniques and 4) gives us an interesting variety of surfaces. Calculation times are equivalent to those obtained with a projective method (hemi-cube for example) but with an efficient control of the generated errors.

show abstract

Adaptive mesh generation for global diffuse illumination

Cited by 25 publications

References 21 publications

Adaptive mesh generation for progressive radiosity: A ray‐tracing based algorithm.

Adaptive mesh generation for progressive radiosity: A ray‐tracing based algorithm.

Visibility in Computer Graphics

A new radiosity approach for regular objects: application to ruled surfaces

Contact Info

Product

Resources

About