A simple unstructured tetrahedral mesh generation algorithm for complex geometries
From MaRDI portal
Publication:1362260
DOI10.1016/S0895-7177(96)00168-9zbMATH Open0879.68110OpenAlexW2080684392MaRDI QIDQ1362260FDOQ1362260
H. U. Akay, Turgut Tokdemir, B. K. Karamete, M. Ger
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
Recommendations
- Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
- AN AUTOMATIC TETRAHEDRAL MESH GENERATION SCHEME BY THE ADVANCING FRONT METHOD
- Generation of unstructured tetrahedral meshes by advancing front technique
- scientific article; zbMATH DE number 1748481
- An automatic strategy for adaptive tetrahedral mesh generation
Cites Work
- Delaunay triangulation of non-convex planar domains
- Computing Dirichlet Tessellations in the Plane
- Two algorithms for constructing a Delaunay triangulation
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- Generation of three‐dimensional unstructured grids by the advancing‐front method
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- Title not available (Why is that?)
- Two Dimensional Interpolation from Random Data
- A new mesh generation scheme for arbitrary planar domains
- A method for generating irregular computational grids in multiply connected planar domains
- A structured tri-tree search method for generation of optimal unstructured finite element grids in two and three dimensions
- Fully automatic mesh generator for 3D domains of any shape
- Adaptive grid-design methods for finite element analysis
- A fast algorithm for constructing Delaunay triangulations in the plane
- Selective refinement: A new strategy for automatic node placement in graded triangular meshes
- Automatic triangulation of arbitrary planar domains for the finite element method
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
- An automatic mesh generation scheme for plane and curved surfaces by ‘isoparametric’ co‐ordinates
- Compressible flowfield solutions with unstructured grids generated by Delaunay triangulation
- Title not available (Why is that?)
- Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
- Surface grid generation with a linkage to geometric generation
- Automatic mesh generator using the Delaunay-Voronoï principle
- Robust boundary triangulation and delaunay triangulation of arbitrary planar domains
Cited In (8)
- Triangulation method of complex B-spline segments
- An algorithm for three-dimensional mesh generation for arbitrary regions with cracks
- Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination
- Title not available (Why is that?)
- A new algorithm for generating tetrahedral grids
- Title not available (Why is that?)
- Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
This page was built for publication: A simple unstructured tetrahedral mesh generation algorithm for complex geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362260)
