Non-iterative, feature-preserving mesh smoothing

Citations Over TimeTop 1% of 2003 papers

Abstract

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.

Related Papers

• An Angle-Based Approach to Two-Dimensional Mesh Smoothing.(2000)
• → Optismoothing: An optimization-driven approach to mesh smoothing(1993)118 cited
• One Mesh Smoothing Algorithm Combining Laplacian and Local Optimization-Based Mesh Smoothing Techniques(2010)
• Feature-preserving uniform mesh smoothing algorithm(2013)
• → New Weights in Laplacian Smoothing on Triangular Mesh(2017)