Information-Theoretic Oracle Based on Kernel Smoothness for Hierarchical Radiosity
One of the main problems in the radiosity method is how to discretise the surfaces of a scene into mesh elements that allow us to accurately represent illumination. In this paper we present a robust information-theoretic refinement criterion (oracle) based on kernel smoothness for hierarchical radio...
| Autores: | , , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2002 |
| País: | España |
| Recursos: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositório: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10256/24781 |
| Acesso em linha: | http://hdl.handle.net/10256/24781 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Informació, Teoria de la Information theory Infografia Computer graphics |
| Resumo: | One of the main problems in the radiosity method is how to discretise the surfaces of a scene into mesh elements that allow us to accurately represent illumination. In this paper we present a robust information-theoretic refinement criterion (oracle) based on kernel smoothness for hierarchical radiosity. This oracle improves on previous ones in that at equal cost it gives a better discretisation, approaching the optimal one from an information theory point of view, and also needs less visibility computations for a similar image quality |
|---|