Collection of abstracts 14th
GAMM-Seminar Kiel on
|
A class library for mesh representation in 2D/3D is proposed. The canonical relationships between points, edges, faces and cell shapes are reflected without imposing any restrictions on the user at least in principal but not at the expense of reduced efficiency. Cells of arbitrary shape can be defined. For this a user's task only consists of adding descriptors for the shape and possible refinement types to lookup tables. By usage of descriptors necessary implementations of refinement and derefinement methods can be taken away from cell level and by this from the user. They are executed on more abstract level and users need not to take care of them unless they want them to be overwritten explicitly.
Meshes are viewed as cell containers mainly disposing iterators through the complete set of cells or subsets of it. A desired iterator if not given as a standard one can be obtained by defining an appropriate filter. In particular the implementation of an hierarchical mesh structure was performed.
Mail to WebMaster |
[Thu Dec 18 11:40:44 MET 1997] |
Impressum |