An efficient optimization procedure for tetrahedral meshes by chaos search algorithm
From MaRDI portal
Publication:1884323
DOI10.1007/BF02945469zbMath1083.65517MaRDI QIDQ1884323
Publication date: 28 October 2004
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
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 (2)
Smoothing algorithm for planar and surface mesh based on element geometric deformation ⋮ Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relationship between tetrahedron shape measures
- Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
- A new mesh generation scheme for arbitrary planar domains
- Generation of computational grids using optimization
- Laplacian smoothing and Delaunay triangulations
- Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation
- Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach
- A Parallel Algorithm for Mesh Smoothing
- An algorithm for the optimization of directionally stretched triangulations
- Optimization of tetrahedral meshes based on element shape measures
- Local optimization-based simplicial mesh untangling and improvement
- A COST/BENEFIT ANALYSIS OF SIMPLICIAL MESH IMPROVEMENT TECHNIQUES AS MEASURED BY SOLUTION EFFICIENCY
- OPTIMIZING COMPLEX FUNCTIONS BY CHAOS SEARCH
- Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
This page was built for publication: An efficient optimization procedure for tetrahedral meshes by chaos search algorithm
