Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach
From MaRDI portal
Publication:4032698
DOI10.1016/0045-7949(91)90059-UzbMath0764.65073OpenAlexW1988072605MaRDI QIDQ4032698
No author found.
Publication date: 1 April 1993
Published in: Computers & Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0045-7949(91)90059-u
Finite element methods applied to problems in solid mechanics (74S05) 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 (27)
Conforming to interface structured adaptive mesh refinement: 3D algorithm and implementation ⋮ Relationship between tetrahedron shape measures ⋮ An efficient optimization procedure for tetrahedral meshes by chaos search algorithm ⋮ Unnamed Item ⋮ 3D mesh adaptation. Optimization of tetrahedral meshes by advancing front technique ⋮ Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation ⋮ Analysis and verification of the boundary surfaces of solid objects ⋮ Effects of shape and misalignment of fibers on the failure response of carbon fiber reinforced polymers ⋮ Automatic merging of tetrahedral meshes ⋮ New aspects of the CISAMR algorithm for meshing domain geometries with sharp edges and corners ⋮ Variational Delaunay approach to the generation of tetrahedral finite element meshes ⋮ Tetrahedral meshes from planar cross-sections ⋮ An algorithm of combining of advancing front and delaunay triangulation to 3-D domain tesselation ⋮ A novel energy-based approach for merging finite elements ⋮ Generating free-form grid truss structures from 3D scanned point clouds ⋮ H-Morph: an indirect approach to advancing front hex meshing ⋮ 2D and 3D finite element meshing and remeshing ⋮ Generation of finite element mesh with variable size over an unbounded 2D domain ⋮ Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain ⋮ Recent progress in robust and quality Delaunay mesh generation ⋮ Higher-order mesh generation using CISAMR: a case study on bias in presentation and interpretation of results ⋮ AN AUTOMATIC TETRAHEDRAL MESH GENERATION SCHEME BY THE ADVANCING FRONT METHOD ⋮ Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique ⋮ Unnamed Item ⋮ Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation ⋮ Improvement on the 10-node tetrahedral element for three-dimensional problems ⋮ Mesh generation over curved surfaces with explicit control on discretization error
This page was built for publication: Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach
