T-Base: A Triangle-Based Iterative Algorithm for Smoothing Quadrilateral Meshes
Abstract
We present a novel approach named TBase for smoothing planar and surface quadrilateral meshes. Our motivation is that the best shape of quadrilateral element (square) can be virtually divided into a pair of equilateral right triangles by any of its diagonals. When move a node to smooth a quadrilateral, it is optimal to make a pair of triangles divided by a diagonal be equilateral right triangles separately. The finally smoothed position is obtained by weighting all individual optimal positions. Three variants are produced according to the determination of weights. Tests by the TBase are given and compared with Laplacian smoothing: The Vari.1 of TBase is effectively identical to Laplacian smoothing for planar quad meshes, while Vari.2 is the best. For the quad mesh on underlying parametric surface and interpolation surface, Vari.2 and Vari.1 are best, respectively.
Cite
@article{arxiv.1212.6036,
title = {T-Base: A Triangle-Based Iterative Algorithm for Smoothing Quadrilateral Meshes},
author = {Gang Mei and John C. Tipper and Nengxiong Xu},
journal= {arXiv preprint arXiv:1212.6036},
year = {2013}
}
Comments
Proceedings of the 2012 International Conference on Information Technology and Software Engineering Lecture Notes in Electrical Engineering Volume 212, 2013, pp 305-315