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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Khattri, S. K. (2006). A new smoothing algorithm for quadrilateral and hexahedral meshes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3992 LNCS-II, pp. 239–246). Springer Verlag. https://doi.org/10.1007/11758525_32
Mendeley helps you to discover research relevant for your work.