3D Gaussian Ray Tracing: Fast Tracing of Particle Scenes
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914968874516480 |
|---|---|
| author | Moenne-Loccoz, Nicolas Mirzaei, Ashkan Perel, Or de Lutio, Riccardo Esturo, Janick Martinez State, Gavriel Fidler, Sanja Sharp, Nicholas Gojcic, Zan |
| author_facet | Moenne-Loccoz, Nicolas Mirzaei, Ashkan Perel, Or de Lutio, Riccardo Esturo, Janick Martinez State, Gavriel Fidler, Sanja Sharp, Nicholas Gojcic, Zan |
| contents | Particle-based representations of radiance fields such as 3D Gaussian Splatting have found great success for reconstructing and re-rendering of complex scenes. Most existing methods render particles via rasterization, projecting them to screen space tiles for processing in a sorted order. This work instead considers ray tracing the particles, building a bounding volume hierarchy and casting a ray for each pixel using high-performance GPU ray tracing hardware. To efficiently handle large numbers of semi-transparent particles, we describe a specialized rendering algorithm which encapsulates particles with bounding meshes to leverage fast ray-triangle intersections, and shades batches of intersections in depth-order. The benefits of ray tracing are well-known in computer graphics: processing incoherent rays for secondary lighting effects such as shadows and reflections, rendering from highly-distorted cameras common in robotics, stochastically sampling rays, and more. With our renderer, this flexibility comes at little cost compared to rasterization. Experiments demonstrate the speed and accuracy of our approach, as well as several applications in computer graphics and vision. We further propose related improvements to the basic Gaussian representation, including a simple use of generalized kernel functions which significantly reduces particle hit counts. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_07090 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | 3D Gaussian Ray Tracing: Fast Tracing of Particle Scenes Moenne-Loccoz, Nicolas Mirzaei, Ashkan Perel, Or de Lutio, Riccardo Esturo, Janick Martinez State, Gavriel Fidler, Sanja Sharp, Nicholas Gojcic, Zan Graphics Computer Vision and Pattern Recognition Particle-based representations of radiance fields such as 3D Gaussian Splatting have found great success for reconstructing and re-rendering of complex scenes. Most existing methods render particles via rasterization, projecting them to screen space tiles for processing in a sorted order. This work instead considers ray tracing the particles, building a bounding volume hierarchy and casting a ray for each pixel using high-performance GPU ray tracing hardware. To efficiently handle large numbers of semi-transparent particles, we describe a specialized rendering algorithm which encapsulates particles with bounding meshes to leverage fast ray-triangle intersections, and shades batches of intersections in depth-order. The benefits of ray tracing are well-known in computer graphics: processing incoherent rays for secondary lighting effects such as shadows and reflections, rendering from highly-distorted cameras common in robotics, stochastically sampling rays, and more. With our renderer, this flexibility comes at little cost compared to rasterization. Experiments demonstrate the speed and accuracy of our approach, as well as several applications in computer graphics and vision. We further propose related improvements to the basic Gaussian representation, including a simple use of generalized kernel functions which significantly reduces particle hit counts. |
| title | 3D Gaussian Ray Tracing: Fast Tracing of Particle Scenes |
| topic | Graphics Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2407.07090 |