Title: Efficient representation of computational meshes

Authors: A. Logg

Addresses: Center for Biomedical Computing, Simula Research Laboratory, Department of Informatics, University of Oslo, P.O. Box 134 1325 Lysaker, Norway

Abstract: 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.

Keywords: computational meshes; mesh representation; mesh algorithms; mesh entity; parallel assembly; partial differential equations; PDE.

DOI: 10.1504/IJCSE.2009.029164

International Journal of Computational Science and Engineering, 2009 Vol.4 No.4, pp.283 - 295

Published online: 08 Nov 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article