A novel approach makes higher order wavelets really efficient for radiosity
Identifieur interne : 002961 ( Crin/Corpus ); précédent : 002960; suivant : 002962A novel approach makes higher order wavelets really efficient for radiosity
Auteurs : François Cuny ; Laurent Alonso ; Nicolas HolzschuchSource :
- Computer Graphics Forum ; 2000.
English descriptors
- KwdEn :
Abstract
Since wavelets were introduced in the radiosity algorithm, surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previous study has shown that wavelet radiosity, and especially higher order wavelet radiosity was not bringing significant improvements over hierarchical radiosity and was having a very important extra memory cost, thus prohibiting any effective computation. In this paper, we present a new implementation of wavelets in the radiosity algorithm, that is substantially different from previous implementations in several key areas (refinement oracle, link storage, resolution algorithm). We show that, with this implementation, higher order wavelets are actually bringing an improvement over standard hierarchical radiosity and lower order wavelets.
Links to Exploration step
CRIN:cuny00aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="106">A novel approach makes higher order wavelets really efficient for radiosity</title></titleStmt><publicationStmt><idno type="RBID">CRIN:cuny00a</idno><date when="2000" year="2000">2000</date><idno type="wicri:Area/Crin/Corpus">002961</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">A novel approach makes higher order wavelets really efficient for radiosity</title><author><name sortKey="Cuny, Francois" sort="Cuny, Francois" uniqKey="Cuny F" first="François" last="Cuny">François Cuny</name></author><author><name sortKey="Alonso, Laurent" sort="Alonso, Laurent" uniqKey="Alonso L" first="Laurent" last="Alonso">Laurent Alonso</name></author><author><name sortKey="Holzschuch, Nicolas" sort="Holzschuch, Nicolas" uniqKey="Holzschuch N" first="Nicolas" last="Holzschuch">Nicolas Holzschuch</name></author></analytic><series><title level="j">Computer Graphics Forum</title><imprint><date when="2000" type="published">2000</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>global illumination simulation</term><term>radiosity</term><term>wavelets</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2592">Since wavelets were introduced in the radiosity algorithm, surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previous study has shown that wavelet radiosity, and especially higher order wavelet radiosity was not bringing significant improvements over hierarchical radiosity and was having a very important extra memory cost, thus prohibiting any effective computation. In this paper, we present a new implementation of wavelets in the radiosity algorithm, that is substantially different from previous implementations in several key areas (refinement oracle, link storage, resolution algorithm). We show that, with this implementation, higher order wavelets are actually bringing an improvement over standard hierarchical radiosity and lower order wavelets.</div></front></TEI><BibTex type="article"><ref>cuny00a</ref><crinnumber>A00-R-057</crinnumber><category>1</category><equipe>ISA</equipe><author><e>Cuny, François</e><e>Alonso, Laurent</e><e>Holzschuch, Nicolas</e></author><title>A novel approach makes higher order wavelets really efficient for radiosity</title><journal>Computer Graphics Forum</journal><year>2000</year><volume>19</volume><number>3</number><pages>C99-108</pages><month>Sep</month><note>(Eurographics 2000 proceedings)</note><keywords><e>global illumination simulation</e><e>radiosity</e><e>wavelets</e></keywords><abstract>Since wavelets were introduced in the radiosity algorithm, surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previous study has shown that wavelet radiosity, and especially higher order wavelet radiosity was not bringing significant improvements over hierarchical radiosity and was having a very important extra memory cost, thus prohibiting any effective computation. In this paper, we present a new implementation of wavelets in the radiosity algorithm, that is substantially different from previous implementations in several key areas (refinement oracle, link storage, resolution algorithm). We show that, with this implementation, higher order wavelets are actually bringing an improvement over standard hierarchical radiosity and lower order wavelets.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002961 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 002961 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Corpus
|type= RBID
|clé= CRIN:cuny00a
|texte= A novel approach makes higher order wavelets really efficient for radiosity
}}
| This area was generated with Dilib version V0.6.33. |  |