Fabrice Neyret
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Fabrice Neyret has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Antoine Richermoz
INRIA / LJK (CNRS, UGA, INP-G), Grenoble, France
1 shared publication - Derek Nowrouzezahrai
Department of Computer Science and Operations Research, University of Montréal, Canada
1 shared publication - Eric Heitz
Inria–Jean Kuntzmann Laboratory (Université de Grenoble and CNRS) , Saint Ismier Cedex , France
1 shared publication - Guillaume Loubet
INRIA Univ. Grenoble Alpes/LJK, CNRS/LJK
1 shared publication - Guillaume Loubet
INRIA, Univ. Grenoble Alpes/LJK; CNRS/LJK
1 shared publication - Mathéo Moinet
INRIA / LJK (CNRS, UGA, INP‐G) France
1 shared publication
Latest Publications
- 17 April 2025
- Published by Wiley in Computer Graphics Forum
- Vol. 44 (2)
Fast sphere tracing of procedural volumetric noise for very large and detailed scenes
Real‐time walk through very large and detailed scenes is a challenge for both content design, data management, and rendering, and requires LOD to handle the scale range. In the case of partly stochastic content (clouds, cosmic dust, fire, terrains, etc.), proceduralism allows arbitrary large and detailed scenes with no or little storage and offers embedded LOD, but the rendering gets even costlier. In this paper, we propose to boost the performance of Fractional Brownian Motion (FBM)‐based noise rendering (e.g., 3D Perlin noise, hypertextures) in two ways: improving the stepping efficiency of Sphere Tracing of general Signed Distance Functions (SDF) considering the first and second derivatives, and treating cascaded sums such as FBM as nested bounding volumes. We illustrate this on various scenes made of either opaque material, constant semi‐transparent material, or non‐constant (i.e.,full volumetric inside) material, including animated content ‐ thanks to on‐the‐fly proceduralism. We obtain real‐time performances with speedups up to 12‐folds on opaque or constant semi‐transparent scenes compared to classical Sphere tracing, and up to 2‐folds (through empty space skipping optimization) on non‐constant density volumetric scenes.
- 17 April 2025
- Published by Wiley in Computer Graphics Forum
- Vol. 44 (2)
Fast sphere tracing of procedural volumetric noise for very large and detailed scenes
Real‐time walk through very large and detailed scenes is a challenge for both content design, data management, and rendering, and requires LOD to handle the scale range. In the case of partly stochastic content (clouds, cosmic dust, fire, terrains, etc.), proceduralism allows arbitrary large and detailed scenes with no or little storage and offers embedded LOD, but the rendering gets even costlier. In this paper, we propose to boost the performance of Fractional Brownian Motion (FBM)‐based noise rendering (e.g., 3D Perlin noise, hypertextures) in two ways: improving the stepping efficiency of Sphere Tracing of general Signed Distance Functions (SDF) considering the first and second derivatives, and treating cascaded sums such as FBM as nested bounding volumes. We illustrate this on various scenes made of either opaque material, constant semi‐transparent material, or non‐constant (i.e.,full volumetric inside) material, including animated content ‐ thanks to on‐the‐fly proceduralism. We obtain real‐time performances with speedups up to 12‐folds on opaque or constant semi‐transparent scenes compared to classical Sphere tracing, and up to 2‐folds (through empty space skipping optimization) on non‐constant density volumetric scenes.
- Open Access
- 9 August 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Computer Graphics and Interactive Techniques
- Vol. 7 (3) , 1-11
GigaVoxels DP: Starvation-Less Render and Production for Large and Detailed Volumetric Worlds Walkthrough
Using voxel hierarchies as a generic 3D scene representation makes ray marching, antialiasing, and LOD easy. The drawback is the huge amount of memory required to store voxels, even with empty space compression. Still, GigaVoxels [Crassin et al. 2009] showed that by using a ray-guided cache to produce and store only visible voxels bricks on demand, it is possible to walk through very large and detailed worlds with real-time performance in bounded GPU memory. However, on-demand production of data during rendering is still challenging in terms of synchronization and starvation of GPU cores. We propose a new GPU-driven algorithm using dynamic parallelism (DP) to minimize these, and a "GPU-cores timeline" profiling tool to analyze them. We validate our model with timings (2× gain) and we illustrate it on various scenes.
- 9 August 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Computer Graphics and Interactive Techniques
- Vol. 7 (3) , 1-11
Open AccessGigaVoxels DP: Starvation-Less Render and Production for Large and Detailed Volumetric Worlds Walkthrough
Using voxel hierarchies as a generic 3D scene representation makes ray marching, antialiasing, and LOD easy. The drawback is the huge amount of memory required to store voxels, even with empty space compression. Still, GigaVoxels [Crassin et al. 2009] showed that by using a ray-guided cache to produce and store only visible voxels bricks on demand, it is possible to walk through very large and detailed worlds with real-time performance in bounded GPU memory. However, on-demand production of data during rendering is still challenging in terms of synchronization and starvation of GPU cores. We propose a new GPU-driven algorithm using dynamic parallelism (DP) to minimize these, and a "GPU-cores timeline" profiling tool to analyze them. We validate our model with timings (2× gain) and we illustrate it on various scenes.
- 22 May 2018
- Published by Wiley in Computer Graphics Forum
- Vol. 37 (2) , 111-121
A new microflake model with microscopic self‐shadowing for accurate volume downsampling
Naïve linear methods for downsampling high‐resolution microflake volumes often produce inaccurate appearance, especially when input voxels are very opaque. Preserving correct appearance at all resolutions requires taking into account maskingshadowing effects that occur between and inside dense input voxels. We introduce a new microflake model whose additional parameters characterize self‐shadowing effects at a microscopic scale. We provide an anisotropic self‐shadowing function and microflake distributions for which the scattering coefficients and the phase functions of our model have closed‐form expressions. We use this model in a new downsampling approach in which scattering parameters are computed from local estimations of self‐shadowing probabilities in the input volume. Unlike previous work, our method handles datasets with spatially varying scattering parameters, semi‐transparent volumes and datasets with intricate silhouettes. We show that our method generates LoDs with correct transparency and consistent appearance through scales for a wide range of challenging datasets, allowing for huge memory savings and efficient distant rendering without loss of quality.
- 22 May 2018
- Published by Wiley in Computer Graphics Forum
- Vol. 37 (2) , 111-121
A new microflake model with microscopic self‐shadowing for accurate volume downsampling
Naïve linear methods for downsampling high‐resolution microflake volumes often produce inaccurate appearance, especially when input voxels are very opaque. Preserving correct appearance at all resolutions requires taking into account maskingshadowing effects that occur between and inside dense input voxels. We introduce a new microflake model whose additional parameters characterize self‐shadowing effects at a microscopic scale. We provide an anisotropic self‐shadowing function and microflake distributions for which the scattering coefficients and the phase functions of our model have closed‐form expressions. We use this model in a new downsampling approach in which scattering parameters are computed from local estimations of self‐shadowing probabilities in the input volume. Unlike previous work, our method handles datasets with spatially varying scattering parameters, semi‐transparent volumes and datasets with intricate silhouettes. We show that our method generates LoDs with correct transparency and consistent appearance through scales for a wide range of challenging datasets, allowing for huge memory savings and efficient distant rendering without loss of quality.
- 23 May 2017
- Published by Wiley in Computer Graphics Forum
- Vol. 36 (2) , 431-442
Hybrid mesh-volume LoDs for all-scale pre-filtering of complex 3D assets
- 23 May 2017
- Published by Wiley in Computer Graphics Forum
- Vol. 36 (2) , 431-442
Hybrid mesh-volume LoDs for all-scale pre-filtering of complex 3D assets
- 19 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 20 (7) , 996-1008
Filtering Non-Linear TransferFunctions on Surfaces
Applying non-linear transfer functions and look-up tables to procedural functions (such as noise), surface attributes, or even surface geometry are common strategies used to enhance visual detail. Their simplicity and ability to mimic a wide range of realistic appearances have led to their adoption in many rendering problems. As with any textured or geometric detail, proper filtering is needed to reduce aliasing when viewed across a range of distances, but accurate and efficient transfer function filtering remains an open problem for several reasons: transfer functions are complex and non-linear, especially when mapped through procedural noise and/or geometry-dependent functions, and the effects of perspective and masking further complicate the filtering over a pixel's footprint. We accurately solve this problem by computing and sampling from specialized filtering distributions on the fly, yielding very fast performance. We investigate the case where the transfer function to filter is a color map applied to (macroscale) surface textures (like noise), as well as color maps applied according to (microscale) geometric details. We introduce a novel representation of a (potentially modulated) color map's distribution over pixel footprints using Gaussian statistics and, in the more complex case of high-resolution color mapped microsurface details, our filtering is view- and light-dependent, and capable of correctly handling masking and occlusion effects. Our approach can be generalized to filter other physical-based rendering quantities. We propose an application to shading with irradiance environment maps over large terrains. Our framework is also compatible with the case of transfer functions used to warp surface geometry, as long as the transformations can be represented with Gaussian statistics, leading to proper view- and light-dependent filtering results. Our results match ground truth and our solution is well suited to real-time applications, requires only a few lines of shader code (provided in supplemental material, which can be found on the Computer Society Digital Library at http://doi.ieeecomputersociety.org/10.1109/TVCG.2013.102), is high performance, and has a negligible memory footprint.
- 19 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 20 (7) , 996-1008
Filtering Non-Linear TransferFunctions on Surfaces
Applying non-linear transfer functions and look-up tables to procedural functions (such as noise), surface attributes, or even surface geometry are common strategies used to enhance visual detail. Their simplicity and ability to mimic a wide range of realistic appearances have led to their adoption in many rendering problems. As with any textured or geometric detail, proper filtering is needed to reduce aliasing when viewed across a range of distances, but accurate and efficient transfer function filtering remains an open problem for several reasons: transfer functions are complex and non-linear, especially when mapped through procedural noise and/or geometry-dependent functions, and the effects of perspective and masking further complicate the filtering over a pixel's footprint. We accurately solve this problem by computing and sampling from specialized filtering distributions on the fly, yielding very fast performance. We investigate the case where the transfer function to filter is a color map applied to (macroscale) surface textures (like noise), as well as color maps applied according to (microscale) geometric details. We introduce a novel representation of a (potentially modulated) color map's distribution over pixel footprints using Gaussian statistics and, in the more complex case of high-resolution color mapped microsurface details, our filtering is view- and light-dependent, and capable of correctly handling masking and occlusion effects. Our approach can be generalized to filter other physical-based rendering quantities. We propose an application to shading with irradiance environment maps over large terrains. Our framework is also compatible with the case of transfer functions used to warp surface geometry, as long as the transformations can be represented with Gaussian statistics, leading to proper view- and light-dependent filtering results. Our results match ground truth and our solution is well suited to real-time applications, requires only a few lines of shader code (provided in supplemental material, which can be found on the Computer Society Digital Library at http://doi.ieeecomputersociety.org/10.1109/TVCG.2013.102), is high performance, and has a negligible memory footprint.