Efficient data structures for adaptive remeshing with the FEM

DOI10.1016/0021-9991(90)90006-MMaRDI QIDQ2639620zbMATH OpenFDO

Authors H. H. Dannelongue, Philippe A. Tanguy

Publication date 1990

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-9991(90)90006-M

zbMATH Keywords

adaptive remeshingdata structuresfinite element methodinterpolationunstructured grids

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Review text

The authors analyze the meshing and interpolation problems encountered in adaptive remeshing with unstructured grids. The solution is searched for separately using specific data structures based on bisection. The finite element method as well as the proposed procedure being used here may be generalized to three-dimensional problems. The implementation algorithms and timing are exposed in two dimensions. The structures can also be used to solve the geometrical problems being associated with some other numerical methods.

Recommendations

• Data structures and concepts for adaptive finite element methods
• A class of data structures for 2-D and 3-D adaptive mesh refinement
• Adaptive refinement of unstructured finite-element meshes
• scientific article; zbMATH DE number 3848560
• Algorithms and data structures for 2D and 3D adaptive finite element mesh refinement

Cites work

• A Lower Bound on the Complexity of Orthogonal Range Queries
• A new mesh generation scheme for arbitrary planar domains
• Adaptive mesh refinement processes for finite element solutions
• Adaptive remeshing for compressible flow computations
• Algorithms for interpolation and localization in irregular 2D meshes
• Automatic three-dimensional mesh generation by the modified-octree technique
• Automatic triangulation of arbitrary planar domains for the finite element method
• Computing Dirichlet Tessellations in the Plane
• Efficient worst-case data structures for range searching
• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 3967876 (Why is no real title available?)
• scientific article; zbMATH DE number 3584897 (Why is no real title available?)
• Some useful data structures for the generation of unstructured grids

Cited in

(11)

• Finite element solution for advection-dominated thermal flows
• A framework for advancing front techniques of finite element mesh generation
• Data structures and concepts for adaptive finite element methods
• scientific article; zbMATH DE number 3848560 (Why is no real title available?)
• A class of data structures for 2-D and 3-D adaptive mesh refinement
• Fast point and element search method in adaptive remeshing procedure and its applications
• Derived data structure algorithms for unstructured finite element meshes
• scientific article; zbMATH DE number 775131 (Why is no real title available?)
• Three‐dimensional adaptive finite element computations and applications to non‐Newtonian fluids
• Modifiable array data structures for mesh topology
• Compact array-based mesh data structures

This page was built for publication: Efficient data structures for adaptive remeshing with the FEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639620)