The full text of this article


Efficient representation of computational meshes
by A. Logg
International Journal of Computational Science and Engineering (IJCSE), Vol. 4, No. 4, 2009


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.

Online publication date: Sun, 08-Nov-2009


is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:


    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email