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).Expand

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… Expand

We present Metropolis Instant Radiosity (MIR), an unbiased algorithm to solve the Light Transport problem, which replaces the incoming radiance field by a set of Virtual Point Lights (V PLs).Expand

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.Expand

A new boundary evaluation method is presented. It is based on error-free Boolean operations on polyhedral solids. W e describe, in detail, an intersection algorithm that handles, in a straightforward… Expand

This paper presents a method taking global illumination into account in a ray tracing environment, which allows to deal with all the types of light paths and the directional properties of materials.Expand