Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Singapore-MIT Alliance (SMA)
  3. Computer Science (CS)
  4. Non-Iterative, Feature-Preserving Mesh Smoothing

Non-Iterative, Feature-Preserving Mesh Smoothing

Thumbnail Image
Download
Name

CS016.pdf

Size

7.95 MB

Format

Adobe PDF

Checksum (MD5)

015455b6ab59ceb5aba0f850b5eb1684

Author(s)
Jones, Thouis R.
•
Durand, Frédo
•
Desbrun, Mathieu
Date Issued
January 2004
Series/Report no.
Computer Science (CS);
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.
Subjects
mesh smoothing
robust statistics
mollification
feature preservation
Persistent DSpace Link
http://hdl.handle.net/1721.1/3866
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.