A Parallel Algorithm for Mesh Smoothing

Authors:
Lori Freitag;Mark Jones;Paul Plassmann
Affiliations:
-;-;-
Venue:
SIAM Journal on Scientific Computing
Year:
1999

Citing 0
Cited 8

Cut-and-paste editing of multiresolution surfaces

Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Grid generation and optimization based on centroidal Voronoi tessellations

Applied Mathematics and Computation
An efficient optimization procedure for tetrahedral meshes by chaos search algorithm

Journal of Computer Science and Technology
Streaming Mesh Optimization for CAD

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
An Optimisation-Based Approach to Mesh Smoothing: Reformulation and Extensions

GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Improved objective functions for tetrahedral mesh optimisation

ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
2D FE quad mesh smoothing via angle-based optimization

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
A parallel ghosting algorithm for the flexible distributed mesh database

Scientific Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Maintaining good mesh quality during the generation and refinement of unstructured meshes in finite-element applications is an important aspect in obtaining accurate discretizations and well-conditioned linear systems. In this article, we present a mesh-smoothing algorithm based on nonsmooth optimization techniques and a scalable implementation of this algorithm. We prove that the parallel algorithm has a provably fast runtime bound and executes correctly for a parallel random access machine (PRAM) computational model. We extend the PRAM algorithm to distributed memory computers and report results for two- and three-dimensional simplicial meshes that demonstrate the efficiency and scalability of this approach for a number of different test cases. We also examine the effect of different architectures on the parallel algorithm and present results for the IBM SP supercomputer and an ATM-connected network of SPARC Ultras.