A dynamic data structure suitable for adaptive mesh refinement in finite element method (Q1119061)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A dynamic data structure suitable for adaptive mesh refinement in finite element method |
scientific article; zbMATH DE number 4096884
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dynamic data structure suitable for adaptive mesh refinement in finite element method |
scientific article; zbMATH DE number 4096884 |
Statements
A dynamic data structure suitable for adaptive mesh refinement in finite element method (English)
0 references
1988
0 references
This paper describes a dynamic data structure and its implementation, used for an optimum mesh generator. The implementation of this mesh generator was a part of a software package implemented to solve electromagnetic field problems using the finite element method. This mesh generator takes advantage of the Delaunay algorithm, which maximizes the summation of the smallest angles in all triangles and thus creates a mesh that is proved to be an optimum mesh for use in the finite element method. The dynamic data structure is explained and the source code is reviewed. The programs have been written in Pascal programming language.
0 references
implementation
0 references
optimum mesh generator
0 references
electromagnetic field problems
0 references
Delaunay algorithm
0 references
Pascal programming language
0 references