#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1980

2013

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

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michel Habib, Bernard Péroche
- Discrete Mathematics
- 1982

We present here a conjecture on partitioning the edges of a graph into k-linear forests (forest whose connected components are paths of length less or equal to k).

- Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche
- Discrete Mathematics
- 1984

Abstract Let us call a linear- k -forest a graph whose connected components are chains of length at most k . The linear- k -arboricity of G (denoted la k ( G )) is the minimum number of linear k… (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… (More)

- J-L. Binot, Pierre Falzon, +4 authors Marvin M. Wilson
- 1990

This paper describes the architecture and the first implementation results of a multimodal dialogue interface for knowledge based systems developed in the context of Esprit II project MMI2. The paper… (More)

We denote by a linear k -forest a graph whose connected components are chains of length less than or equal to k . We define the linear fc-arboricity of a graph G as the minimum number of linear k… (More)

Linear perspective projections are used extensively in graphics. They provide a non-distorted view, with simple computations that map easily to hardware. Non-linear projections, such as the view… (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… (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… (More)

- Hikoe Enomoto, Bernard Péroche
- Journal of Graph Theory
- 1984

We prove that the linear arboricity of every 5-regular graph is 3. That is, the edges of any 5-regular graph are covered by three linear forests. We also determine the linear arboricity of 6-regular… (More)

- Pascale Roudier, Bernard Péroche, M. Perrin
- Comput. Graph. Forum
- 1993

This paper describes an original approach to terrain evolution in landscapes synthesis. In order to create some realistic landforms, we simulate geologically contrasted terrains and apply to them… (More)