![](bga.png)
REFERENCES
´
Afra, A. T., Wald, I., Benthin, C., and Woop, S. (2016).
Embree ray tracing kernels: Overview and new fea-
tures. In ACM SIGGRAPH 2016 Talks, SIGGRAPH
’16, pages 52:1–52:2, New York, NY, USA. ACM.
Bus, N., Mustafa, N. H., and Biri, V. (2015a). Global il-
lumination using well-separated pair decomposition.
Computer Graphics Forum, 34(8):88–103.
Bus, N., Mustafa, N. H., and Biri, V. (2015b). Illumina-
tionCut. Computer Graphics Forum (Proceedings of
Eurographics 2015), 34(2):561 – 573.
Callahan, P. B. and Kosaraju, S. R. (1995). A decomposition
of multidimensional point sets with applications to k-
nearest-neighbors and n-body potential fields. J. ACM,
42(1):67–90.
Dachsbacher, C., K
ˇ
riv
´
anek, J., Ha
ˇ
san, M., Arbree, A., Wal-
ter, B., and Nov
´
ak, J. (2014). Scalable realistic ren-
dering with many-light methods. Computer Graphics
Forum, 33(1):88–104.
Davidovi
ˇ
c, T., Georgiev, I., and Slusallek, P. (2012). Pro-
gressive lightcuts for gpu. In ACM SIGGRAPH 2012
Talks, SIGGRAPH ’12, New York, NY, USA. ACM.
Davidovi
ˇ
c, T., K
ˇ
riv
´
anek, J., Ha
ˇ
san, M., Slusallek, P., and
Bala, K. (2010). Combining global and local virtual
lights for detailed glossy illumination. ACM Trans.
Graph., 29(6):143:1–143:8.
Dutr
´
e, P., Bala, K., Bekaert, P., and Shirley, P. (2006). Ad-
vanced Global Illumination. AK Peters Ltd.
Ernst, M. and Greiner, G. (2008). Multi Bounding Volume
Hierarchies. In IEEE Symposium on Interactive Ray
Tracing, RT ’08, pages 35–40.
Georgiev, I., K
ˇ
riv
´
anek, J., Popov, S., and Slusallek, P.
(2012). Importance caching for complex illumination.
Computer Graphics Forum, 31(2pt3):701–710.
Georgiev, I. and Slusallek, P. (2010). Simple and Robust Ite-
rative Importance Sampling of Virtual Point Lights. In
Lensch, H. P. A. and Seipel, S., editors, Eurographics
2010 - Short Papers. The Eurographics Association.
Ha
ˇ
san, M., Pellacini, F., and Bala, K. (2007). Matrix row-
column sampling for the many-light problem. ACM
Trans. Graph., 26(3).
Ha
ˇ
san, M., Vel
´
azquez-Armendariz, E., Pellacini, F., and
Bala, K. (2008). Tensor clustering for rendering
many-light animations. In Proceedings of the Nine-
teenth Eurographics Conference on Rendering, EGSR
’08, pages 1105–1114, Aire-la-Ville, Switzerland. Eu-
rographics Association.
Hedman, P., Karras, T., and Lehtinen, J. (2016). Sequential
monte carlo instant radiosity. In Proceedings of the
20th ACM SIGGRAPH Symposium on Interactive 3D
Graphics and Games, I3D ’16, pages 121–128, New
York, NY, USA. ACM.
Huo, Y., Wang, R., Jin, S., Liu, X., and Bao, H. (2015).
A matrix sampling-and-recovery approach for many-
lights rendering. ACM Trans. Graph., 34(6):210:1–
210:12.
Keller, A. (1997). Instant radiosity. In Proceedings of
the 24th Annual Conference on Computer Graphics
and Interactive Techniques, SIGGRAPH ’97, pages
49–56, New York, NY, USA. ACM Press/Addison-
Wesley Publishing Co.
K
ˇ
riv
´
anek, J., Fajardo, M., Christensen, P. H., Tabellion, E.,
Bunnell, M., Larsson, D., and Kaplanyan, A. (2010).
Global illumination across industries. In ACM SIG-
GRAPH 2010 Courses, SIGGRAPH ’10, New York,
NY, USA. ACM.
Lopes, R. H. C., Reid, I. D., and Hobson, P. R. (2014). A
well-separated pairs decomposition algorithm for k-d
trees implemented on multi-core architectures. Jour-
nal of Physics: Conference Series, 513(5):052011.
O’Donnell, Y. and Chajdas, M. G. (2017). Tiled light trees.
In Proceedings of the 21st ACM SIGGRAPH Sympo-
sium on Interactive 3D Graphics and Games, I3D ’17,
pages 1:1–1:7, New York, NY, USA. ACM.
Ou, J. and Pellacini, F. (2011). Lightslice: Matrix slice
sampling for the many-lights problem. ACM Trans.
Graph., 30(6):179:1–179:8.
Paquette, E., Poulin, P., and Drettakis, G. (1998). A light
hierarchy for fast rendering of scenes with many lig-
hts. Computer Graphics Forum, 17(3):63–74.
Rehfeld, H. and Dachsbacher, C. (2016). Lightcut interpola-
tion. In Proceedings of High Performance Graphics,
HPG ’16, pages 99–108, Aire-la-Ville, Switzerland.
Eurographics Association.
Ritschel, T., Grosch, T., Kim, M. H., Seidel, H.-P., Dachs-
bacher, C., and Kautz, J. (2008). Imperfect Shadow
Maps for Efficient Computation of Indirect Illumina-
tion. ACM Trans. Graph. (Proc. of SIGGRAPH ASIA
2008), 27(5).
Simon, F., Hanika, J., and Dachsbacher, C. (2015). Rich-
vpls for improving the versatility of many-light met-
hods. Comput. Graph. Forum, 34(2):575–584.
Walter, B., Arbree, A., Bala, K., and Greenberg, D. P.
(2006). Multidimensional lightcuts. ACM Trans.
Graph., 25(3):1081–1088.
Walter, B., Fernandez, S., Arbree, A., Bala, K., Donikian,
M., and Greenberg, D. P. (2005). Lightcuts: A sca-
lable approach to illumination. ACM Trans. Graph.,
24(3):1098–1107.
Walter, B., Khungurn, P., and Bala, K. (2012). Bidirectional
lightcuts. ACM Trans. Graph., 31(4):59:1–59:11.
Wang, G., Xie, G., and Wang, W. (2011). Efficient search
of lightcuts by spatial clustering. In SIGGRAPH Asia
2011 Sketches, SA ’11, pages 26:1–26:2, New York,
NY, USA. ACM.
Yoshida, H., Nabata, K., Iwasaki, K., Y., D., and T., N.
(2015). Adaptive importance caching for many-light
rendering. Journal of WSCG, 23(1):65–72.
GRAPP 2018 - International Conference on Computer Graphics Theory and Applications
90