Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation

DOI10.1016/S0045-7825(99)00339-4zbMath0980.74080OpenAlexW2122608339MaRDI QIDQ1579769

Michael Ortiz, R. A. Radovitzky

Publication date: 27 February 2001

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0045-7825(99)00339-4

zbMATH Keywords

Delaunay triangulationpiecewise polynomial interpolationadvancing-front methodnode insertionface-centered-cubic crystal lattice arrangementhard-sphere packingunstructured tetrahedral mesh generation

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Numerical and other methods in solid mechanics (74S99)

Related Items

An efficient optimization procedure for tetrahedral meshes by chaos search algorithm ⋮ The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space ⋮ Tetrahedral mesh generation based on space indicator functions ⋮ Adaptive multigrid strategy for geometry optimization of large-scale three dimensional molecular mechanics ⋮ A scalable 3D fracture and fragmentation algorithm based on a hybrid, discontinuous Galerkin, cohesive element method ⋮ Finite‐element modeling of dry sliding wear in metals ⋮ A surface remeshing approach ⋮ 2D and 3D finite element meshing and remeshing ⋮ Solid modeling aspects of three-dimensional fragmentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new algorithm for three-dimensional Voronoi tessellation
• Adaptive remeshing for compressible flow computations
• Approximating constrained tetrahedrizations
• Solid modeling aspects of three-dimensional fragmentation
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• Relationship between tetrahedron shape measures
• Adaptive Lagrangian modelling of ballistic penetration of metallic targets
• Surface reconstruction by Voronoi filtering
• A framework for advancing front techniques of finite element mesh generation
• Regridding surface triangulations
• Error estimation and adaptive meshing in strongly nonlinear dynamic problems
• Fast Delaunay triangulation in three dimensions
• The reconstruction of boundary contours and surfaces in arbitrary unstructured triangular and tetrahedral grids
• AN AUTOMATIC TETRAHEDRAL MESH GENERATION SCHEME BY THE ADVANCING FRONT METHOD
• Automatic mesh generation from solid models based on recursive spatial decompositions
• A butterfly subdivision scheme for surface interpolation with tension control
• An apporach to automatic three-dimensional finite element mesh generation
• Some useful data structures for the generation of unstructured grids
• Geometry-based fully automatic mesh generation and the delaunay triangulation
• Finite element mesh generation over curved surfaces
• Finite element Euler computations in three dimensions
• Generation of three‐dimensional unstructured grids by the advancing‐front method
• Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
• Automatic three‐dimensional mesh generation by the finite octree technique
• Volume discretization into tetrahedra—I. Verification and orientation of boundary surfaces
• Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach
• Finite element mesh generation over analytical curved surfaces
• Finite-deformation irreversible cohesive elements for three-dimensional crack-propagation analysis
• Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
• Aspects of three‐dimensional constrained Delaunay meshing
• Three-Dimensional Triangulations from Local Transformations
• Automatic mesh generation over intersecting surfaces
• Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
• On advancing front mesh generation in three dimensions
• Generation of unstructured tetrahedral meshes by advancing front technique
• A combined octree/delaunay method for fully automatic 3‐D mesh generation

This page was built for publication: Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation