𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automatic nodal triangulation for finite elements

✍ Scribed by C.B. Saw; R.G. Smith

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
279 KB
Volume
25
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

✦ Synopsis

The paper outlines a scheme for minimizing the amount of data required to produce a set of punched cards for programs employing the finite-element method. The requirements considered apply to triangles and are for a continuum which may have irregular boundaries and inhomogeneous material properties.

nodal triangulation, finite-element methods

At the time of publication in Computer-Aided Design, Volume 5, Number !, January 1973, the authors' affiliations were as follows:

πŸ“œ SIMILAR VOLUMES

Parallel Delaunay triangulation for part
Parallel Delaunay triangulation for particle finite element methods
✍ Fragakis, Yannis ;OΓ±ate, Eugenio πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 259 KB

## Abstract Delaunay triangulation is a geometric problem that is relatively difficult to parallelize. Parallel algorithms are usually characterized by considerable interprocessor communication or important serialized parts. In this paper, we propose a method that achieves high speed‐ups, but needs