Premium
Automatic triangulation of arbitrary planar domains for the finite element method
Author(s) -
Cavendish James C.
Publication year - 1974
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620080402
Subject(s) - triangulation , finite element method , polygon mesh , planar , boundary (topology) , algorithm , mesh generation , domain decomposition methods , domain (mathematical analysis) , delaunay triangulation , extension (predicate logic) , computer science , mathematics , topology (electrical circuits) , geometry , mathematical analysis , structural engineering , combinatorics , engineering , computer graphics (images) , programming language
The object of this paper is to describe a new algorithm for the semi‐automatic triangulation of arbitrary, multiply connected planar domains. The strategy is based upon a modification of a finite element mesh genration algorithm recently developed. 1 The scheme is designed for maximum flexibility and is capable of generating meshes of triangular elements for the decomposition of virtually any multiply connected planar domain. Moreover, the desired density of elements in various regions of the problem domain is specified by the user, thus allowing him to obtain a mesh decomposition appropriate to the physical loading and/or boundary conditions of the particular problem at hand. Several examples are presented to illustrate the applicability of the algorithm. An extension of the algorithm to the triangulation of shell structures is indicated.