A generic Delaunay triangulation algorithm for finite element meshes

DOI10.1016/0961-3552(91)90031-XzbMath0754.65094OpenAlexW2063329372MaRDI QIDQ4006201

David A. Field

Publication date: 26 September 1992

Published in: Advances in Engineering Software and Workstations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0961-3552(91)90031-x

zbMATH Keywords

algorithmsphererandom pointssurface meshsolid meshDelaunay trianglesplanar mesh\(k\)-dimensional manifoldsconnected polygonsgeneric Delaunay triangulation algorithminsertion patches

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) 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

Curvilinear mesh adaptation using radial basis function interpolation and smoothing, Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis, Automatic generation of transitional meshes, Delaunay triangulation of arbitrarily shaped planar domains, The legacy of automatic mesh generation from solid modeling