13 research outputs found
Recommended from our members
Parallel paving: An algorithm for generating distributed, adaptive, all-quadrilateral meshes on parallel computers
Paving is an automated mesh generation algorithm which produces all-quadrilateral elements. It can additionally generate these elements in varying sizes such that the resulting mesh adapts to a function distribution, such as an error function. While powerful, conventional paving is a very serial algorithm in its operation. Parallel paving is the extension of serial paving into parallel environments to perform the same meshing functions as conventional paving only on distributed, discretized models. This extension allows large, adaptive, parallel finite element simulations to take advantage of paving`s meshing capabilities for h-remap remeshing. A significantly modified version of the CUBIT mesh generation code has been developed to host the parallel paving algorithm and demonstrate its capabilities on both two dimensional and three dimensional surface geometries and compare the resulting parallel produced meshes to conventionally paved meshes for mesh quality and algorithm performance. Sandia`s {open_quotes}tiling{close_quotes} dynamic load balancing code has also been extended to work with the paving algorithm to retain parallel efficiency as subdomains undergo iterative mesh refinement
Recommended from our members
Generation of multi-million element meshes for solid model-based geometries: The Dicer algorithm
The Dicer algorithm generates a fine mesh by refining each element in a coarse all-hexahedral mesh generated by any existing all-hexahedral mesh generation algorithm. The fine mesh is geometry-conforming. Using existing all-hexahedral meshing algorithms to define the initial coarse mesh simplifies the overall meshing process and allows dicing to take advantage of improvements in other meshing algorithms immediately. The Dicer algorithm will be used to generate large meshes in support of the ASCI program. The authors also plan to use dicing as the basis for parallel mesh generation. Dicing strikes a careful balance between the interactive mesh generation and multi-million element mesh generation processes for complex 3D geometries, providing an efficient means for producing meshes of varying refinement once the coarse mesh is obtained
Recommended from our members
Feature recognition applications in mesh generation
The use of feature recognition as part of an overall decomposition-based hexahedral meshing approach is described in this paper. The meshing approach consists of feature recognition, using a c-loop or hybrid c-loop method, and the use of cutting surfaces to decompose the solid model. These steps are part of an iterative process, which proceeds either until no more features can be recognized or until the model has been completely decomposed into meshable sub-volumes. This method can greatly reduce the time required to generate an all-hexahedral mesh, either through the use of more efficient meshing algorithms on more of the geometry or by reducing the amount of manual decomposition required to mesh a volume
Recommended from our members
Progress report on the wisker weaving all-hexahedral meshing algorithm
In this paper, a review of the Spatial Twist Contiuum and the basic whisker weaving algorithm are given. Progress in the detection and resolution of several types of degeneracies formed by whisker weaving are discussed. These examples include so-called knife doublets, triple doublets, through-cells and through-chords. Knife doublets and triple doublets are resolved by preventing their formation a-priori, which forces whisker weaving to remove the element(s) causing the degeneracy. Through-chords and through-cells are left in the weave and resolved after the weave has been closed. The paper concludes with three examples of geometries ``closed`` by whisker weaving
Recommended from our members
The parallelization of an advancing-front, all-quadrilateral meshing algorithm for adaptive analysis
The ability to perform effective adaptive analysis has become a critical issue in the area of physical simulation. Of the multiple technologies required to realize a parallel adaptive analysis capability, automatic mesh generation is an enabling technology, filling a critical need in the appropriate discretization of a problem domain. The paving algorithm`s unique ability to generate a function-following quadrilateral grid is a substantial advantage in Sandia`s pursuit of a modified h-method adaptive capability. This characteristic combined with a strong transitioning ability allow the paving algorithm to place elements where an error function indicates more mesh resolution is needed. Although the original paving algorithm is highly serial, a two stage approach has been designed to parallelize the algorithm but also retain the nice qualities of the serial algorithm. The authors approach also allows the subdomain decomposition used by the meshing code to be shared with the finite element physics code, eliminating the need for data transfer across the processors between the analysis and remeshing steps. In addition, the meshed subdomains are adjusted with a dynamic load balancer to improve the original decomposition and maintain load efficiency each time the mesh has been regenerated. This initial parallel implementation assumes an approach of restarting the physics problem from time zero at each interaction, with a refined mesh adapting to the previous iterations objective function. The remeshing tools are being developed to enable real time remeshing and geometry regeneration. Progress on the redesign of the paving algorithm for parallel operation is discussed including extensions allowing adaptive control and geometry regeneration
Recommended from our members
The design of a parallel adaptive paving all-quadrilateral meshing algorithm
Adaptive finite element analysis demands a great deal of computational resources, and as such is most appropriately solved in a massively parallel computer environment. This analysis will require other parallel algorithms before it can fully utilize MP computers, one of which is parallel adaptive meshing. A version of the paving algorithm is being designed which operates in parallel but which also retains the robustness and other desirable features present in the serial algorithm. Adaptive paving in a production mode is demonstrated using a Babuska-Rheinboldt error estimator on a classic linearly elastic plate problem. The design of the parallel paving algorithm is described, and is based on the decomposition of a surface into {open_quotes}virtual{close_quotes} surfaces. The topology of the virtual surface boundaries is defined using mesh entities (mesh nodes and edges) so as to allow movement of these boundaries with smoothing and other operations. This arrangement allows the use of the standard paving algorithm on subdomain interiors, after the negotiation of the boundary mesh