Efficient data structures for adaptive remeshing with the FEM

DOI10.1016/0021-9991(90)90006-MzbMath0718.65078MaRDI QIDQ2639620

Philippe A. Tanguy, H. H. Dannelongue

Publication date: 1990

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

zbMATH Keywords

interpolationfinite element methodunstructured gridsdata structuresadaptive remeshing

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)

Related Items (3)

A framework for advancing front techniques of finite element mesh generation ⋮ Finite element solution for advection-dominated thermal flows ⋮ Three‐dimensional adaptive finite element computations and applications to non‐Newtonian fluids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive remeshing for compressible flow computations
• Algorithms for interpolation and localization in irregular 2D meshes
• Efficient worst-case data structures for range searching
• Automatic three-dimensional mesh generation by the modified-octree technique
• A new mesh generation scheme for arbitrary planar domains
• Some useful data structures for the generation of unstructured grids
• A Lower Bound on the Complexity of Orthogonal Range Queries
• Adaptive mesh refinement processes for finite element solutions
• Computing Dirichlet Tessellations in the Plane
• Automatic triangulation of arbitrary planar domains for the finite element method

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