#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1999

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Benjamin Segovia, Jean Claude Iehl, Richard Mitanchey, Bernard PÃ©roche
- Graphics Hardware
- 2006

This paper presents a novel and fast technique to combine interleaved sampling and deferred shading on a GPU. The core idea of this paper is quite simple. Interleaved sample patterns are computed in a non-interleaved deferred shading process. The geometric buffer (G-buffer) which contains all of the pixel information is actually split into several separateâ€¦ (More)

- Jonathan Dupuy, Eric Heitz, Jean Claude Iehl, Pierre Poulin, Fabrice Neyret, Victor Ostromoukhov
- ACM Trans. Graph.
- 2013

We present Linear Efficient Antialiased Displacement and Reflectance (LEADR) mapping, a reflectance filtering technique for displacement mapped surfaces. Similarly to LEAN mapping, it employs two mipmapped texture maps, which store the first two moments of the displacement gradients. During rendering, the projection of this data over a pixel is used toâ€¦ (More)

- Benjamin Segovia, Jean Claude Iehl, Richard Mitanchey, Bernard PÃ©roche
- Rendering Techniques
- 2006

This paper presents a new sampling strategy to achieve interactive global illumination on one commodity computer. The goal is to propose an efficient numerical stochastic scheme which can be well adapted to a fast rendering algorithm. As we want to provide an efficient sampling strategy to handle difficult settings without sacrificing performance in commonâ€¦ (More)

- Jonathan Dupuy, Eric Heitz, Jean Claude Iehl, Pierre Poulin, Victor Ostromoukhov
- Comput. Graph. Forum
- 2015

We introduce a novel fitting procedure that takes as input an arbitrary material, possibly anisotropic, and automatically converts it to a microfacet BRDF. Our algorithm is based on the property that the distribution of microfacets may be retrieved by solving an eigenvector problem that is built solely from backscattering samples. We show that theâ€¦ (More)

- Benjamin Segovia, Jean Claude Iehl, Bernard PÃ©roche
- Comput. Graph. Forum
- 2007

We present Metropolis Instant Radiosity (MIR), an unbiased algorithm to solve the Light Transport problem. MIR is a hybrid technique which consists in representing the incoming radiance field by a set of Virtual Point Lights (VPLs) and in computing the response of all sensors in the scene (i.e. camera captors) by accumulating their contributions. Inâ€¦ (More)

- Jean Claude Iehl, Bernard PÃ©roche
- Computers & Graphics
- 2003

Realistic rendering research focuses on generating images that should be perceived the same way as a real scene. We will describe a physically based spectral framework where energy, materials and light field are wavelength dependent. To reduce the computational load we also make use of the high variations of the human vision sensitivity to adapt theâ€¦ (More)

- Guillaume Bouchard, Jean Claude Iehl, Victor Ostromoukhov, Pierre Poulin
- SIGGRAPH ASIA Technical Briefs
- 2013

Directional regularization offers great potential to improve the convergence rates of Monte-Carlo-based global illumination algorithms. In this paper, we show how it can be applied successfully by combining unbiased bidirectional strategies, photon mapping, and biased directional regularization.

- FranÃ§ois Fouquet, Jean-Philippe Farrugia, Jean Claude Iehl, Jonathan Dupuy
- Eurographics
- 2012

This poster presents a new method to evaluate visibility from a point cloud by using a meshless statistical representation. The resulting evaluation uses much less memory than previous work while still producing high quality images, making it suitable for memory limited systems. The obtained results are exposed through the evaluation of shadow maps using aâ€¦ (More)

Interactive visualization is a very convenient tool to explore complex scientific data or to try different parameter settings for a given processing algorithm. In this article, we present a tool to efficiently analyze the curvature tensor on the boundary of potentially large and dynamic digital objects (mean and Gaussian curvatures, principal curvatures,â€¦ (More)

- Jean Claude Iehl, Bernard PÃ©roche
- Comput. Graph. Forum
- 2000