Adaptive Volumetric Shadow Maps

We introduce adaptive volumetric shadow maps (AVSM), a real‐time shadow algorithm that supports high‐quality shadowing from dynamic volumetric media such as hair and smoke. The key contribution of AVSM is the introduction of a streaming simplification algorithm that generates an accurate volumetric...

Full description

Saved in:

Bibliographic Details
Published in:	Computer graphics forum Vol. 29; no. 4; pp. 1289 - 1296
Main Authors:	Salvi, Marco, Vidimče, Kiril, Lauritzen, Andrew, Lefohn, Aaron
Format:	Journal Article
Language:	English
Published:	Oxford, UK Blackwell Publishing Ltd 01.06.2010
Subjects:	Algorithms and texture Coding and Information Theory (H.1.1) [E.4]: Data compaction and compression-Bitmap and framebuffer operations Compressing Computer graphics Computer Graphics [I.3.3]: Three-Dimensional Graphics and Realism-Color Computer Graphics [I.3.3]: Three‐Dimensional Graphics and Realism—Color, shading, shadowing, and texture Computer programming Data compression Mathematical models Real time Rendering shading shadowing Shadows Simplification Smoke Studies Volumetric analysis
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	We introduce adaptive volumetric shadow maps (AVSM), a real‐time shadow algorithm that supports high‐quality shadowing from dynamic volumetric media such as hair and smoke. The key contribution of AVSM is the introduction of a streaming simplification algorithm that generates an accurate volumetric light attenuation function using a small fixed memory footprint. This compression strategy leads to high performance because the visibility data can remain in on‐chip memory during simplification and can be efficiently sampled during rendering. We demonstrate that AVSM compression closely approximates the ground‐truth correct solution and performs competitively to existing real‐time rendering techniques while providing higher quality volumetric shadows.
AbstractList	We introduce adaptive volumetric shadow maps (AVSM), a real‐time shadow algorithm that supports high‐quality shadowing from dynamic volumetric media such as hair and smoke. The key contribution of AVSM is the introduction of a streaming simplification algorithm that generates an accurate volumetric light attenuation function using a small fixed memory footprint. This compression strategy leads to high performance because the visibility data can remain in on‐chip memory during simplification and can be efficiently sampled during rendering. We demonstrate that AVSM compression closely approximates the ground‐truth correct solution and performs competitively to existing real‐time rendering techniques while providing higher quality volumetric shadows. AbstractWe introduce adaptive volumetric shadow maps (AVSM), a real-time shadow algorithm that supports high-quality shadowing from dynamic volumetric media such as hair and smoke. The key contribution of AVSM is the introduction of a streaming simplification algorithm that generates an accurate volumetric light attenuation function using a small fixed memory footprint. This compression strategy leads to high performance because the visibility data can remain in on-chip memory during simplification and can be efficiently sampled during rendering. We demonstrate that AVSM compression closely approximates the ground-truth correct solution and performs competitively to existing real-time rendering techniques while providing higher quality volumetric shadows. We introduce adaptive volumetric shadow maps (AVSM), a real-time shadow algorithm that supports high-quality shadowing from dynamic volumetric media such as hair and smoke. The key contribution of AVSM is the introduction of a streaming simplification algorithm that generates an accurate volumetric light attenuation function using a small fixed memory footprint. This compression strategy leads to high performance because the visibility data can remain in on-chip memory during simplification and can be efficiently sampled during rendering. We demonstrate that AVSM compression closely approximates the ground-truth correct solution and performs competitively to existing real-time rendering techniques while providing higher quality volumetric shadows. [PUBLICATION ABSTRACT]
Author	Vidimče, Kiril Lauritzen, Andrew Lefohn, Aaron Salvi, Marco
Author_xml	– sequence: 1 givenname: Marco surname: Salvi fullname: Salvi, Marco organization: Intel Corporation – sequence: 2 givenname: Kiril surname: Vidimče fullname: Vidimče, Kiril organization: Intel Corporation – sequence: 3 givenname: Andrew surname: Lauritzen fullname: Lauritzen, Andrew organization: Intel Corporation – sequence: 4 givenname: Aaron surname: Lefohn fullname: Lefohn, Aaron organization: Intel Corporation
BookMark	eNqNkF9LwzAUxYNMcFM_g8MXfWlNk7RJHxTGcFOYc-C_x0uappjZtTPpdH57Uys--CDmJfcmv3PgnAHqVXWlERpGOIz8OVuGEUt4IJI4DQn2rzjihIXbHdT_-eihPo78zHEc76GBc0uMMeNJ3EdHo1yuG_Omh491uVnpxho1vHuWef0-vJFrd4B2C1k6ffh976OHyeX9-CqY3U6vx6NZoBijLJAZSalQsVCM-J1IpkROVZZlRGFJWJomhRCkoJqmCck0KXIuWcYwyTWlRUH30Unnu7b160a7BlbGKV2WstL1xgFPMPF5MPPk6Z-kDxoxQiKcePT4F7qsN7byOYCzWGDhOQ9ddJCytXNWF6BMIxtTV42VpoQIQ1s0LKHtE9o-oS0avoqGrTcQvwzW1qyk_fiP9LyTvptSf_xbB-PppJ28Puj0xjV6-6OX9gUSTnkMT_Mp8Mli-jgf38OCfgL5XaO6
CitedBy_id	crossref_primary_10_1109_TVCG_2017_2656897 crossref_primary_10_1111_cgf_13383 crossref_primary_10_1111_cgf_70178 crossref_primary_10_1145_3203206 crossref_primary_10_1080_02564602_2014_906860 crossref_primary_10_1111_cgf_12506 crossref_primary_10_1016_j_cag_2014_08_003 crossref_primary_10_1111_cgf_12238 crossref_primary_10_1111_cgf_14019 crossref_primary_10_1111_cgf_12256 crossref_primary_10_1016_j_neucom_2015_12_135 crossref_primary_10_1016_j_cag_2015_05_004 crossref_primary_10_1007_s11042_014_1987_1 crossref_primary_10_4018_IJCICG_2017010101 crossref_primary_10_1109_TVCG_2014_2346333 crossref_primary_10_1111_j_1467_8659_2012_03207_x crossref_primary_10_1007_s11042_018_5834_7 crossref_primary_10_1109_TVCG_2025_3567124
Cites_doi	10.1145/1730804.1730830 10.1007/978-3-7091-6242-2_16 10.1145/192161.192196 10.1145/1730804.1730831 10.1145/965139.807402 10.1111/j.1467-8659.2008.01165.x 10.1109/TVCG.2003.1196003 10.1145/1507149.1507160 10.1109/PG.2007.48 10.1145/1111411.1111424 10.3138/FM57-6770-U75U-7727 10.1016/j.jda.2005.06.008 10.1145/1399504.1360635 10.1007/PL00009500
ContentType	Journal Article
Copyright	2010 The Author(s) Journal compilation © 2010 The Eurographics Association and Blackwell Publishing Ltd. 2010 The Eurographics Association and Blackwell Publishing Ltd.
Copyright_xml	– notice: 2010 The Author(s) Journal compilation © 2010 The Eurographics Association and Blackwell Publishing Ltd. – notice: 2010 The Eurographics Association and Blackwell Publishing Ltd.
DBID	BSCLL AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3
DOI	10.1111/j.1467-8659.2010.01724.x
DatabaseName	Istex CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database CrossRef Computer and Information Systems Abstracts Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1467-8659
EndPage	1296
ExternalDocumentID	2115312661 10_1111_j_1467_8659_2010_01724_x CGF1724 ark_67375_WNG_7FPGVNCT_P
Genre	article Feature
GroupedDBID	.3N .4S .DC .GA .Y3 05W 0R~ 10A 15B 1OB 1OC 29F 31~ 33P 3SF 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5HH 5LA 5VS 66C 6J9 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCZN ACFBH ACGFS ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEFGJ AEGXH AEIGN AEIMD AEMOZ AENEX AEUYR AEYWJ AFBPY AFEBI AFFNX AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AHEFC AHQJS AIDQK AIDYY AIQQE AITYG AIURR AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL BY8 CAG COF CS3 CWDTD D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EAD EAP EBA EBO EBR EBS EBU EDO EJD EMK EST ESX F00 F01 F04 F5P FEDTE FZ0 G-S G.N GODZA H.T H.X HF~ HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QWB R.K RDJ RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 TUS UB1 V8K W8V W99 WBKPD WIH WIK WOHZO WQJ WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT AAYXX CITATION O8X 7SC 8FD JQ2 L7M L~C L~D F28 FR3
ID	FETCH-LOGICAL-c4434-ab2938c58c424342a4c8d3cbbb2c0a24996f882f3e3962be2fd7a4b402de33ff3
IEDL.DBID	DRFUL
ISICitedReferencesCount	20
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000281286100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0167-7055
IngestDate	Thu Sep 04 20:45:07 EDT 2025 Thu Aug 07 15:04:40 EDT 2025 Sun Nov 09 08:17:14 EST 2025 Sat Nov 29 08:16:40 EST 2025 Tue Nov 18 22:12:00 EST 2025 Wed Aug 20 07:26:09 EDT 2025 Sun Sep 21 06:18:04 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	4
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c4434-ab2938c58c424342a4c8d3cbbb2c0a24996f882f3e3962be2fd7a4b402de33ff3
Notes	ark:/67375/WNG-7FPGVNCT-P ArticleID:CGF1724 istex:A019D8759639F7CD38E0A7FF8F1B2A1C44BD10FC marco.salvi@intel.com kiril.vidimce@intel.com aaron.lefohn@intel.com , andrew.t.lauritzen@intel.com SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 ObjectType-Article-2
PQID	745808422
PQPubID	23500
PageCount	8
ParticipantIDs	proquest_miscellaneous_760214604 proquest_miscellaneous_1671422106 proquest_journals_745808422 crossref_citationtrail_10_1111_j_1467_8659_2010_01724_x crossref_primary_10_1111_j_1467_8659_2010_01724_x wiley_primary_10_1111_j_1467_8659_2010_01724_x_CGF1724 istex_primary_ark_67375_WNG_7FPGVNCT_P
PublicationCentury	2000
PublicationDate	June 2010
PublicationDateYYYYMMDD	2010-06-01
PublicationDate_xml	– month: 06 year: 2010 text: June 2010
PublicationDecade	2010
PublicationPlace	Oxford, UK
PublicationPlace_xml	– name: Oxford, UK – name: Oxford
PublicationTitle	Computer graphics forum
PublicationYear	2010
Publisher	Blackwell Publishing Ltd
Publisher_xml	– name: Blackwell Publishing Ltd
References	Bosea P., Cabellob S., Cheongc O., Gudmundssond J., Van Krevelde M., Speckmann B.: Area-preserving approximations of polygonal paths. Journal of Discrete Algorithms 4, 4 (2006), 554-566. 3. Agarwal P. K., Varadarajan K. R.: Efficient algorithms for approximating polygonal chains. Discrete and Computational Geometry 23, 2 (2000), 273-291. 3. Kniss J., Premoze S., Hansen C., Shirley P. S., McPherson A.: A model for volume lighting and modeling. IEEE Transactions on Visualization and Computer Graphics 9, 2 (Apr.June 2003), 150-162. 2. Hiroshi I., Masao I.: Computational-geometric methods for polygonal approximations of a curve. North-Holland, Amsterdam , 1988. 3. Williams L.: Casting curved shadows on curved surfaces. In Computer Graphics (Proceedings of SIGGRAPH 78) (Aug. 1978), vol. 12, pp. 270-274. 3. Douglas D. H., Peucker T. K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer 10, 2 (1973), 112-122. 3. Yuksel C., Keyser J.: Deep opacity maps. Computer Graphics Forum 27, 2 (Apr. 2008), 675-680. 2. Yang J., Hensley J., Grün H., Thibieroz N.: Real-time concurrent linked list construction on the gpu. In Rendering Techniques 2010: Eurographics Symposium on Rendering (2010), vol. 29, Eurographics. 4. July 2000 Feb.Mar. 2009 Apr.June 2003; 9 1973; 10 2000; 23 2010; 29 June 2001 June 2007 2008 June 2004 2006 1994 2006; 4 Aug. 1978; 12 Apr. 2008; 27 Nov. 2007 Feb. 2010 1988 e_1_2_8_16_2 e_1_2_8_18_2 e_1_2_8_19_2 e_1_2_8_13_2 e_1_2_8_14_2 e_1_2_8_15_2 e_1_2_8_9_2 e_1_2_8_2_2 e_1_2_8_4_2 e_1_2_8_3_2 e_1_2_8_6_2 e_1_2_8_5_2 Lokovic T. (e_1_2_8_12_2) 2000 e_1_2_8_8_2 Hiroshi I. (e_1_2_8_7_2) 1988 Yang J. (e_1_2_8_17_2) 2010; 29 e_1_2_8_20_2 e_1_2_8_10_2 e_1_2_8_11_2
References_xml	– reference: Douglas D. H., Peucker T. K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer 10, 2 (1973), 112-122. 3. – reference: Yuksel C., Keyser J.: Deep opacity maps. Computer Graphics Forum 27, 2 (Apr. 2008), 675-680. 2. – reference: Agarwal P. K., Varadarajan K. R.: Efficient algorithms for approximating polygonal chains. Discrete and Computational Geometry 23, 2 (2000), 273-291. 3. – reference: Yang J., Hensley J., Grün H., Thibieroz N.: Real-time concurrent linked list construction on the gpu. In Rendering Techniques 2010: Eurographics Symposium on Rendering (2010), vol. 29, Eurographics. 4. – reference: Hiroshi I., Masao I.: Computational-geometric methods for polygonal approximations of a curve. North-Holland, Amsterdam , 1988. 3. – reference: Williams L.: Casting curved shadows on curved surfaces. In Computer Graphics (Proceedings of SIGGRAPH 78) (Aug. 1978), vol. 12, pp. 270-274. 3. – reference: Bosea P., Cabellob S., Cheongc O., Gudmundssond J., Van Krevelde M., Speckmann B.: Area-preserving approximations of polygonal paths. Journal of Discrete Algorithms 4, 4 (2006), 554-566. 3. – reference: Kniss J., Premoze S., Hansen C., Shirley P. S., McPherson A.: A model for volume lighting and modeling. IEEE Transactions on Visualization and Computer Graphics 9, 2 (Apr.June 2003), 150-162. 2. – volume: 10 start-page: 112 issue: 2 year: 1973 end-page: 122 article-title: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature publication-title: The Canadian Cartographer – start-page: 165 year: Feb. 2010 end-page: 172 – volume: 29 year: 2010 article-title: Real‐time concurrent linked list construction on the gpu publication-title: Rendering Techniques 2010: Eurographics Symposium on Rendering – start-page: 116 year: Nov. 2007 end-page: 125 – start-page: 1 year: 2008 end-page: 12 – start-page: 67 year: Feb.Mar. 2009 end-page: 74 – start-page: 265 year: June 2007 end-page: 276 – year: 1988 – volume: 4 start-page: 554 issue: 4 year: 2006 end-page: 566 article-title: Area‐preserving approximations of polygonal paths publication-title: Journal of Discrete Algorithms – volume: 9 start-page: 150 issue: 2 year: Apr.June 2003 end-page: 162 article-title: A model for volume lighting and modeling publication-title: IEEE Transactions on Visualization and Computer Graphics – start-page: 385 year: July 2000 end-page: 392 – volume: 23 start-page: 273 issue: 2 year: 2000 end-page: 291 article-title: Efficient algorithms for approximating polygonal chains publication-title: Discrete and Computational Geometry – volume: 12 start-page: 270 year: Aug. 1978 end-page: 274 article-title: Casting curved shadows on curved surfaces publication-title: Computer Graphics (Proceedings of SIGGRAPH 78) – start-page: 177 year: 1994 end-page: 184 – start-page: 71 year: 2006 end-page: 78 – volume: 27 start-page: 675 issue: 2 year: Apr. 2008 end-page: 680 article-title: Deep opacity maps publication-title: Computer Graphics Forum – start-page: 177 year: June 2001 end-page: 182 – year: June 2004 – start-page: 157 year: Feb. 2010 end-page: 164 – start-page: 385 volume-title: Proceedings of ACM SIGGRAPH 2000 year: 2000 ident: e_1_2_8_12_2 – volume-title: Computational‐geometric methods for polygonal approximations of a curve year: 1988 ident: e_1_2_8_7_2 – ident: e_1_2_8_6_2 doi: 10.1145/1730804.1730830 – ident: e_1_2_8_16_2 – ident: e_1_2_8_10_2 doi: 10.1007/978-3-7091-6242-2_16 – ident: e_1_2_8_9_2 doi: 10.1145/192161.192196 – ident: e_1_2_8_8_2 doi: 10.1145/1730804.1730831 – ident: e_1_2_8_15_2 doi: 10.1145/965139.807402 – ident: e_1_2_8_18_2 doi: 10.1111/j.1467-8659.2008.01165.x – ident: e_1_2_8_11_2 doi: 10.1109/TVCG.2003.1196003 – ident: e_1_2_8_14_2 doi: 10.1145/1507149.1507160 – ident: e_1_2_8_19_2 doi: 10.1109/PG.2007.48 – ident: e_1_2_8_5_2 doi: 10.1145/1111411.1111424 – ident: e_1_2_8_4_2 doi: 10.3138/FM57-6770-U75U-7727 – ident: e_1_2_8_3_2 doi: 10.1016/j.jda.2005.06.008 – ident: e_1_2_8_20_2 doi: 10.1145/1399504.1360635 – ident: e_1_2_8_13_2 – volume: 29 year: 2010 ident: e_1_2_8_17_2 article-title: Real‐time concurrent linked list construction on the gpu publication-title: Rendering Techniques 2010: Eurographics Symposium on Rendering – ident: e_1_2_8_2_2 doi: 10.1007/PL00009500
SSID	ssj0004765
Score	2.0962732
Snippet	We introduce adaptive volumetric shadow maps (AVSM), a real‐time shadow algorithm that supports high‐quality shadowing from dynamic volumetric media such as... We introduce adaptive volumetric shadow maps (AVSM), a real-time shadow algorithm that supports high-quality shadowing from dynamic volumetric media such as... AbstractWe introduce adaptive volumetric shadow maps (AVSM), a real-time shadow algorithm that supports high-quality shadowing from dynamic volumetric media...
SourceID	proquest crossref wiley istex
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1289
SubjectTerms	Algorithms and texture Coding and Information Theory (H.1.1) [E.4]: Data compaction and compression-Bitmap and framebuffer operations Compressing Computer graphics Computer Graphics [I.3.3]: Three-Dimensional Graphics and Realism-Color Computer Graphics [I.3.3]: Three‐Dimensional Graphics and Realism—Color, shading, shadowing, and texture Computer programming Data compression Mathematical models Real time Rendering shading shadowing Shadows Simplification Smoke Studies Volumetric analysis
Title	Adaptive Volumetric Shadow Maps
URI	https://api.istex.fr/ark:/67375/WNG-7FPGVNCT-P/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fj.1467-8659.2010.01724.x https://www.proquest.com/docview/745808422 https://www.proquest.com/docview/1671422106 https://www.proquest.com/docview/760214604
Volume	29
WOSCitedRecordID	wos000281286100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1467-8659 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004765 issn: 0167-7055 databaseCode: DRFUL dateStart: 19970101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dT9swED-hlgd4GDCGyPjKpIm3oMSxY-cRFVIeoKo2KLxZtpNoE1NbNTD487lL00I1kNDEW6zkouR8n_b5dwDfw9iVkSgjqvNTAeclD2yEQ2FQGNDDM1GD6QzOZa-nbm7SflP_RGdhpvgQ8wU30ozaXpOCG1v9q-QqEWlToYW-mB9hPNlmKMaiBe2TH9nV-fMpSZmIGdI3Ycgs1vW8-q4FZ9Umvj8uRKIv49naIWVrH_kr6_CpCUv946kcbcBSMfwMqy_ACjfh4Dg3YzKO_qC2aATt7__8ZfLRg39hxtUXuMpOLztnQdNeIXCcxzwwFl29ckI5znDMDHcqj521lrnQYFqWJiXG32VcxGnCbMHKXBpuMeHMizguy3gLWsPRsNgGH518GqaYutGuJoZAJopsmuQqkk6k1oYeyBkftWuwx6kFxh-9kINITSzQxAJds0A_ehDNKcdT_I130BzWUzUnMJNbql-TQl_3ulpm_e6g17nUfQ92ZnOpG9WttORChYoz5sG3-V3UOdpIMcNidF9plCBaOsNs2gP_jWdkUvdMD7kHST337_583elmdPX1fwl3YGVa40BrRbvQupvcF3uw7P7e_a4m-41aPAE6JATO
linkProvider	Wiley-Blackwell
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dT9swED8higQ8bIyByGCQSRNvQfmwY-cRlaWglajaSsebZTuJQKC2agvjz99dmnZUgIQQb7GSi5Lzne_D598BfPcjWwa8DKjOT3qMlcwzAQ65RmFACx_yCkyn1xZZJi8vk07dDojOwkzxIeYJN9KMar0mBaeE9FMtlzFP6hItNMbsCB3KBkOpQnFvnPxKL9r_j0mKmM-gvglEZrGw59l3LVirBjH-YcEVfezQVhYp_fiu_7IBH2rH1D2eStInWCr6m7D-CK7wMxwc53pIy6Pbq9Y0Avd3f1_pfPDXPdfD8RZcpD-6zVOvbrDgWcYi5mmDxl5aLi0LcRxqZmUeWWNMaH2NgVkSl-iBl1ERJXFoirDMhWYGQ868iKKyjLZhuT_oFzvgoplP_ASDN9rXRCdIB4FJ4lwGwvLEGN8BMWOksjX6ODXBuFULUYhQxAJFLFAVC9SDA8GccjhF4HgFzWE1V3MCPbqhCjbB1Z-spUTaafWyZld1HNidTaaqlXesBOPSlywMHfg2v4taR1spul8M7sYKRYiSZxhPO-C-8IyIq67pPnMgrib_1Z-vmq2Urr68lfAAVk-7523VPst-7sLatOKBMkd7sDwZ3RVfYcXeT67Ho_1aR_4B-UEIvg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dT9swED9N7TSxB2ADtMCATJp4C8qHHTuPqJBuWhdVGxTeLNuJtWlTW7Xl48_fXZoWqg0Job3FSi5Kzvdpn38H8DFMrIu4i6jOTwaMORaYCIdcozCgh495DaYz6ImikFdXWb9pB0RnYeb4EMsFN9KM2l6Tglfj0v2t5TLlWVOihc6YHWNA2WbUU6YF7dNv-UXv_pikSPkC6ptAZFYLe_75rhVv1SbG362Eog8D2toj5Rv_9V82Yb0JTP2TuSS9gRfV8C28fgBXuAWHJ6Uek3n0B7VNI3B___sPXY5u_a96PN2Gi_zsvPMpaBosBJaxhAXaoLOXlkvLYhzHmllZJtYYE9tQY2KWpQ4jcJdUCfLTVLErhWYGU86yShLnkh1oDUfD6h346OazMMPkjfY1MQjSUWSytJSRsDwzJvRALBipbIM-Tk0wfquVLEQoYoEiFqiaBerOg2hJOZ4jcDyB5qieqyWBnvyiCjbB1WXRVSLvdwdF51z1PdhbTKZqlHeqBOMylCyOPfiwvItaR1speliNrqcKRYgWzzCf9sB_5BmR1l3TQ-ZBWk_-kz9fdbo5Xe0-l_AQXvVPc9X7XHzZg7V5wQMtHL2H1mxyXe3DS3sz-zmdHDQq8gdyNQg5
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Adaptive+Volumetric+Shadow+Maps&rft.jtitle=Computer+graphics+forum&rft.au=Salvi%2C+Marco&rft.au=Vidim%C4%8De%2C+Kiril&rft.au=Lauritzen%2C+Andrew&rft.au=Lefohn%2C+Aaron&rft.date=2010-06-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=29&rft.issue=4&rft.spage=1289&rft.epage=1296&rft_id=info:doi/10.1111%2Fj.1467-8659.2010.01724.x&rft.externalDBID=n%2Fa&rft.externalDocID=10_1111_j_1467_8659_2010_01724_x
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon