Evaluation of a BRDF using BSP Trees
- In this paper an analytic hidden surface removal algorithm is presented which uses a combination of 2D and 3D BSP trees without involving point sampling or scan conversion. Errors like aliasing which result from sampling do not occur while using this technique. An application of this algorithm is outlined which computes the energy locally reflected from a surface having an arbitrary BRDF. A simplification for diffuse reflectors is described, which has been implemented to compute analytic form factors from diffuse light sources to differential receivers as they are needed for shading and radiosity algorithms.
Download full text files
Additional Services
| Author: | Philip Jacob |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-49577 |
| Series (Serial Number): | Interner Bericht des Fachbereich Informatik (272) |
| Document Type: | Report |
| Language of publication: | English |
| Date of Publication (online): | 2017/10/26 |
| Year of first Publication: | 1995 |
| Publishing Institution: | Technische Universität Kaiserslautern |
| Date of the Publication (Server): | 2017/10/26 |
| Page Number: | 9 |
| Faculties / Organisational entities: | Kaiserslautern - Fachbereich Informatik |
| DDC-Cassification: | 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik |
| Licence (German): |  Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0) |