scientific article; zbMATH DE number 1304272

MaRDI QIDQ4250993zbMATH OpenFDO

Authors Lori Freitag, Mark Jones, Paul E. Plassmann

Publication date 17 June 1999

zbMATH Keywords

mesh improvementmesh smoothingscalability

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 741124
• Improving unstructured mesh partitions for multiple criteria using mesh adjacencies
• Thread-parallel mesh improvement using face and edge swapping and vertex insertion
• Parallel Algorithms for Adaptive Mesh Refinement

Cited in

(7)

• Thread-parallel mesh improvement using face and edge swapping and vertex insertion
• Fast mesh-to-mesh remaps using hash algorithms
• Performance comparison and workload analysis of mesh untangling and smoothing algorithms
• Improving unstructured mesh partitions for multiple criteria using mesh adjacencies
• A COST/BENEFIT ANALYSIS OF SIMPLICIAL MESH IMPROVEMENT TECHNIQUES AS MEASURED BY SOLUTION EFFICIENCY
• Extension by refining task granularity for parallel computation with variable structures
• Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains

Describes a project that uses

Uses Software

• BlockSolve95

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250993)