, Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement

, Ieee standard for floating-point arithmetic, 2008.

T. Aila and T. Akenine-möller, A Hierarchical Shadow Volume Algorithm, Graphics Hardware. The Eurographics Association, 2004.

T. Aila and S. Laine, Alias-free shadow maps, Proceedings of the Fifteenth Eurographics Conference on Rendering Techniques, EGSR'04, pp.161-166, 2004.

T. Aila and S. Laine, Understanding the efficiency of ray traversal on gpus, Proceedings of the conference on high performance graphics 2009, pp.145-149, 2009.

T. Aila, S. Laine, and T. Karras, Understanding the efficiency of ray traversal on gpus-kepler and fermi addendum. NVIDIA Corporation, NVIDIA, 2012.

A. Appel, Some techniques for shading machine renderings of solids, Proceedings of the, pp.37-45, 1968.

D. Arthur and S. Vassilvitskii, K-means++ : the advantages of careful seeding, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007.

C. Harlen, I. Batagelo, and J. Costa, Real-time shadow generation using bsp trees and stencil buffers, Proc. SIBGRAPI 99, pp.93-102, 1999.

C. Benthin and I. Wald, Efficient ray traced soft shadows using multifrusta tracing, Proceedings of the Conference on High Performance Graphics, pp.135-144, 2009.

C. Benthin, I. Wald, and P. Slusallek, A scalable approach to interactive global illumination, Computer Graphics Forum, vol.22, pp.621-630, 2003.

C. Benthin, I. Wald, S. Woop, M. Ernst, and W. Mark, Combining single and packet-ray tracing for arbitrary ray distributions on the intel mic architecture, IEEE Transactions on Visualization and Computer Graphics, vol.18, issue.9, pp.1438-1448, 2011.

N. Binder and A. Keller, Efficient stackless hierarchy traversal on gpus with backtracking in constant time, Proceedings of High Performance Graphics, HPG '16, pp.41-50, 2016.

W. Bouknight, A procedure for generation of three-dimensional half-toned computer graphics presentations, Communications of the ACM, vol.13, issue.9, pp.527-536, 1970.

S. Boulos, D. Edwards, D. Lacewell, J. Kniss, J. Kautz et al., Packet-based whitted and distribution ray tracing, Proceedings of Graphics Interface, pp.177-184, 2007.

S. Brabec, T. Annen, and H. Peter-seidel, Practical shadow mapping, Journal of Graphics Tools, vol.7, pp.9-18, 2000.

S. Brabec and H. Seidel, Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement, Computer Graphics Forum, 2003.

J. Carmack, Z-fail shadow volumes, 2000.

E. Catmull, A Subdivision Algorithm for Computer Display of Curved Surfaces, p.7504786, 1974.

M. Chajdas, Geometryfx 1.2 -cluster culling, 2016.

E. Chan and F. Durand, An efficient hybrid shadow rendering algorithm, 2004.

N. Chin and S. Feiner, Near real-time shadow generation using bsp trees, Proceedings of the 16th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH '89, pp.99-106, 1989.

Y. Chrysanthou and M. Slater, Shadow volume bsp trees for computation of shadows in dynamic scenes, Proceedings of the 1995 symposium on Interactive 3D graphics, pp.45-50, 1995.

D. Cohen, -. Steiner, P. Alliez, and M. Desbrun, Variational shape approximation, ACM SIGGRAPH 2004 Papers, SIGGRAPH '04, pp.905-914, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00070632

R. L. Cook, T. Porter, and L. Carpenter, Tutorial : Computer graphics ; image synthesis. chapter Distributed Ray Tracing, pp.139-147, 1988.

C. Franklin and . Crow, The Aliasing Problem in Computer-synthesized Shaded Images, 1976.

C. Franklin and . Crow, Shadow algorithms for computer graphics, SIGGRAPH Comput. Graph, vol.11, issue.2, pp.242-248, 1977.

H. Dammertz, J. Hanika, and A. Keller, Shallow bounding volume hierarchies for fast simd ray tracing of incoherent rays, Computer Graphics Forum, vol.27, pp.1225-1233, 2008.

F. Deves, F. Mora, L. Aveneau, and D. Ghazanfarpour, Scalable real-time shadows using clustering and metric trees, Eurographics Symposium on Rendering -Experimental Ideas & Implementations. The Eurographics Association, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02089095

R. Leonardo, H. Domingues, and . Pedrini, Bounding volume hierarchy optimization through agglomerative treelet restructuring, Proceedings of the 7th Conference on High-Performance Graphics, pp.13-20, 2015.

E. Eisemann and X. Décoret, Fast scene voxelization and applications, ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, pp.71-78, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00510221

E. Eisemann, M. Schwarz, U. Assarsson, and M. Wimmer, Real-time shadows, 2011.

W. Engel, Cascaded shadow maps. ShaderX5 : Advanced Rendering Techniques, 1, 2007.

M. Ernst and G. Greiner, Multi bounding volume hierarchies, 2008 IEEE Symposium on Interactive Ray Tracing, pp.35-40, 2008.

R. Fernando, S. Fernandez, K. Bala, and D. Greenberg, Adaptive shadow maps, Proceedings of the 28th annual conference on Computer graphics and interactive techniques, pp.387-390, 2001.

, Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement

T. Forsyth, Linear-speed vertex cache optimisation, 2006.

K. Garanzha, The use of precomputed triangle clusters for accelerated ray tracing in dynamic scenes, Proceedings of the Eurographics Symposium on Rendering, pp.1199-1206, 2009.

K. Garanzha, J. Pantaleoni, and D. Mcallister, Simpler and faster hlbvh with work queues, Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics, pp.59-64, 2011.

B. Gärtner, Fast and robust smallest enclosing balls, Proceedings of the 7th Annual European Symposium on Algorithms, ESA '99, pp.325-338, 1999.

J. Gerhards, F. Mora, L. Aveneau, and D. Ghazanfarpour, Partitioned Shadow Volumes, Proceedings of Eurographics, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01171682

M. Giegl and M. Wimmer, Fitted virtual shadow maps, Proceedings of Graphics Interface, pp.159-168, 2007.

M. Giegl and M. Wimmer, Queried virtual shadow maps, Symposium on Interactive 3 D Graphics : Proceedings of the 2007 symposium on Interactive 3 D graphics and games, vol.30, pp.65-72, 2007.

S. Gottschalk, C. Ming, D. Lin, and . Manocha, Obbtree : A hierarchical structure for rapid interference detection, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, pp.171-180, 1996.

K. Naga, B. Govindaraju, S. Lloyd, A. Yoon, D. Sud et al., Interactive shadow generation in complex environments, ACM Transactions on Graphics (TOG), vol.22, pp.501-510, 2003.

C. John and . Hart, Sphere tracing : A geometric method for the antialiased ray tracing of implicit surfaces, The Visual Computer, vol.12, issue.10, pp.527-545, 1996.

V. Havran, Heuristic Ray Shooting Algorithms, 2000.

T. Heidmann, Real shadows real-time, 1991.

S. Hill, S. Mcauley, A. Conty, M. L. Drobot, E. Heitz et al., Physically based shading in theory and practice, ACM SIGGRAPH 2017 Courses, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01066241

H. Hoppe, Optimization of mesh locality for transparent vertex caching, Proceedings of the 26th annual conference on Computer graphics and interactive techniques, pp.269-276, 1999.

G. S. Johnson, J. Lee, C. A. Burns, and W. R. Mark, The irregular z-buffer : Hardware acceleration for irregular data structures, ACM Trans. Graph, vol.24, issue.4, pp.1462-1482, 2005.

J. T. Kajiya, The rendering equation, Proceedings of the 13th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH '86, pp.143-150, 1986.

, Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement

T. Karras and T. Aila, Fast parallel construction of high-quality bounding volume hierarchies, Proceedings of the 5th High-Performance Graphics Conference, pp.89-99, 2013.

B. Kerbl, M. Kenzel, E. Ivanchenko, D. Schmalstieg, and M. Steinberger, Revisiting the vertex cache : Understanding and optimizing vertex processing on the modern gpu, Proc. ACM Comput. Graph. Interact. Tech, vol.1, issue.2, 2018.

L. Käellberg and T. Larsson, Ray tracing using hierarchies of slab cut balls, Eurographics 2010 -Short Papers, 2010.

E. Lafortune, Mathematical Models and Monte Carlo Algorithms for Physically Based Rendering, 1996.

E. Larsen, S. Gottschalk, M. C. Lin, and D. Manocha, Fast proximity queries with swept sphere volumes, 1999.

A. Lauritzen, M. Salvi, and A. Lefohn, Sample distribution shadow maps, Symposium on Interactive 3D Graphics and Games, I3D '11, pp.97-102, 2011.

C. Lauterbach, M. Garland, S. Sengupta, D. Luebke, and D. Manocha, Fast bvh construction on gpus, Computer Graphics Forum, vol.28, pp.375-384, 2009.

S. Aaron-e-lefohn, J. Sengupta, R. Kniss, J. Strzodka, and . Owens, Dynamic adaptive shadow maps on graphics hardware, SIGGRAPH Sketches, p.13, 2005.

S. Aaron-e-lefohn, J. Sengupta, R. Kniss, J. Strzodka, and . Owens, Glift : Generic, efficient, random-access gpu data structures, ACM Transactions on Graphics (TOG), vol.25, issue.1, pp.60-99, 2006.

S. Aaron-e-lefohn, J. Sengupta, and . Owens, Resolution-matched shadow maps, ACM Transactions on Graphics (TOG), vol.26, issue.4, p.20, 2007.

D. Lin, K. Shkurko, I. Mallett, and C. Yuksel, Dual-split trees, Symposium on Interactive 3D Graphics and Games (I3D 2019), 2019.

G. Lin and T. Yu, An improved vertex caching scheme for 3d mesh rendering, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.4, pp.640-648, 2006.

D. , B. Lloyd, and D. Tuft, Sung-eui Yoon, and Dinesh Manocha. Warping and Partitioning for Low Error Shadow Maps, Symposium on Rendering. The Eurographics Association, 2006.

D. , B. Lloyd, J. Wendt, N. K. Govindaraju, and D. Manocha, Cc shadow volumes, Proceedings of the Fifteenth Eurographics Conference on Rendering Techniques, EGSR'04, pp.197-205, 2004.

P. Stuart and . Lloyd, Least squares quantization in pcm, IEEE Transactions on Information Theory, vol.28, pp.129-137, 1982.

D. Michael and . Mccool, Shadow volume reconstruction from depth maps, ACM Transactions on Graphics (TOG), vol.19, issue.1, pp.1-26, 2000.

, Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement

D. Meister and J. Bittner, Parallel bvh construction using k-means clustering, Vis. Comput, vol.32, issue.6-8, pp.977-987, 2016.

F. Mora, J. Gerhards, L. Aveneau, and D. Ghazanfarpour, Deep Partitioned Shadow Volumes Using Stackless and Hybrid Traversals, Eurographics Symposium on Rendering, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01406370

B. Naylor, J. Amanatides, and W. Thibault, Merging bsp trees yields polyhedral set operations, SIGGRAPH Comput. Graph, vol.24, issue.4, pp.115-124, 1990.

. Nvidia and . Shadowworks,

J. Pantaleoni and D. Luebke, Hlbvh : hierarchical lbvh construction for real-time ray tracing of dynamic geometry, Proceedings of the Conference on High Performance Graphics, pp.87-95, 2010.

A. Pérard-gayot, J. Kalojanov, and P. Slusallek, Gpu ray tracing using irregular grids, Comput. Graph. Forum, vol.36, issue.2, pp.477-486, 2017.

S. Popov, J. Gunther, H. Seidel, and P. Slusallek, Experiences with streaming construction of sah kd-trees, 2006 IEEE Symposium on Interactive Ray Tracing, pp.89-94, 2006.

S. Popov, J. Günther, H. Seidel, and P. Slusallek, Stackless kd-tree traversal for high performance gpu ray tracing, Computer Graphics Forum, vol.26, pp.415-424, 2007.

V. Srinivas-k-raman, J. Pentkovski, and . Keshava, Implementing streaming simd extensions on the pentium iii processor, IEEE micro, vol.20, issue.4, pp.47-57, 2000.

A. Reshetov, A. Soupikov, and J. Hurley, Multi-level ray tracing algorithm, In ACM Transactions on Graphics, vol.24, pp.1176-1185, 2005.

V. Pedro, D. Sander, J. Nehab, and . Barczak, Fast triangle reordering for vertex locality and reduced overdraw, ACM Transactions on Graphics (TOG), vol.26, issue.3, p.89, 2007.

L. Scandolo, P. Bauszat, and E. Eisemann, Compressed multiresolution hierarchies for high-quality precomputed shadows, Comput. Graph. Forum, vol.35, issue.2, pp.331-340, 2016.

E. Sintorn, E. Eisemann, and U. Assarsson, Sample based visibility for soft shadows using alias-free shadow maps, Proceedings of the Nineteenth Eurographics Conference on Rendering, EGSR '08, pp.1285-1292, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00345285

E. Sintorn, V. Kämpe, O. Olsson, and U. Assarsson, Per-triangle shadow volumes using a view-sample cluster hierarchy, Proceedings of the 18th Meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, pp.111-118, 2014.

E. Sintorn, O. Olsson, and U. Assarsson, An efficient alias-free shadow algorithm for opaque and transparent objects using per-triangle shadow volumes, Proceedings of the 2011 SIGGRAPH Asia Conference, SA '11, vol.153, pp.1-153, 2011.

, Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement

M. Stamminger and G. Drettakis, Perspective shadow maps, ACM Trans. Graph, vol.21, issue.3, pp.557-562, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00606726

M. Stich, Introduction to nvidia rtx and directx ray tracing

M. Stich, H. Friedrich, and A. Dietrich, Spatial splits in bounding volume hierarchies, Proc. High-Performance Graphics, 2009.

M. Stich, C. Wächter, and A. Keller, Efficient and robust shadow volumes using hierarchical occlusion culling and geometry shaders, GPU Gems, vol.3, pp.239-256, 2007.

J. Story, Advanced geometrically correct shadows for modern game engines, 2016.

N. Subtil, Introduction to real-time ray tracing with vulkan

J. K. Uhlmann, Adaptive partitioning strategies for ternary tree structures, Pattern Recognition Letters, vol.12, issue.9, pp.537-541, 1991.

J. K. Uhlmann, Satisfying general proximity / similarity queries with metric trees, Information Processing Letters, vol.40, issue.4, pp.175-179, 1991.

M. Vinkler, V. Havran, and J. Bittner, Performance comparison of bounding volume hierarchies and kd-trees for gpu ray tracing, Computer Graphics Forum, vol.35, pp.68-79, 2016.

I. Wald and C. Benthin, Openrt -a flexible and scalable rendering engine for interactive 3d graphics, 2002.

I. Wald, P. Slusallek, C. Benthin, and M. Wagner, Interactive rendering with coherent ray tracing, Computer graphics forum, vol.20, pp.153-165, 2001.

I. Wald, S. Woop, C. Benthin, S. Gregory, M. Johnson et al., Embree : a kernel framework for efficient cpu ray tracing, ACM Transactions on Graphics (TOG), vol.33, issue.4, p.143, 2014.

T. Whitted, An improved illumination model for shaded display, Commun. ACM, vol.23, issue.6, pp.343-349, 1980.

L. Williams, Casting curved shadows on curved surfaces, SIGGRAPH Comput. Graph, vol.12, issue.3, pp.270-274, 1978.

M. Wimmer, D. Scherzer, and W. Purgathofer, Light Space Perspective Shadow Maps, Eurographics Workshop on Rendering. The Eurographics Association, 2004.

J. Wu and L. Kobbelt, Structure recovery via hybrid variational surface approximation, Computer Graphics Forum, vol.24, pp.277-284, 2005.

C. Wyman, R. Hoetzlein, and A. Lefohn, Frustum-traced raster shadows : Revisiting irregular z-buffers, Proceedings of the 19th Symposium on Interactive 3D Graphics and Games, i3D '15, pp.15-23, 2015.

N. Peter and . Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '93, pp.311-321, 1993.

, Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement

H. Ylitie, T. Karras, and S. Laine, Efficient incoherent ray traversal on gpus through compressed wide bvhs, Proceedings of High Performance Graphics, 2017.

P. Zezula, G. Amato, V. Dohnal, and M. Batko, Similarity Search : The Metric Space Approach, Advances in Database Systems, vol.32, 2006.

F. Zhang, H. Sun, L. Xu, and L. K. Lun, Parallel-split shadow maps for large-scale virtual environments, Proceedings of the 2006 ACM International Conference on Virtual Reality Continuum and Its Applications, VRCIA '06, pp.311-318, 2006.

, Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement Enfin on peutégalement penser aux méthodes d'occultation ambiante volumétrique qui nécessitent de connaître la géométrie présente au voisinage d'un point. Là encore, c'est une problématique pour laquelle les arbres métriques sont applicables

, Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement Volumes d'ombre en rendu temps réel : complexité géométrique et stratégie de partitionnement LABORATOIRE XLIM -UMR CNRS n ? 7252 123