Publications / 2025 / Surface Smoothing based on Discrete Orthogonal Polynomial

Surface Smoothing based on Discrete Orthogonal Polynomial

Lu Lei, Li Ning, Wei Pan, Tang Wenming
Computer-Aided Design and Applications, 22(6):1027-1039
Graphic abstract from the Overleaf source: noisy synthetic and scanned meshes are smoothed by non-local normal estimation, orthogonal polynomial normal filtering, and vertex updating.
— Summary

This paper studies feature-preserving denoising for triangle meshes obtained from 3D scanning and digitization. The core difficulty is familiar in industrial geometry processing: noise must be removed, but edges, creases, holes, and local shape details must survive the smoothing step.

Problem setting

Many early smoothing methods are isotropic, so they reduce noise but also shrink surfaces or blur sharp features. Later anisotropic methods such as bilateral normal filtering, guided normal filtering, sparse L0/L1 formulations, half-kernel Laplacian operators, and segmentation-driven filters improve feature preservation, but they can still be sensitive to local noise or expensive optimization.

This work takes a normal-first route. Instead of trusting a single noisy face normal or a small local neighborhood, it builds a more stable support region from non-local similar structures and then filters the resulting normal matrix with an orthogonal polynomial basis.

Algorithm principle

For each face, the method starts with an r-ring local structure. A normal tensor is estimated from neighboring faces with spatial and angular weights, and its dominant eigenvector gives a representative local direction. Faces whose normals deviate strongly from this direction are removed, producing a local co-oriented structure.

The search is then expanded to a larger R-ring neighborhood. Local co-oriented structures with similar directions are collected as non-local similar structures, so the normal estimate is not dominated by a single small noisy patch. This gives a richer support set for feature-aware denoising.

Algorithm overview from noisy mesh to filtered normals and updated vertices

Algorithm overview. The pipeline estimates non-local similar structures, filters normals, and updates mesh vertices from the refined normal field.

Orthogonal polynomial filtering

For each non-local similar structure, face normals are stacked into a matrix and reshaped into a near-square normal matrix. The method constructs orthogonal polynomial bases in the X and Y directions, using Legendre-style basis functions over the interval [-1, 1]. The normal matrix is projected through these bases and reconstructed, which suppresses high-frequency noise while reducing interference between polynomial orders.

Legendre polynomial basis used for orthogonal polynomial normal fitting

Orthogonal basis. The first six Legendre polynomials illustrate the low-order basis used to fit and smooth the normal matrix.

When overlapping structures contribute to the same face, the method accumulates the filtered normal estimates and divides by the corresponding weights. The final step updates each vertex by averaging displacements along the filtered normals of its incident faces.

Synthetic mesh results

The experiments compare the proposed method with L0-minimisation, Bilateral Normal Filter (BNF), Unilateral Normal Filter (UNF), Guided Normal Filter (GNF), L1-median filtering, Half-kernel Laplacian Operator (HLO), and Segmentation-Driven Feature-Preserving filtering (SNF). The paper evaluates both visual quality and quantitative errors, including vertex-based error and mean square angular error.

CAD synthetic mesh smoothing comparison

CAD benchmark. The proposed result removes the heavy synthetic noise while keeping the mechanical feature boundaries sharper than several competing filters.

Octaflower synthetic mesh smoothing comparison

Octaflower benchmark. The method preserves the spiral structure and suppresses surface roughness, matching the qualitative conclusions in the paper’s synthetic-noise experiments.

Real scanned meshes

The paper also tests raw scanned meshes where noise comes from acquisition rather than synthetic perturbation. On the Angel and Nicolo examples, the method smooths high-frequency scan artifacts while retaining salient geometric structures. The manuscript notes that SNF can be slightly better on one Angel case, but the proposed method remains stronger than several other baselines and maintains good feature fidelity.

Raw scanned mesh denoising comparison

Raw scanned data. The method is evaluated on scanned Angel and Nicolo meshes, where it reduces acquisition noise without washing away the main geometry.

Robustness and limitation

The Bunny stress test studies different noise levels on the same irregular model. The method performs well under low and moderate noise levels, especially at 0.1 and 0.3, but the paper reports limitations when the noise level becomes very high, such as 0.5. This is a useful boundary condition for deployment: the method is strongest when non-local similar structures can still be recovered reliably from the noisy mesh.

Bunny denoising results under multiple noise levels

Noise-level stress test. Low and moderate noise are handled effectively; extremely heavy noise remains a harder case.

Takeaway

The practical contribution is a robust normal-filtering pipeline for 3D mesh preprocessing. By combining non-local similar structures with orthogonal polynomial fitting, the method smooths scanning noise while retaining sharp features that are important for downstream CAD repair, inspection, reverse engineering, and geometry-based manufacturing workflows.

Type
Article Journal
Topic
Geometry Processing
Venue
Computer-Aided Design and Applications, 22(6):1027-1039
Year
2025
DOI