Efficient, fair interpolation using Catmull-Clark surfaces
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
A signal processing approach to fair surface design
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Multiresolution analysis for surfaces of arbitrary topological type
ACM Transactions on Graphics (TOG)
Subdivision surfaces in character animation
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Non-uniform recursive subdivision surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Implicit fairing of irregular meshes using diffusion and curvature flow
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Multiresolution signal processing for meshes
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Anisotropic geometric diffusion in surface processing
Proceedings of the conference on Visualization '00
Non-iterative, feature-preserving mesh smoothing
ACM SIGGRAPH 2003 Papers
ACM SIGGRAPH 2003 Papers
Modified subdivision surfaces with continuous curvature
ACM SIGGRAPH 2006 Papers
Modeling with multiresolution subdivision surfaces
ACM SIGGRAPH 2006 Courses
Hi-index | 0.00 |
A new approach for removing noises from a corrupted 3D model (mesh or surface) of arbitrary topology is presented. The basic idea is to transform a space domain model into a frequency-like domain representation and achieve denoising by low pass filtering. The transformation from space domain to frequency domain is done by decomposing the 3D model into an infinite series of meshes of the same topology but less magnitude so that each mesh represents part of the information of the given model, with some meshes containing more information on overall shape while others containing more on subtle details. The transformation process does not require setting up any linear systems, nor any matrix computation, but is done by iteratively moving vertices of the given mesh locally until a smooth model with noises properly removed is reached. The iterative process converges at an exponential rate. Therefore the new iterative method is very fast and can be used for meshes with large number of vertices. The mesh decomposition scheme is obtained using the concept of Catmull-Clark subdivision surfaces, but the same idea can be applied to other subdivision schemes as well. Some test results obtained using this method are included. They show that the iterative method can achieve visually pleasant resulting models with noises properly removed.