Parallel Performance Model for Vertex Repositioning Algorithms and Application to Mesh Partitioning

DOI10.1007/978-3-030-13992-6_23zbMath1456.65188OpenAlexW2953867784MaRDI QIDQ3296637

Eduardo Rodriguez, R. Montenegro, J. M. Escobar, Domingo Benitez

Publication date: 30 June 2020

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-13992-6_23

zbMATH Keywords

parallel algorithmmesh optimizationmesh partitioningvertex repositioning algorithms

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (1)

Performance Comparison and Workload Analysis of Mesh Untangling and Smoothing Algorithms

Uses Software

• Gmsh
• METIS
• Mesquite

Cites Work

• A framework for scalable greedy coloring on distributed-memory parallel computers
• An automatic strategy for adaptive tetrahedral mesh generation
• Simultaneous untangling and smoothing of tetrahedral meshes.
• Performance Comparison and Workload Analysis of Mesh Untangling and Smoothing Algorithms
• Updating meshes on deforming domains: An application of the target‐matrix paradigm
• Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities
• A Parallel Algorithm for Mesh Smoothing

This page was built for publication: Parallel Performance Model for Vertex Repositioning Algorithms and Application to Mesh Partitioning