BatTri: A two-dimensional bathymetry-based unstructured triangular grid generator for finite element circulation modeling

A brief summary of Delaunay unstructured triangular grid refinement algorithms, including the recent ''off-centers'' method, is provided and mesh generation requirements that are imperative to meet the criteria of the circulation modeling community are defined. A Matlab public-domain two-dimensional (2-D) mesh generation package (BatTri) based on these requirements is then presented and its efficiency shown through examples. BatTri consists of a graphical mesh editing interface and several bathymetry-based refinement algorithms, complemented by a set of diagnostic utilities to check and improve grid quality. The final output mesh node locations, node depths and element incidence list are obtained starting from only a basic set of bathymetric data. This simple but efficient setup allows fast interactive mesh customization and provides circulation modelers with problem-specific flexibility while satisfying the usual requirements on mesh size and element quality. A test of the ''off-centers'' method performed on 100 domains with randomly generated coastline and bathymetry shows an overall 25% reduction in the number of elements with only slight decrease in element quality. More importantly, this shows that BatTri is easily upgradeable to meet the future demands by the addition of new grid generation algorithms and Delaunay refinement schemes as they are made available.

[1]  Rex A. Dwyer.  A faster divide-and-conquer algorithm for constructing delaunay triangulations , 1987, Algorithmica.

[2]  M.G.G Foreman.  An Analysis of the "Wave Equation" Model for Finite Element Tidal Computations , 1983 .

[3]  B. N. Boots,et al.  The spatial arrangement of random Voronoi polygons , 1983 .

[4]  Roy A. Walters,et al.  Geometrically based, automatic generator for irregular triangular networks , 1993 .

[5]  A. M. Davies,et al.  Quantitative skill assessment for coastal ocean models , 1995 .

[6]  R. Luettich,et al.  Modelling tides in the western North Atlantic using unstructured graded grids , 1994 .

[7]  John C. Tipper,et al.  A Straightforward Iterative Algorithm for the Planar Voronoi Diagram , 1990, Inf. Process. Lett..

[8]  Steven Skiena,et al.  The Algorithm Design Manual , 2020, Texts in Computer Science.

[9]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[10]  J. C. Tipper.  FORTRAN programs to construct the planar Voronoi diagram , 1991 .

[11]  Philip L. Roe,et al.  A frontal approach for internal node generation in Delaunay triangulations , 1993 .

[12]  Jens-Dominik Müller,et al.  On triangles and flow. , 1996 .

[13]  C. Lawson.  Software for C1 Surface Interpolation , 1977 .

[14]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[15]  L. Paul Chew,et al.  Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.

[16]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

[17]  Jonathan Richard Shewchuk,et al.  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.

[18]  Gustavo C. Buscaglia,et al.  OPTIMIZATION STRATEGIES IN UNSTRUCTURED MESH GENERATION , 1996 .

[19]  J. Shewchuk,et al.  Delaunay refinement mesh generation , 1997 .

[20]  Daniel R. Lynch,et al.  Forecasting the Coastal Ocean: Resolution, Tide, and Operational Data in the South Atlantic Bight , 2004 .

[21]  D. T. Lee,et al.  Two algorithms for constructing a Delaunay triangulation , 1980, International Journal of Computer & Information Sciences.

[22]  Eric Deleersnijder,et al.  Delaunay mesh generation for an unstructured-grid ocean general circulation model , 2000 .