We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O (log n) for …
N Chrisochoides - Numerical solution of partial differential equations on …, 2006 - Springer
Parallel mesh generation is a relatively new research area between the boundaries of two scientific computing disciplines: computational geometry and parallel computing. In this …
Given the importance of parallel mesh generation in large-scale scientific applications and the proliferation of multilevel SMT-based architectures, it is imperative to obtain insight on …
The majority of finite element models in structural engineering are composed of unstructured meshes. These unstructured meshes are often very large and require significant …
Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount of computation and storage necessary to perform many scientific …
Delaunay refinement is a widely used method for the construction of guaranteed quality triangular and tetrahedral meshes. We present an algorithm and a software for the parallel …
A new parallel partitioning algorithm for unstructured par-allel grid generation is presented. This new approach is based on a space-filling curve. The space-filling curve's indices are …
Load balancing in large parallel systems with distributed memory is a difficult task often influencing the overall efficiency of applications substantially. A number of efficient …