A simple unstructured tetrahedral mesh generation algorithm for complex geometries
From MaRDI portal
Publication:1362260
DOI10.1016/S0895-7177(96)00168-9zbMath0879.68110OpenAlexW2080684392MaRDI QIDQ1362260
B. K. Karamete, M. Ger, Hasan U. Akay, Turgut Tokdemir
Publication date: 1 February 1998
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(96)00168-9
Cites Work
- Unnamed Item
- Unnamed Item
- Adaptive grid-design methods for finite element analysis
- Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
- Automatic mesh generator using the Delaunay-Voronoï principle
- Delaunay triangulation of non-convex planar domains
- A new mesh generation scheme for arbitrary planar domains
- Selective refinement: A new strategy for automatic node placement in graded triangular meshes
- A fast algorithm for constructing Delaunay triangulations in the plane
- A method for generating irregular computational grids in multiply connected planar domains
- Generation of three‐dimensional unstructured grids by the advancing‐front method
- Two algorithms for constructing a Delaunay triangulation
- A structured tri-tree search method for generation of optimal unstructured finite element grids in two and three dimensions
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- Two Dimensional Interpolation from Random Data
- Computing Dirichlet Tessellations in the Plane
- Surface grid generation with a linkage to geometric generation
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- Robust boundary triangulation and delaunay triangulation of arbitrary planar domains
- Automatic triangulation of arbitrary planar domains for the finite element method
- Compressible flowfield solutions with unstructured grids generated by Delaunay triangulation
- An automatic mesh generation scheme for plane and curved surfaces by ‘isoparametric’ co‐ordinates
- Fully automatic mesh generator for 3D domains of any shape
This page was built for publication: A simple unstructured tetrahedral mesh generation algorithm for complex geometries
