A simple unstructured tetrahedral mesh generation algorithm for complex geometries
type: Item
instance of: scholarly article
title: A simple unstructured tetrahedral mesh generation algorithm for complex geometries
zbMATH Open document ID: 0879.68110
DOI: 10.1016/S0895-7177(96)00168-9
author: B. K. Karamete
author: M. Ger
author: H. U. Akay
author: Turgut Tokdemir
published in: Mathematical and Computer Modelling
publication date: 1998-02-01T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1042758
zbMATH Keywords: geometric searching strategies
MaRDI profile type: Publication
cites work: Computing Dirichlet Tessellations in the Plane
cites work: Two Dimensional Interpolation from Random Data
cites work: Adaptive grid-design methods for finite element analysis
cites work: Q4839554
cites work: An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
cites work: Delaunay triangulation of non-convex planar domains
cites work: Automatic triangulation of arbitrary planar domains for the finite element method
cites work: A new mesh generation scheme for arbitrary planar domains
cites work: Surface grid generation with a linkage to geometric generation
cites work: Generation of three‐dimensional unstructured grids by the advancing‐front method
cites work: An automatic mesh generation scheme for plane and curved surfaces by ‘isoparametric’ co‐ordinates
cites work: Q4194442
cites work: A fast algorithm for constructing Delaunay triangulations in the plane
cites work: Two algorithms for constructing a Delaunay triangulation
cites work: Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
cites work: A method for generating irregular computational grids in multiply connected planar domains
cites work: Compressible flowfield solutions with unstructured grids generated by Delaunay triangulation
cites work: Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
cites work: Automatic mesh generator using the Delaunay-Voronoï principle
cites work: Fully automatic mesh generator for 3D domains of any shape
cites work: Selective refinement: A new strategy for automatic node placement in graded triangular meshes
cites work: A structured tri-tree search method for generation of optimal unstructured finite element grids in two and three dimensions
cites work: Robust boundary triangulation and delaunay triangulation of arbitrary planar domains
cites work: Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
full work available at URL: s0895-7177(96)00168-9
OpenAlex ID: W2080684392
description: scientific article; zbMATH DE number 1042758