Mesh generation for FEM based on centroidal Voronoi tessellations
From MaRDI portal
Publication:2229800
DOI10.1016/j.matcom.2013.05.014OpenAlexW2493788773MaRDI QIDQ2229800
Xudong Fu, Yan Liu, Yu-xin Jie
Publication date: 18 February 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2013.05.014
Cites Work
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- \(K\)-harmonic means data clustering with simulated annealing heuristic
- Meshfree, probabilistic determination of point sets and support regions for meshless computing
- Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
- Grid generation and optimization based on centroidal Voronoi tessellations
- Numerical studies of MacQueen's \(k\)-means algorithm for computing the centroidal Voronoi tessellations
- Parallel unstructured mesh generation by an advancing front method
- Recent progress in robust and quality Delaunay mesh generation
- Tetrahedral mesh generation using Delaunay refinement with non-standard quality measures
- An indirect approach for automatic generation of quadrilateral meshes with arbitrary line constraints
- Three-dimensional automatic local remeshing for two or more hybrid meshes
- Generation of three‐dimensional unstructured grids by the advancing‐front method
- Shape reconstruction and volume meshing for complex solids
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- Constrained Centroidal Voronoi Tessellations for Surfaces
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Equation of State Calculations by Fast Computing Machines
- Convergence of a simulated annealing algorithm for continuous global optimization.
This page was built for publication: Mesh generation for FEM based on centroidal Voronoi tessellations
