A new smoothing algorithm for quadrilateral and hexahedral meshes

Authors:
Sanjay Kumar Khattri
Affiliations:
Department of Mathematics, University of Bergen, Norway
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Year:
2006

Citing 5
Cited 0

Discrete smooth interpolation

ACM Transactions on Graphics (TOG)
Mesh Smoothing Using A Posteriori Error Estimates

SIAM Journal on Numerical Analysis
Smoothing an overlay grid to minimize linear distortion in texture mapping

ACM Transactions on Graphics (TOG)
Mean value coordinates

Computer Aided Geometric Design
Globally smooth parameterizations with low distortion

ACM SIGGRAPH 2003 Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mesh smoothing (or r-refinement) are used in computer aided design, interpolation, numerical solution of partial differential equations, etc. We derive a new smoothing called parallelogram smoothing. The new smoothing tries to fit a given domain by the parallelograms. We present several numerical examples and compare our results against the traditional Laplacian smoothing. Presented numerical work shows that the new approach is superior to the Laplacian smoothing.