CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Efficient representation of computational meshes

Anders Logg (Institutionen för matematiska vetenskaper, matematik)
International Journal of Computational Science and Engineering (1742-7185). Vol. 4 (2009), 4, p. 283-295.
[Artikel, refereegranskad vetenskaplig]

We present a simple yet general and efficient approach to representation of computational meshes. Meshes are represented as sets of mesh entities of different topological dimensions and their incidence relations. We discuss a straightforward and efficient storage scheme for such mesh representations and efficient algorithms for computation of arbitrary incidence relations from a given initial and minimal set of incidence relations. It is elaborated on how the proposed concepts and data structures may be used for assembly of variational forms in parallel over distributed meshes. Benchmarks are presented to demonstrate the efficiency of the proposed data structure. Copyright © 2009, Inderscience Publishers.

Nyckelord: Mesh , Mesh algorithms , Mesh entity , Mesh representation , Parallel assembly

Denna post skapades 2014-01-05. Senast ändrad 2014-09-29.
CPL Pubid: 191168


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för matematiska vetenskaper, matematik (2005-2016)



Chalmers infrastruktur