UNSTRUCTURED GRID GENERATION AND A SIMPLE TRIANGULATION ALGORITHM FOR ARBITRARY 2-D GEOMETRIES USING OBJECT ORIENTED PROGRAMMING

This paper describes the logic of a dynamic algorithm for a general 2D Delaunay triangulation of arbitrarily prescribed interior and boundary nodes. The complexity of the geometry is completely arbitrary. The scheme is free of specific restrictions on the input of the geometrical data. The scheme generates triangles whose associated circumcircles contain no nodal points except their vertices. There is no predefined limit for the number of points and the boundaries. The direction of generation of the triangles cannot be determined a priori as opposed to the moving front techniques. An automatic node placement scheme reflecting the initial boundary point spacings is used. The successive refinement scheme results in such a point distribution that the triangulation algorithm need not perform any geometric intersection check for overlapped triangles and penetrated boundaries. Further computational saving is provided by using a special binary tree (ADT) in which the points are ordered such that contiguous points in the list are neighbours in physical space. The method consists of a set of simple rules to understand. The dynamic nature of the Object Oriented Programming (OOP) of the algorithms provides efficient memory management on the insertion, deletion and searching processes. The computational effort bears a linear relation-ship between the CPU time and the total number of nodes. Some of the existing methods in the literature regarding triangular mesh generation are discussed in context. © 1997 by John Wiley & Sons, Ltd.

[1]  Masahiro Suzuki.  Surface grid generation with a linkage to geometric generation , 1993 .

[2]  S. Wille.  A structured tri‐tree search method for generation of optimal unstructured finite element grids in two and three dimensions , 1992 .

[3]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

[4]  J. Bonet,et al.  An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems , 1991 .

[5]  Robin Sibson,et al.  Locally Equiangular Triangulations , 1978, Comput. J..

[6]  O. C. Zienkiewicz,et al.  An automatic mesh generation scheme for plane and curved surfaces by ‘isoparametric’ co‐ordinates , 1971 .

[7]  N. Weatherill,et al.  Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints , 1994 .

[8]  V. V. S. Raveendra,et al.  Robust boundary triangulation and delaunay triangulation of arbitrary planar domains , 1994 .

[9]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[10]  W. Frey.  Selective refinement: A new strategy for automatic node placement in graded triangular meshes , 1987 .

[11]  S. H. Lo,et al.  Delaunay triangulation of non‐convex planar domains , 1989 .

[12]  D. H. McLain,et al.  Two Dimensional Interpolation from Random Data , 1976, Comput. J..

[13]  S. Lo.  A NEW MESH GENERATION SCHEME FOR ARBITRARY PLANAR DOMAINS , 1985 .

[14]  Noboru Kikuchi,et al.  Adaptive grid-design methods for finite delement analysis , 1986 .

[15]  J. Cavendish.  Automatic triangulation of arbitrary planar domains for the finite element method , 1974 .

[16]  Robin Sibson,et al.  Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..