Adaptive Quantization Visibility Caching

Ray tracing has become a viable alternative to rasterization for interactive applications and also forms the basis of most global illumination methods. However, even today's fastest ray‐tracers offer only a tight budget of rays per pixel per frame. Rendering performance can be improved by incre...

Full description

Saved in:
Bibliographic Details
Published inComputer graphics forum Vol. 32; no. 2pt4; pp. 399 - 408
Main Authors Popov, Stefan, Georgiev, Iliyan, Slusallek, Philipp, Dachsbacher, Carsten
Format Journal Article
LanguageEnglish
Published Oxford, UK Blackwell Publishing Ltd 01.05.2013
Subjects
Online AccessGet full text
ISSN0167-7055
1467-8659
DOI10.1111/cgf.12060

Cover

Abstract Ray tracing has become a viable alternative to rasterization for interactive applications and also forms the basis of most global illumination methods. However, even today's fastest ray‐tracers offer only a tight budget of rays per pixel per frame. Rendering performance can be improved by increasing this budget, or by developing methods that use it more efficiently. In this paper we propose a global visibility caching algorithm that reduces the number of shadow rays required for shading to a fraction of less than 2% in some cases. We quantize the visibility function's domain while ensuring a minimal degradation of the final image quality. To control the introduced error, we adapt the quantization locally, accounting for variations in geometry, sampling densities on both endpoints of the visibility queries, and the light signal itself. Compared to previous approaches for approximating visibility, e.g. shadow mapping, our method has several advantages: (1) it allows caching of arbitrary visibility queries between surface points and is thus applicable to all ray tracing based methods; (2) the approximation error is uniform over the entire image and can be bounded by a user‐specified parameter; (3) the cache is created on‐the‐fly and does not waste any resources on queries that will never be used. We demonstrate the benefits of our method on Whitted‐style ray tracing combined with instant radiosity, as well as an integration with bidirectional path tracing.
AbstractList Ray tracing has become a viable alternative to rasterization for interactive applications and also forms the basis of most global illumination methods. However, even today's fastest ray‐tracers offer only a tight budget of rays per pixel per frame. Rendering performance can be improved by increasing this budget, or by developing methods that use it more efficiently. In this paper we propose a global visibility caching algorithm that reduces the number of shadow rays required for shading to a fraction of less than 2% in some cases. We quantize the visibility function's domain while ensuring a minimal degradation of the final image quality. To control the introduced error, we adapt the quantization locally, accounting for variations in geometry, sampling densities on both endpoints of the visibility queries, and the light signal itself. Compared to previous approaches for approximating visibility, e.g. shadow mapping, our method has several advantages: (1) it allows caching of arbitrary visibility queries between surface points and is thus applicable to all ray tracing based methods; (2) the approximation error is uniform over the entire image and can be bounded by a user‐specified parameter; (3) the cache is created on‐the‐fly and does not waste any resources on queries that will never be used. We demonstrate the benefits of our method on Whitted‐style ray tracing combined with instant radiosity, as well as an integration with bidirectional path tracing.
Ray tracing has become a viable alternative to rasterization for interactive applications and also forms the basis of most global illumination methods. However, even today's fastest ray-tracers offer only a tight budget of rays per pixel per frame. Rendering performance can be improved by increasing this budget, or by developing methods that use it more efficiently. In this paper we propose a global visibility caching algorithm that reduces the number of shadow rays required for shading to a fraction of less than 2% in some cases. We quantize the visibility function's domain while ensuring a minimal degradation of the final image quality. To control the introduced error, we adapt the quantization locally, accounting for variations in geometry, sampling densities on both endpoints of the visibility queries, and the light signal itself. Compared to previous approaches for approximating visibility, e.g. shadow mapping, our method has several advantages: (1) it allows caching of arbitrary visibility queries between surface points and is thus applicable to all ray tracing based methods; (2) the approximation error is uniform over the entire image and can be bounded by a user-specified parameter; (3) the cache is created on-the-fly and does not waste any resources on queries that will never be used. We demonstrate the benefits of our method on Whitted-style ray tracing combined with instant radiosity, as well as an integration with bidirectional path tracing. [PUBLICATION ABSTRACT]
Author Dachsbacher, Carsten
Popov, Stefan
Georgiev, Iliyan
Slusallek, Philipp
Author_xml – sequence: 1
  givenname: Stefan
  surname: Popov
  fullname: Popov, Stefan
  organization: Saarland University
– sequence: 2
  givenname: Iliyan
  surname: Georgiev
  fullname: Georgiev, Iliyan
  organization: Saarland University
– sequence: 3
  givenname: Philipp
  surname: Slusallek
  fullname: Slusallek, Philipp
  organization: Saarland University
– sequence: 4
  givenname: Carsten
  surname: Dachsbacher
  fullname: Dachsbacher, Carsten
  organization: Karlsruhe Institute of Technology
BookMark eNp1kE1PAjEQhhuDiYAe_AckXvCw0G637XIkG1lNiF8YPDbd0sXisottV8Vfb_nQA9G5zByeZzLztkCjrEoFwDmCPeSrL-d5D4WQwiPQRBFlQUzJoAGaEPmZQUJOQMvaBYQwYpQ0QXc4Eyun31XnoRal01_C6arsTLXVmS60W3cSIV90OT8Fx7korDrb9zaYjK6ekutgfJfeJMNxIDGNYRCraEZZGIcxiqSQSmIZMykinMEIUcXULBaEkBBBleFcIRTnMMtQRuksJBC3QXe3dWWqt1pZx5faSlUUolRVbTnClEBK8YB59OIAXVS1Kf1tniL-U8LohurvKGkqa43KudRu-6MzQhccQb7Jjfvc-DY3b1weGCujl8Ks_2T32z90odb_gzxJRz9GsDO0derz1xDmlftrGeHPtykn92kynTymHOJvdC-Ldg
CitedBy_id crossref_primary_10_1145_3197517_3201340
crossref_primary_10_1111_cgf_14138
Cites_doi 10.1109/RT.2007.4342602
10.1145/355588.365104
10.1109/MCG.1986.276832
10.1145/1276377.1276410
10.1068/b2957
10.1145/378456.378490
10.1145/965139.807402
10.1145/1073204.1073318
10.1145/258734.258769
10.1111/j.1467-8659.2010.01841.x
10.1145/311535.311555
10.1145/1572769.1572792
10.1145/566654.566613
10.1109/TVCG.2003.1207447
10.1145/2010324.1964935
10.1111/j.1467-8659.2012.02093.x
10.1007/978-3-7091-6809-7_3
ContentType Journal Article
Copyright 2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and Blackwell Publishing Ltd.
Copyright_xml – notice: 2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and Blackwell Publishing Ltd.
DBID BSCLL
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1111/cgf.12060
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 CrossRef
Computer and Information Systems Abstracts
Technology Research Database

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1467-8659
EndPage 408
ExternalDocumentID 2969315391
10_1111_cgf_12060
CGF12060
ark_67375_WNG_5PGCVSRG_0
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
7SC
8FD
JQ2
L7M
L~C
L~D
F28
FR3
ID FETCH-LOGICAL-c3680-8e4d67282814cacec3c87ca43b0416e7ed8a555210eb3fe118f0bb1b66d2503
IEDL.DBID DR2
ISSN 0167-7055
IngestDate Thu Oct 02 11:30:40 EDT 2025
Sun Sep 07 03:42:23 EDT 2025
Thu Apr 24 23:13:08 EDT 2025
Wed Oct 01 03:05:00 EDT 2025
Sun Sep 21 06:26:11 EDT 2025
Sun Sep 21 06:25:59 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2pt4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3680-8e4d67282814cacec3c87ca43b0416e7ed8a555210eb3fe118f0bb1b66d2503
Notes ArticleID:CGF12060
istex:EE9931A219CC06972F5AD090B34B6C1B1B2B2E2A
ark:/67375/WNG-5PGCVSRG-0
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 1350555767
PQPubID 30877
PageCount 10
ParticipantIDs proquest_miscellaneous_1365066397
proquest_journals_1350555767
crossref_citationtrail_10_1111_cgf_12060
crossref_primary_10_1111_cgf_12060
wiley_primary_10_1111_cgf_12060_CGF12060
istex_primary_ark_67375_WNG_5PGCVSRG_0
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate May 2013
PublicationDateYYYYMMDD 2013-05-01
PublicationDate_xml – month: 05
  year: 2013
  text: May 2013
PublicationDecade 2010
PublicationPlace Oxford, UK
PublicationPlace_xml – name: Oxford, UK
– name: Oxford
PublicationTitle Computer graphics forum
PublicationYear 2013
Publisher Blackwell Publishing Ltd
Publisher_xml – name: Blackwell Publishing Ltd
References Dietrich A., Slusallek P.: Adaptive spatial sample caching. In Proc. IEEE/EG Symposium on Interactive Ray Tracing 2007 (September 2007), pp. 141-147. 2, 5.
Ward G. J., Rubinstein F. M., Clear R. D.: A ray tracing solution for diffuse interreflection. Computer Graphics (Proc. SIGGRAPH) 22, 4 (1988), 85-92. 2, 6.
Bittner J., Wonka P.: Visibility in computer graphics. Environment and Planning B: Planning and Design 30, 5 (2003), 729-756. 2.
Walter B., Fernandez S., Arbree A., Bala K., Donikian M., Greenberg D. P.: Lightcuts: a scalable approach to illumination. ACM Transactions on Graphics (Proceedings of SIGGRAPH) 24, 3 (2005), 1098-1107. 1, 2, 10.
Hašan M., Pellacini F., Bala K.: Matrix row-column sampling for the many-light problem. ACM Transactions on Graphics (Proc. SIGGRAPH) 26, 3 (2007). 2.
Tole P., Pellacini F., Walter B., Greenberg D. P.: Interactive global illumination in dynamic scenes. ACM Transactions on Graphics (Proc. SIGGRAPH) 21, 3 (2002). 2.
Scherzer D., Wimmer M., Purgathofer W.: A survey of real-time hard shadow mapping methods. Computer Graphics Forum 30, 1 (2011), 169-186. 2, 9.
Cohen-Or D., Chrysanthou Y. L., Silva C. T., Durand F.: A survey of visibility for walkthrough applications. IEEE Transactions on Visualization and Computer Graphics 09, 3 (2003), 412-431. 2.
Mantiuk R., Kim K. J., Rempel A. G., Heidrich W.: HDR-VDP-2: a calibrated visual metric for visibility and quality predictions in all luminance conditions. ACM Transactions on Graphics (Proc. SIGGRAPH) 30, 4 (2011). 8.
Morton G. M.: A computer oriented geodetic data base and a new technique in file sequencing. Tech. rep., IBM Ltd., 1966. 6.
Halton J. H.: Algorithm 247: Radical-inverse quasi-random point sequence. Communications of ACM 7 (1964). 6.
Haines E., Greenberg D.: The light buffer: A shadow-testing accelerator. IEEE Computer Graphics and Applications 6, 9 (1986), 6-16. 2.
Novák J., Dachsbacher C.: Rasterized bounding volume hierarchies. Comptuter Graphics Forum 31, 2 (2012). 1.
Ritschel T., Dachsbacher C., Grosch T., Kautz J.: The state of the art in interactive global illumination. Comptuter Graphics Forum 31, 1 (2012), 160-188. 2.
Williams L.: Casting curved shadows on curved surfaces. Computer Graphics (Proc. SIGGRAPH) 12, 3 (1978). 2.
Press W. H., Teukolsky S. A., Vetterling W. T., Flannery B. P.: Numerical Recipes 3rd Edition, 3 ed. Cambridge University Press, Sept 2007. 5.
Sept 2007
1978; 12
2011
1964; 7
2002; 21
1986; 6
2009
1998
2008
1997
2011; 30
1988; 22
2006
1993
2003; 09
September 2007; 2007
2003; 30
2012; 31
2007; 26
2005; 24
1999
1966
e_1_2_7_5_2
e_1_2_7_4_2
e_1_2_7_2_2
e_1_2_7_9_2
e_1_2_7_8_2
e_1_2_7_7_2
e_1_2_7_6_2
e_1_2_7_19_2
e_1_2_7_18_2
Bittner J. (e_1_2_7_3_2) 2011
e_1_2_7_14_2
e_1_2_7_13_2
e_1_2_7_12_2
e_1_2_7_11_2
e_1_2_7_26_2
Novák J. (e_1_2_7_16_2) 2012; 31
e_1_2_7_25_2
e_1_2_7_24_2
Morton G. M. (e_1_2_7_15_2) 1966
e_1_2_7_23_2
e_1_2_7_22_2
e_1_2_7_21_2
e_1_2_7_20_2
Press W. H. (e_1_2_7_17_2) 2007
Hašan M. (e_1_2_7_10_2) 2007; 26
References_xml – reference: Bittner J., Wonka P.: Visibility in computer graphics. Environment and Planning B: Planning and Design 30, 5 (2003), 729-756. 2.
– reference: Haines E., Greenberg D.: The light buffer: A shadow-testing accelerator. IEEE Computer Graphics and Applications 6, 9 (1986), 6-16. 2.
– reference: Scherzer D., Wimmer M., Purgathofer W.: A survey of real-time hard shadow mapping methods. Computer Graphics Forum 30, 1 (2011), 169-186. 2, 9.
– reference: Cohen-Or D., Chrysanthou Y. L., Silva C. T., Durand F.: A survey of visibility for walkthrough applications. IEEE Transactions on Visualization and Computer Graphics 09, 3 (2003), 412-431. 2.
– reference: Tole P., Pellacini F., Walter B., Greenberg D. P.: Interactive global illumination in dynamic scenes. ACM Transactions on Graphics (Proc. SIGGRAPH) 21, 3 (2002). 2.
– reference: Ritschel T., Dachsbacher C., Grosch T., Kautz J.: The state of the art in interactive global illumination. Comptuter Graphics Forum 31, 1 (2012), 160-188. 2.
– reference: Mantiuk R., Kim K. J., Rempel A. G., Heidrich W.: HDR-VDP-2: a calibrated visual metric for visibility and quality predictions in all luminance conditions. ACM Transactions on Graphics (Proc. SIGGRAPH) 30, 4 (2011). 8.
– reference: Morton G. M.: A computer oriented geodetic data base and a new technique in file sequencing. Tech. rep., IBM Ltd., 1966. 6.
– reference: Ward G. J., Rubinstein F. M., Clear R. D.: A ray tracing solution for diffuse interreflection. Computer Graphics (Proc. SIGGRAPH) 22, 4 (1988), 85-92. 2, 6.
– reference: Walter B., Fernandez S., Arbree A., Bala K., Donikian M., Greenberg D. P.: Lightcuts: a scalable approach to illumination. ACM Transactions on Graphics (Proceedings of SIGGRAPH) 24, 3 (2005), 1098-1107. 1, 2, 10.
– reference: Dietrich A., Slusallek P.: Adaptive spatial sample caching. In Proc. IEEE/EG Symposium on Interactive Ray Tracing 2007 (September 2007), pp. 141-147. 2, 5.
– reference: Hašan M., Pellacini F., Bala K.: Matrix row-column sampling for the many-light problem. ACM Transactions on Graphics (Proc. SIGGRAPH) 26, 3 (2007). 2.
– reference: Williams L.: Casting curved shadows on curved surfaces. Computer Graphics (Proc. SIGGRAPH) 12, 3 (1978). 2.
– reference: Novák J., Dachsbacher C.: Rasterized bounding volume hierarchies. Comptuter Graphics Forum 31, 2 (2012). 1.
– reference: Halton J. H.: Algorithm 247: Radical-inverse quasi-random point sequence. Communications of ACM 7 (1964). 6.
– reference: Press W. H., Teukolsky S. A., Vetterling W. T., Flannery B. P.: Numerical Recipes 3rd Edition, 3 ed. Cambridge University Press, Sept 2007. 5.
– volume: 22
  start-page: 85
  issue: 4
  year: 1988
  end-page: 92
  article-title: A ray tracing solution for diffuse interreflection
  publication-title: Computer Graphics (Proc. SIGGRAPH)
– volume: 30
  start-page: 729
  issue: 5
  year: 2003
  end-page: 756
  article-title: Visibility in computer graphics
  publication-title: Environment and Planning B: Planning and Design
– year: 1966
– volume: 31
  start-page: 160
  issue: 1
  year: 2012
  end-page: 188
  article-title: The state of the art in interactive global illumination
  publication-title: Comptuter Graphics Forum
– volume: 26
  issue: 3
  year: 2007
  article-title: Matrix row‐column sampling for the many‐light problem
  publication-title: ACM Transactions on Graphics (Proc. SIGGRAPH)
– start-page: 81
  year: 2011
  end-page: 88
– start-page: 179
  year: 1999
  end-page: 186
– volume: 30
  start-page: 169
  issue: 1
  year: 2011
  end-page: 186
  article-title: A survey of real‐time hard shadow mapping methods
  publication-title: Computer Graphics Forum
– volume: 7
  year: 1964
  article-title: Algorithm 247: Radical‐inverse quasi‐random point sequence
  publication-title: Communications of ACM
– year: Sept 2007
– volume: 09
  start-page: 412
  issue: 3
  year: 2003
  end-page: 431
  article-title: A survey of visibility for walkthrough applications
  publication-title: IEEE Transactions on Visualization and Computer Graphics
– start-page: 145
  year: 1993
  end-page: 153
– start-page: 383
  year: 2008
  end-page: 388
– year: 1998
– volume: 2007
  start-page: 141
  year: September 2007
  end-page: 147
  article-title: Adaptive spatial sample caching
  publication-title: Proc. IEEE/EG Symposium on Interactive Ray Tracing
– volume: 30
  issue: 4
  year: 2011
  article-title: HDR‐VDP‐2: a calibrated visual metric for visibility and quality predictions in all luminance conditions
  publication-title: ACM Transactions on Graphics (Proc. SIGGRAPH)
– start-page: 145
  year: 2009
  end-page: 149
– volume: 12
  issue: 3
  year: 1978
  article-title: Casting curved shadows on curved surfaces
  publication-title: Computer Graphics (Proc. SIGGRAPH)
– volume: 6
  start-page: 6
  issue: 9
  year: 1986
  end-page: 16
  article-title: The light buffer: A shadow‐testing accelerator
  publication-title: IEEE Computer Graphics and Applications
– start-page: 235
  year: 1999
  end-page: 246
– year: 2006
– volume: 21
  issue: 3
  year: 2002
  article-title: Interactive global illumination in dynamic scenes
  publication-title: ACM Transactions on Graphics (Proc. SIGGRAPH)
– start-page: 49
  year: 1997
  end-page: 56
– volume: 24
  start-page: 1098
  issue: 3
  year: 2005
  end-page: 1107
  article-title: Lightcuts: a scalable approach to illumination
  publication-title: ACM Transactions on Graphics (Proceedings of SIGGRAPH)
– volume: 31
  issue: 2
  year: 2012
  article-title: Rasterized bounding volume hierarchies
  publication-title: Comptuter Graphics Forum
– start-page: 81
  volume-title: Proc. I3D
  year: 2011
  ident: e_1_2_7_3_2
– ident: e_1_2_7_13_2
– ident: e_1_2_7_6_2
  doi: 10.1109/RT.2007.4342602
– ident: e_1_2_7_19_2
– ident: e_1_2_7_8_2
  doi: 10.1145/355588.365104
– ident: e_1_2_7_9_2
  doi: 10.1109/MCG.1986.276832
– volume-title: A computer oriented geodetic data base and a new technique in file sequencing
  year: 1966
  ident: e_1_2_7_15_2
– volume: 26
  issue: 3
  year: 2007
  ident: e_1_2_7_10_2
  article-title: Matrix row‐column sampling for the many‐light problem
  publication-title: ACM Transactions on Graphics (Proc. SIGGRAPH)
  doi: 10.1145/1276377.1276410
– ident: e_1_2_7_4_2
  doi: 10.1068/b2957
– ident: e_1_2_7_26_2
  doi: 10.1145/378456.378490
– volume-title: Numerical Recipes 3rd Edition
  year: 2007
  ident: e_1_2_7_17_2
– ident: e_1_2_7_25_2
  doi: 10.1145/965139.807402
– ident: e_1_2_7_24_2
  doi: 10.1145/1073204.1073318
– ident: e_1_2_7_12_2
  doi: 10.1145/258734.258769
– ident: e_1_2_7_20_2
  doi: 10.1111/j.1467-8659.2010.01841.x
– volume: 31
  issue: 2
  year: 2012
  ident: e_1_2_7_16_2
  article-title: Rasterized bounding volume hierarchies
  publication-title: Comptuter Graphics Forum
– ident: e_1_2_7_11_2
  doi: 10.1145/311535.311555
– ident: e_1_2_7_2_2
  doi: 10.1145/1572769.1572792
– ident: e_1_2_7_22_2
– ident: e_1_2_7_21_2
  doi: 10.1145/566654.566613
– ident: e_1_2_7_5_2
  doi: 10.1109/TVCG.2003.1207447
– ident: e_1_2_7_7_2
– ident: e_1_2_7_14_2
  doi: 10.1145/2010324.1964935
– ident: e_1_2_7_18_2
  doi: 10.1111/j.1467-8659.2012.02093.x
– ident: e_1_2_7_23_2
  doi: 10.1007/978-3-7091-6809-7_3
SSID ssj0004765
Score 2.0660062
Snippet Ray tracing has become a viable alternative to rasterization for interactive applications and also forms the basis of most global illumination methods....
SourceID proquest
crossref
wiley
istex
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 399
SubjectTerms Algorithms
Analysis
and texture
Budgeting
Caching
Computer graphics
I.3.7 [Computer Graphics]: Color
I.3.7 [Computer Graphics]: Color, shading, shadowing, and texture
I.3.7 [Computer Graphics]: Ray tracing
Image processing systems
Permissible error
Quantization
Queries
Ray tracing
shading
shadowing
Studies
Visibility
Title Adaptive Quantization Visibility Caching
URI https://api.istex.fr/ark:/67375/WNG-5PGCVSRG-0/fulltext.pdf
https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.12060
https://www.proquest.com/docview/1350555767
https://www.proquest.com/docview/1365066397
Volume 32
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVEBS
  databaseName: EBSCOhost Academic Search Ultimate
  customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn
  eissn: 1467-8659
  dateEnd: 20241101
  omitProxy: true
  ssIdentifier: ssj0004765
  issn: 0167-7055
  databaseCode: ABDBF
  dateStart: 19980301
  isFulltext: true
  titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn
  providerName: EBSCOhost
– providerCode: PRVEBS
  databaseName: Inspec with Full Text
  customDbUrl:
  eissn: 1467-8659
  dateEnd: 20241101
  omitProxy: false
  ssIdentifier: ssj0004765
  issn: 0167-7055
  databaseCode: ADMLS
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text
  providerName: EBSCOhost
– providerCode: PRVWIB
  databaseName: Wiley Online Library - Core collection (SURFmarket)
  issn: 0167-7055
  databaseCode: DR2
  dateStart: 19970101
  customDbUrl:
  isFulltext: true
  eissn: 1467-8659
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004765
  providerName: Wiley-Blackwell
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA9DX_TBb3E6pYrIXjpS06YRn2S4DkHxc-5BCE2aiijb2Aeof7136YdTFMS3Qq9wl-Ryv2suvyNk3xhOjaa-m9JAuL72uKvoUerGKQQPDiHQO8LbyOcXvH3nn3WDboUcF3dhMn6I8ocbeobdr9HBYzWacnL9mDa8Q8oxX_cYt-nU9Sd1lB_yoOD1RsaYnFUIq3jKL7_Eolkc1tcvQHMartp401okD4WmWZnJc2MyVg39_o3E8Z-mLJGFHIc6J9nCWSYV01sh81PshKukfpLEA9wNnasJjH9-YdPpPOUVtW9OM6vEXCM3rdPbZtvNGyu4mnFBXWH8hIeYbHm-jrXRTItQxz5TFPCZCU0i4iCAwE4h1U4N5CApVcpTnCeAmNg6men1e2aDOIILzjRNmeEMexiLFLC6AoxoBAPcaKqkXgyw1DnnOLa-eJFF7gGmS2t6leyVooOMaOMnoQM7S6VEPHzGyrQwkPcXkQwuo2bn5jqSIFgrplHmTjmSHguQ3izkYZXslq_BnfCMJO6Z_gRlALJyPO0E3e2c_a6NbEYt-7D5d9EtMndoG2pgyWSNzIyHE7MNsGasduz6_QDSze8h
linkProvider Wiley-Blackwell
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEB7EHtSDb7E-VxHxsiXb7GZT8CLFtr6Ktr4uEnbTrEilFW1B_fXO7MsqCuJtYSeQZDKZb5LJNwA7xghmNHPtiHnSdrUj7JBVIjuI0HkIdIFOhV4jnzVF48o9vvVux2A_ewuT8EPkB25kGfF-TQZOB9IjVq7vo5JTZgID9oIrME4hSNT6JI9yfeFlzN7EGZPyClEeT970izcq0MS-foGao4A19ji1GbjL-pokmnRLw0FY0u_faBz_O5hZmE6hqHWQrJ05GDO9eZgaIShcgL2DTvBEG6J1MUQVpG82reuHNKn2zaomyZiL0K4dXlYbdlpbwdZcSGZL43aET_GW4-pAG8219HXg8pAhRDO-6cjA89C3M4y2I4NhSMTC0AmF6CBo4ksw3uv3zDJYUkjBNYu4EZzKGMsI4XqIMNFIjtDRFGEvm2GlU9pxqn7xqLLwA4eu4qEXYTsXfUq4Nn4S2o3VlEsEz11KTvM9ddOsK--8Xr1ut-oKBdcyParULl-Uwz1iOPOFX4St_DdaFF2TBD3TH5IMolZBF57Y91hpv_dGVeu1-GPl76KbMNG4PDtVp0fNk1WYLMf1NSiDcg3GB89Ds44oZxBuxIv5A-Ad80I
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZSyQxEC5EQdwHz10cz1Zk8aWHtOmkM-CLjM54Dh67ri8SutOJiDIOOgPqr7eqL0dxYdm3hq6GJJVKfdWp-gpgw1rJrGGh75hQfmgC6Ses4fzYofOQ6AKDBlUjn3Tk_u_w8EpcjcB2WQuT80NUP9zIMrLzmgzc9lI3ZOXmxtWDLSYxYB8LRUNRQt_u-Tt5VBhJUTJ7E2dMwStEeTzVpx-80Rgt7PMHqDkMWDOP05qC63KseaLJXX3QT-rm9RON4_9OZhomCyjq7eR7ZwZGbHcWvg0RFM7B5k4a9-hA9M4GqIKiZtO7vC2Sal-8Zp6M-R0uWnu_mvt-0VvBN1wq5isbpjKieCsITWys4UZFJg55whCi2cimKhYCfTvDaNtZDEMcS5IgkTJF0MR_wGj3oWvnwVNSSW6Y41ZyamOsHML1BGGiVRyho63BZrnC2hS049T94l6X4QdOXWdTr8F6JdrLuTa-EvqZqamSiB_vKDktEvpPp63Fabt5eXHe1ii4VOpRF3b5pAMuiOEsklEN1qrXaFF0TRJ37cOAZBC1SrrwxLFnSvv7aHSz3coeFv5ddBXGT3db-vigc7QIE1tZew1KoFyC0f7jwC4jyOknK9lefgOYYvLG
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+Quantization+Visibility+Caching&rft.jtitle=Computer+graphics+forum&rft.au=Popov%2C+Stefan&rft.au=Georgiev%2C+Iliyan&rft.au=Slusallek%2C+Philipp&rft.au=Dachsbacher%2C+Carsten&rft.date=2013-05-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=32&rft.issue=2pt4&rft.spage=399&rft.epage=408&rft_id=info:doi/10.1111%2Fcgf.12060&rft.externalDBID=n%2Fa&rft.externalDocID=10_1111_cgf_12060
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