Mathias Paulin

Learn More
We present a new real-time soft shadow algorithm using a single shadow map per light source. Therefore, our algorithm is well suited to render both complex and dynamic scenes, and it handles all rasterizable geometries. The key idea of our method is to use the shadow map as a simple and uniform discretized represention of the scene, thus allowing us to(More)
We introduce a new family of binary composition operators that solves four major problems of constructive implicit modeling: suppressing bulges when two shapes merge, avoiding unwanted blending at a distance, ensuring that the resulting shape keeps the topology of the union, and enabling sharp details to be added without being blown up. The key idea is that(More)
Geometric skinning techniques, such as smooth blending or dual-quaternions, are very popular in the industry for their high performances, but fail to mimic realistic deformations. Other methods make use of physical simulation or control volume to better capture the skin behavior, yet they cannot deliver real-time feedback. In this paper, we present the(More)
The recent soft shadow mapping technique [GBP06] allows the rendering in real-time of convincing soft shadows on complex and dynamic scenes using a single shadow map. While attractive, this method suffers from shadow overestimation and becomes both expensive and approximate when dealing with large penumbrae. This paper proposes new solutions removing these(More)
At present, the best way to render textured pointsampled 3D objects is doubtless the use of elliptical weighted average (EWA) surface splatting. This technique provides a high quality rendering of complex point models with anisotropic texture filtering. In this paper we present a new multi-pass approach to perform EWA surface splatting on modern PC graphics(More)
This paper presents a reformulation of bidirectional path-tracing that adequately divides the algorithm into processes efficiently executed in parallel on both the CPU and the GPU. We thus benefit from high-level optimization techniques such as double buffering, batch processing, and asyncronous execution, as well as from the exploitation of most of the(More)
The modelling and reformulation of constraint networks are recognised as important problems. The task of automatically acquiring a constraint network formulation of a problem from a subset of its solutions and non-solutions has been presented in the literature. However, the choice of such a subset was assumed to be made independently of the acquisition(More)
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate the generation of shadows from the computation of lighting. In addition to such approximations, they generate shadows using some restrictive assumptions only correct in very specific(More)
Volumetric representations provide the localization of shapes in space. When such representation is created on the fly from the geometry, it becomes very useful for a wide range of applications (constructive solid geometry (CSG), shape repair, collision detection, etc. Using the advanced functionalities provided by recent GPUs (geometry shaders, 32-bit(More)