A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering
In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfa...
Ausführliche Beschreibung
Autor*in: |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2000 |
---|
Umfang: |
18 |
---|
Reproduktion: |
Springer Online Journal Archives 1860-2002 |
---|---|
Übergeordnetes Werk: |
in: The visual computer - 1985, 16(2000) vom: Mai, Seite 271-288 |
Übergeordnetes Werk: |
volume:16 ; year:2000 ; month:05 ; pages:271-288 ; extent:18 |
Links: |
---|
Katalog-ID: |
NLEJ203452887 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | NLEJ203452887 | ||
003 | DE-627 | ||
005 | 20210706125523.0 | ||
007 | cr uuu---uuuuu | ||
008 | 070528s2000 xx |||||o 00| ||eng c | ||
035 | |a (DE-627)NLEJ203452887 | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
245 | 1 | 0 | |a A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering |
264 | 1 | |c 2000 | |
300 | |a 18 | ||
336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
337 | |a nicht spezifiziert |b z |2 rdamedia | ||
338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
520 | |a In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment. | ||
533 | |f Springer Online Journal Archives 1860-2002 | ||
700 | 1 | |a Myszkowski, Karol |4 oth | |
700 | 1 | |a Kunii, Tosiyasu L. |4 oth | |
773 | 0 | 8 | |i in |t The visual computer |d 1985 |g 16(2000) vom: Mai, Seite 271-288 |w (DE-627)NLEJ188993304 |w (DE-600)1463287-1 |x 1432-2315 |7 nnns |
773 | 1 | 8 | |g volume:16 |g year:2000 |g month:05 |g pages:271-288 |g extent:18 |
856 | 4 | 0 | |u http://dx.doi.org/10.1007/s003719900067 |
912 | |a GBV_USEFLAG_U | ||
912 | |a ZDB-1-SOJ | ||
912 | |a GBV_NL_ARTICLE | ||
951 | |a AR | ||
952 | |d 16 |j 2000 |c 5 |h 271-288 |g 18 |
matchkey_str |
article:14322315:2000----::cssuyoadvldtoogoailmntoagrtmporsieirr |
---|---|
hierarchy_sort_str |
2000 |
publishDate |
2000 |
allfields |
(DE-627)NLEJ203452887 DE-627 ger DE-627 rakwb eng A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering 2000 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment. Springer Online Journal Archives 1860-2002 Myszkowski, Karol oth Kunii, Tosiyasu L. oth in The visual computer 1985 16(2000) vom: Mai, Seite 271-288 (DE-627)NLEJ188993304 (DE-600)1463287-1 1432-2315 nnns volume:16 year:2000 month:05 pages:271-288 extent:18 http://dx.doi.org/10.1007/s003719900067 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 16 2000 5 271-288 18 |
spelling |
(DE-627)NLEJ203452887 DE-627 ger DE-627 rakwb eng A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering 2000 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment. Springer Online Journal Archives 1860-2002 Myszkowski, Karol oth Kunii, Tosiyasu L. oth in The visual computer 1985 16(2000) vom: Mai, Seite 271-288 (DE-627)NLEJ188993304 (DE-600)1463287-1 1432-2315 nnns volume:16 year:2000 month:05 pages:271-288 extent:18 http://dx.doi.org/10.1007/s003719900067 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 16 2000 5 271-288 18 |
allfields_unstemmed |
(DE-627)NLEJ203452887 DE-627 ger DE-627 rakwb eng A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering 2000 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment. Springer Online Journal Archives 1860-2002 Myszkowski, Karol oth Kunii, Tosiyasu L. oth in The visual computer 1985 16(2000) vom: Mai, Seite 271-288 (DE-627)NLEJ188993304 (DE-600)1463287-1 1432-2315 nnns volume:16 year:2000 month:05 pages:271-288 extent:18 http://dx.doi.org/10.1007/s003719900067 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 16 2000 5 271-288 18 |
allfieldsGer |
(DE-627)NLEJ203452887 DE-627 ger DE-627 rakwb eng A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering 2000 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment. Springer Online Journal Archives 1860-2002 Myszkowski, Karol oth Kunii, Tosiyasu L. oth in The visual computer 1985 16(2000) vom: Mai, Seite 271-288 (DE-627)NLEJ188993304 (DE-600)1463287-1 1432-2315 nnns volume:16 year:2000 month:05 pages:271-288 extent:18 http://dx.doi.org/10.1007/s003719900067 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 16 2000 5 271-288 18 |
allfieldsSound |
(DE-627)NLEJ203452887 DE-627 ger DE-627 rakwb eng A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering 2000 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment. Springer Online Journal Archives 1860-2002 Myszkowski, Karol oth Kunii, Tosiyasu L. oth in The visual computer 1985 16(2000) vom: Mai, Seite 271-288 (DE-627)NLEJ188993304 (DE-600)1463287-1 1432-2315 nnns volume:16 year:2000 month:05 pages:271-288 extent:18 http://dx.doi.org/10.1007/s003719900067 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 16 2000 5 271-288 18 |
language |
English |
source |
in The visual computer 16(2000) vom: Mai, Seite 271-288 volume:16 year:2000 month:05 pages:271-288 extent:18 |
sourceStr |
in The visual computer 16(2000) vom: Mai, Seite 271-288 volume:16 year:2000 month:05 pages:271-288 extent:18 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
isfreeaccess_bool |
false |
container_title |
The visual computer |
authorswithroles_txt_mv |
Myszkowski, Karol @@oth@@ Kunii, Tosiyasu L. @@oth@@ |
publishDateDaySort_date |
2000-05-01T00:00:00Z |
hierarchy_top_id |
NLEJ188993304 |
id |
NLEJ203452887 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ203452887</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210706125523.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">070528s2000 xx |||||o 00| ||eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ203452887</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Springer Online Journal Archives 1860-2002</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Myszkowski, Karol</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kunii, Tosiyasu L.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">in</subfield><subfield code="t">The visual computer</subfield><subfield code="d">1985</subfield><subfield code="g">16(2000) vom: Mai, Seite 271-288</subfield><subfield code="w">(DE-627)NLEJ188993304</subfield><subfield code="w">(DE-600)1463287-1</subfield><subfield code="x">1432-2315</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2000</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:271-288</subfield><subfield code="g">extent:18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1007/s003719900067</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SOJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2000</subfield><subfield code="c">5</subfield><subfield code="h">271-288</subfield><subfield code="g">18</subfield></datafield></record></collection>
|
series2 |
Springer Online Journal Archives 1860-2002 |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ188993304 |
format |
electronic Article |
delete_txt_mv |
keep |
collection |
NL |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
1432-2315 |
topic_title |
A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
zu |
author2_variant |
k m km t l k tl tlk |
hierarchy_parent_title |
The visual computer |
hierarchy_parent_id |
NLEJ188993304 |
hierarchy_top_title |
The visual computer |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)NLEJ188993304 (DE-600)1463287-1 |
title |
A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering |
spellingShingle |
A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering |
ctrlnum |
(DE-627)NLEJ203452887 |
title_full |
A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering |
journal |
The visual computer |
journalStr |
The visual computer |
lang_code |
eng |
isOA_bool |
false |
recordtype |
marc |
publishDateSort |
2000 |
contenttype_str_mv |
zzz |
container_start_page |
271 |
container_volume |
16 |
physical |
18 |
format_se |
Elektronische Aufsätze |
title_sort |
a case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering |
title_auth |
A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering |
abstract |
In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment. |
abstractGer |
In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment. |
abstract_unstemmed |
In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment. |
collection_details |
GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE |
title_short |
A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering |
url |
http://dx.doi.org/10.1007/s003719900067 |
remote_bool |
true |
author2 |
Myszkowski, Karol Kunii, Tosiyasu L. |
author2Str |
Myszkowski, Karol Kunii, Tosiyasu L. |
ppnlink |
NLEJ188993304 |
mediatype_str_mv |
z |
isOA_txt |
false |
hochschulschrift_bool |
false |
author2_role |
oth oth |
up_date |
2024-07-06T10:44:57.145Z |
_version_ |
1803826177922564096 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ203452887</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210706125523.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">070528s2000 xx |||||o 00| ||eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ203452887</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A case study towards validation of global illumination algorithms: progressive hierarchical radiosity with clustering</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper, we present an efficient global illumination technique, and then we discuss the results of its extensive experimental validation. The technique is a hybrid of cluster-based hierarchical and progressive radiosity techniques, which does not require storing links between interacting surfaces and clusters. We tested our technique by applying a multistage validation procedure, which we designed specifically for global illumination solutions. First, we experimentally validate the algorithm against analytically derived and measured real-world data to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then we test the algorithm performance and rendering quality by directly comparing the virtual and real-world images of a complex environment.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Springer Online Journal Archives 1860-2002</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Myszkowski, Karol</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kunii, Tosiyasu L.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">in</subfield><subfield code="t">The visual computer</subfield><subfield code="d">1985</subfield><subfield code="g">16(2000) vom: Mai, Seite 271-288</subfield><subfield code="w">(DE-627)NLEJ188993304</subfield><subfield code="w">(DE-600)1463287-1</subfield><subfield code="x">1432-2315</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2000</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:271-288</subfield><subfield code="g">extent:18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1007/s003719900067</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SOJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2000</subfield><subfield code="c">5</subfield><subfield code="h">271-288</subfield><subfield code="g">18</subfield></datafield></record></collection>
|
score |
7.4021244 |