Automatic triangular mesh generation of arbitrary planar domains utilizing the node-pattern for finite element analysis.
Osamu OKUDA
Abstract
Open-access reader
Osamu OKUDA
Abstract
Open-access reader
This paper is concerned with the computer-oriented mesh generator, called TRMESH, which serves as the pre-processor in finite element method. The purpose of the present investigation is to describe a new algorithm, which is satisfied with the requirements of triangular mesh generation as follows: (1) The algorithm subdivides the problem domain into several regions and controls mesh size in any sub-regions. (2) The algorithm generates the elements in multiply connected domains. (3) The element is close to equilateral triangle in form. (4) The program renumbers the nodes so that the matrix bandwidth is reduced and finally generate the node number, its coordinates, the element number as input data for the finite element analysis. It is shown that the program TRMESH can produce well-shaped elements in the planar domain and that the process of triangulation is very simple. The method described herein is illustrated by the typical examples. Computer graphics techniques are used to facillitate data preparation and to display the results.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper is concerned with the computer-oriented mesh generator, called TRMESH, which serves as the pre-processor in finite element method. The purpose of the present investigation is to describe a new algorithm, which is satisfied with the requirements of triangular mesh generation as follows: (1) The algorithm subdivides the problem domain into several regions and controls mesh size in any sub-regions. (2) The algorithm generates the elements in multiply connected domains. (3) The element is close to equilateral triangle in form. (4) The program renumbers the nodes so that the matrix bandwidth is reduced and finally generate the node number, its coordinates, the element number as input data for the finite element analysis. It is shown that the program TRMESH can produce well-shaped elements in the planar domain and that the process of triangulation is very simple. The method described herein is illustrated by the typical examples. Computer graphics techniques are used to facillitate data preparation and to display the results.
Key concepts: Mesh generation, Finite element method, Computer science, Node (physics), Equilateral triangle, Delaunay triangulation, Algorithm, Computer graphics