A parallel edge orientation algorithm for quadrilateral meshes
From MaRDI portal
Abstract: One approach to achieving correct finite element assembly is to ensure that the local orientation of facets relative to each cell in the mesh is consistent with the global orientation of that facet. Rognes et al. have shown how to achieve this for any mesh composed of simplex elements, and deal.II contains a serial algorithm to construct a consistent orientation of any quadrilateral mesh of an orientable manifold. The core contribution of this paper is the extension of this algorithm for distributed memory parallel computers, which facilitates its seamless application as part of a parallel simulation system. Furthermore, our analysis establishes a link between the well-known Union-Find algorithm and the construction of a consistent orientation of a quadrilateral mesh. As a result, existing work on the parallelisation of the Union-Find algorithm can be easily adapted to construct further parallel algorithms for mesh orientations.
Recommendations
- On orienting edges of unstructured two- and three-dimensional meshes
- Parallel generation of triangular and quadrilateral meshes
- A parallel algorithm for adaptive local refinement of tetrahedral meshes using bisection
- Derived data structure algorithms for unstructured finite element meshes
- Algorithm 872
Cites work
- A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
- A parallel edge orientation algorithm for quadrilateral meshes
- deal.II—A general-purpose object-oriented finite element library
- Efficiency of a Good But Not Linear Set Union Algorithm
- Efficient Assembly of $H(\mathrm{div})$ and $H(\mathrm{curl})$ Conforming Finite Elements
- Firedrake, automating the finite element method by composing abstractions
- Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
- Introduction to algorithms
- Nektar++: an open-source spectral/hp element framework
- New development in freefem++
- On orienting edges of unstructured two- and three-dimensional meshes
Cited in
(17)- Port-Hamiltonian formulation and symplectic discretization of plate models. II: Kirchhoff model for thin plates
- \textsc{tIGAr}: automating isogeometric analysis with \textsc{FEniCS}
- The scaling and skewness of optimally transported meshes on the sphere
- Open-source immersogeometric analysis of fluid-structure interaction using FEniCS and tIGAr
- Composable block solvers for the four-field double porosity/permeability model
- The `recovered space' advection scheme for lowest-order compatible finite element methods
- Variational inequality approach to enforcing the non-negative constraint for advection-diffusion equations
- Maximum-principle-satisfying discontinuous Galerkin methods for incompressible two-phase immiscible flow
- A scalable DG solver for the electroneutral Nernst-Planck equations
- A parallel edge orientation algorithm for quadrilateral meshes
- Comparative Study of Finite Element Methods Using the Time-Accuracy-Size(TAS) Spectrum Analysis
- On orienting edges of unstructured two- and three-dimensional meshes
- Optimal-transport -- based mesh adaptivity on the plane and sphere using finite elements
- Construction of Arbitrary Order Finite Element Degree-of-Freedom Maps on Polygonal and Polyhedral Cell Meshes
- Robust Multigrid Techniques for Augmented Lagrangian Preconditioning of Incompressible Stokes Equations with Extreme Viscosity Variations
- Bound-preserving discontinuous Galerkin methods for compressible two-phase flows in porous media
- Stencil composition for finite difference approximations of partial differential equations
This page was built for publication: A parallel edge orientation algorithm for quadrilateral meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830579)
