T-base: A triangle-based iterative algorithm for smoothing quadrilateral meshes

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a novel approach named T-Base 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 T-Base are given and compared with Laplacian smoothing: The Vari.1 of T-Base 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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Mei, G., Tipper, J. C., & Xu, N. (2013). T-base: A triangle-based iterative algorithm for smoothing quadrilateral meshes. In Lecture Notes in Electrical Engineering (Vol. 212 LNEE, pp. 305–315). https://doi.org/10.1007/978-3-642-34531-9_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free