A framework for advancing front techniques of finite element mesh generation
From MaRDI portal
Publication:1899932
DOI10.1007/BF01737163zbMath0831.65128MaRDI QIDQ1899932
Publication date: 22 February 1996
Published in: BIT (Search for Journal in Brave)
unstructured meshesdata structuresDelaunay triangulationfinite element mesh generationadvancing front techniquespolyalgorithm
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 data modeling abstraction for describing triangular mesh algorithms ⋮ 2D and 3D finite element meshing and remeshing ⋮ Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
Cites Work
- Unnamed Item
- Unnamed Item
- Automatic mesh generation for finite element analysis
- Generalized Delaunay triangulations of non-convex domains
- Generalized Delaunay triangulation for planar graphs
- Adaptive remeshing for compressible flow computations
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Anisotropic mesh transformations and optimal error control
- Efficient data structures for adaptive remeshing with the FEM
- A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
- Delaunay triangulation of non-convex planar domains
- Generation of three‐dimensional unstructured grids by the advancing‐front method
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- The application of node-element rules for forecasting problems in the generation of finite element meshes
- Automatic generation of triangular grid: I—subdivision of a general polygon into convex subregions. II—triangulation of convex polygons
This page was built for publication: A framework for advancing front techniques of finite element mesh generation
