Delaunay triangulation of non-convex planar domains

DOI10.1002/NME.1620281113zbMath0723.73085OpenAlexW2132199339MaRDI QIDQ3210998

No author found.

Publication date: 1989

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620281113

zbMATH Keywords

mesh generationadvancing frontDelaunay triangulation algorithm

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05) Paths and cycles (05C38)

Related Items (16)

A material based finite element analysis of heterogeneous media involving Dirichlet tessellations ⋮ Unnamed Item ⋮ A framework for advancing front techniques of finite element mesh generation ⋮ A simple unstructured tetrahedral mesh generation algorithm for complex geometries ⋮ Reliable Delaunay‐based mesh generation and mesh improvement ⋮ Automatic merging of tetrahedral meshes ⋮ Automatic mesh generation on a regular background grid. ⋮ Global and local remeshing algorithms for compressible flows ⋮ A new front updating solution applied to some engineering problems ⋮ Generation of finite element mesh with variable size over an unbounded 2D domain ⋮ Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain ⋮ The natural element method in solid mechanics ⋮ Unnamed Item ⋮ Fast Delaunay triangulation in three dimensions ⋮ Simple heuristic algorithm for profile reduction of arbitrary sparse matrix ⋮ An application of Nekhoroshev theory to the study of the perturbed hydrogen atom

This page was built for publication: Delaunay triangulation of non-convex planar domains