An automatic strategy for adaptive tetrahedral mesh generation
Publication:1030787
DOI10.1016/J.APNUM.2008.12.010zbMath1167.65456OpenAlexW1975274564MaRDI QIDQ1030787
G. Montero, J. M. Escobar, J. M. Cascón, R. Montenegro, Eduardo Rodriguez
Publication date: 2 July 2009
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10553/45234
triangulationnumerical examplesmesh untanglingmesh smoothing3-D finite element methodadaptive refinement/derefinementautomatic subdivisionmeccano surfacesnested meshestetrahedral mesh generation
Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Genetic algorithms for an improved parameter estimation with local refinement of tetrahedral meshes in a wind model
- Automatic mesh generator with specified boundary
- An algorithm for adaptive mesh refinement in \(n\) dimensions
- Simultaneous untangling and smoothing of tetrahedral meshes.
- Design of adaptive finite element software. The finite element toolbox ALBERTA. With CD-ROM
- Local refinement of 3-D triangulations using object-oriented methods
- A recursive approach to local mesh refinement in two and three dimensions
- A perspective on adaptive modeling and meshing (AM\& M)
- Algebraic Mesh Quality Metrics
- An algebraic method for smoothing surface triangulations on a local parametric space
- A grid generator based on 4-triangles conforming mesh-refinement algorithms
- A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
- Adaptive h‐refinement on 3D unstructured grids for transient problems
- Efficient refinement/derefinement algorithm of nested meshes to solve evolution problems
- Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
- Tetrahedral mesh improvement via optimization of the element condition number
- A comparison of adaptive refinement techniques for elliptic problems
- Local optimization-based simplicial mesh untangling and improvement
- Computational Science - ICCS 2004
This page was built for publication: An automatic strategy for adaptive tetrahedral mesh generation