Mathieu Desbrun

Dr. Mathieu Desbrun

orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2003
Verified
Book Chapter
Closed access
PDF file
MMMark Meyer
Mark Meyer
MDMathieu Desbrun
Mathieu Desbrun
PSPeter Schröder
Peter Schröder
ABAlan H. Barr
Alan H. Barr

1 January 1999
Verified
Conference Paper
Open access
PDF file
MDMathieu Desbrun
Mathieu Desbrun
MMMark Meyer
Mark Meyer
PSPeter Schröder
Peter Schröder
ABAlan H. Barr
Alan H. Barr

1 September 2002 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
MDMathieu Desbrun
Mathieu Desbrun
MMMark Meyer
Mark Meyer
PAPierre Alliez
Pierre Alliez

1 August 2004 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PDF file
DCDavid Cohen-Steiner
David Cohen-Steiner
PAPierre Alliez
Pierre Alliez
MDMathieu Desbrun
Mathieu Desbrun
A method for concise, faithful approximation of complex 3D datasets is key to reducing the computational cost of graphics applications. Despite numerous applications ranging from geometry compression to reverse engineering, efficiently capturing the geometry of a surface remains a tedious task. In this paper, we present both theoretical and practical contributions that result in a novel and versatile framework for geometric approximation of surfaces. We depart from the usual strategy by casting shape approximation as a variational geometric partitioning problem. Using the concept of geometric proxies, we drive the distortion error down through repeated clustering of faces into best-fitting regions. Our approach is entirely discrete and error-driven, and does not require parameterization or local estimations of differential quantities. We also introduce a new metric based on normal deviation, and demonstrate its superior behavior at capturing anisotropy.

1 July 2003 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PDF file
TJThouis R. Jones
Thouis R. Jones
FDFrédo Durand
Frédo Durand
MDMathieu Desbrun
Mathieu Desbrun
With the increasing use of geometry scanners to create 3D models, there is a rising need for fast and robust mesh smoothing to remove inevitable noise in the measurements. While most previous work has favored diffusion-based iterative techniques for feature-preserving smoothing, we propose a radically different approach, based on robust statistics and local first-order predictors of the surface. The robustness of our local estimates allows us to derive a non-iterative feature-preserving filtering technique applicable to arbitrary "triangle soups". We demonstrate its simplicity of implementation and its efficiency, which make it an excellent solution for smoothing large, noisy, and non-manifold meshes.

1 August 2001
Verified
Conference Paper
Open access
PDF file
GDGilles Debunne
Gilles Debunne
MDMathieu Desbrun
Mathieu Desbrun
MCMarie-Paule Cani
Marie-Paule Cani
ABAlan H. Barr
Alan H. Barr