Fixing geometric errors on polygonal models: a survey

T Ju - Journal of Computer Science and Technology, 2009 - Springer
Polygonal models are popular representations of 3D objects. The use of polygonal models
in computational applications often requires a model to properly bound a 3D solid. That is …

[LLIBRE][B] Real-time rendering

T Akenine-Moller, E Haines, N Hoffman - 2019 - taylorfrancis.com
Thoroughly revised, this third edition focuses on modern techniques used to generate
synthetic three-dimensional images in a fraction of a second. With the advent of …

The RADIANCE lighting simulation and rendering system

GJ Ward - Proceedings of the 21st annual conference on …, 1994 - dl.acm.org
This paper describes a physically-based rendering system tailored to the demands of
lighting design and architecture. The simulation uses a light-backwards ray-tracing method …

[LLIBRE][B] Radiosity and realistic image synthesis

MF Cohen, JR Wallace - 1993 - books.google.com
The goal of image synthesis is to create, using the computer, a visual experience that is
identical to what a viewer would experience when viewing a real environment. Radiosity …

Bidirectional estimators for light transport

E Veach, L Guibas - Photorealistic Rendering Techniques, 1995 - Springer
Most of the research on the global illumination problem in computer graphics has been
concentrated on finite-element (radiosity) techniques. Monte Carlo methods are an intriguing …

Dynamic view-dependent simplification for polygonal models

JC **a, A Varshney - … of Seventh Annual IEEE Visualization'96, 1996 - ieeexplore.ieee.org
Presents an algorithm for performing view-dependent simplifications of a triangulated
polygonal model in real-time. The simplifications are dependent on viewing direction …

Adaptive real-time level-of-detail based rendering for polygonal models

JC **a, J El-Sana, A Varshney - IEEE Transactions on …, 1997 - ieeexplore.ieee.org
We present an algorithm for performing adaptive real-time level-of-detail-based rendering
for triangulated polygonal models. The simplifications are dependent on viewing direction …

[PDF][PDF] A discontinuity meshing algorithm for accurate radiosity

D Lischinski, F Tampieri, DP Greenberg - IEEE CG&A, 1992 - luthuli.cs.uiuc.edu
We discuss the problem of accurately computing the illumination of a diffuse polyhedral
environment due to an area light source. We show how umbra and penumbra boundaries …

[PDF][PDF] An importance-driven radiosity algorithm

BE Smits, JR Arvo, DH Salesin - … of the 19th annual conference on …, 1992 - dl.acm.org
We present a new radiosi [y algorithm for efficiently computing global solutions with respect
to a constrained set of views. Radiosities of directly visible surfaces are computed to high …

[PDF][PDF] Global visibility algorithms for illumination computations

S Teller, P Hanrahan - Proceedings of the 20th annual conference on …, 1993 - dl.acm.org
The most expensive geometric operation in image synthesis is visibility determination.
Classically this is solved with hidden surface removal algorithms that render only the parts of …