The design and analysis of spatial data structures
The design and analysis of spatial data structures
Computational geometry in C
Load balancing for the parallel adaptive solution of partial differential equations
Applied Numerical Mathematics - Special issue: a festschrift to honor Professor Robert Vichnevetsky on his 65th birthday
Parallel structures and dynamic load balancing for adaptive finite element computation
Proceedings of international centre for mathematical sciences on Grid adaptation in computational PDES : theory and applications: theory and applications
Navigating through triangle meshes implemented as linear quadtrees
ACM Transactions on Graphics (TOG)
MPI: A Message-Passing Interface Standard
MPI: A Message-Passing Interface Standard
| Hi-index | 0.01 |
In order to improve the convergence ratio and to automate Finite Element Methods, several strategies have been introduced. One of these is the adaptive scheme. This approximation presents limitations for parallelism since the generation of a conformal, valid and well conditioned finite element mesh is a time consuming task, and now it appears as a main task in each iteration of the adaptation procedure. This work is motivated by the use of the h-adaptive method in its most flexible form, where a complete reconstruction of the whole mesh has to be performed whenever a solution over the current mesh has been obtained and until error criteria are achieved. We focused on the problem of the fast generation of tetrahedral unstructured meshes in a parallel fashion over geometric models with some given refinement criteria. The chosen strategy implies the use of an octal tree, octree, as a key hierarchical data structure to guide the algorithm. The codes have been developed using the MPI library in a SGI Origin 200 multiprocessor.