Algorithm 872: Parallel 2D constrained Delaunay mesh generation
ACM Transactions on Mathematical Software (TOMS)
Lepp-bisection algorithms, applications and mathematical properties
Applied Numerical Mathematics
Reuse of Architectural Knowledge in SPL Development
ICSR '09 Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering
Multithread parallelization of Lepp-bisection algorithms
Applied Numerical Mathematics
A distributed-memory parallel technique for two-dimensional mesh generation for arbitrary domains
Advances in Engineering Software
| Hi-index | 0.00 |
We present a practical and stable algorithm for the parallel refinement of tetrahedral meshes. The algorithm is based on the refinement of terminal-edges and associated terminal stars. A terminal-edge is a special edge in the mesh which is the longest edge of every element that shares such an edge, while the elements that share a terminal-edge form a terminal star. We prove that the algorithm is inherently decoupled and thus scalable. Our experimental data show that we have a stable implementation able to deal with hundreds of millions of tetrahedra and whose speed is in between one and two order of magnitude higher from the method and implementation we presented (Rivara et al., Proceedings 13th international meshing roundtable, 2004).