[GiDlist] element connectivities by edges

[geraldos]

Hi Everybody,

I work with Finite Element Methods based Discontinuous Galerkin and I
need of the informations

of the edges of the elements.

I want to know how to generate a list "element vs edges(or side)".

We have the element connectivities by nodes (element vs nodes), but I
want to obtain

element connectivities by edges (element vs edges) and global identity
of edges.


My thanks,

Geraldo Belmonte

[escolano]

Edges themselves are not explictly managed by GiD, they doesn't exist as GiD
entities,
you must enumerate them implicitly as the edges of the elements (and assign
and implicit an id if you want)

About discontinuous fields, you can define them by element: specifying a
'gauss result' on some locations of the elements
(this result will be discontinuous between neighbor elements), on the other
hand with nodal results the field will be continuous.

----- Original Message -----
From: "geraldos" geraldos at lncc.br
To: gidlist at listas.cimne.upc.edu
Sent: Friday, September 21, 2012 6:15 PM
Subject: [GiDlist] element connectivities by edges


Hi Everybody,

I work with Finite Element Methods based Discontinuous Galerkin and I
need of the informations

of the edges of the elements.

I want to know how to generate a list "element vs edges(or side)".

We have the element connectivities by nodes (element vs nodes), but I
want to obtain

element connectivities by edges (element vs edges) and global identity
of edges.


My thanks,

Geraldo Belmonte
_______________________________________________
GiDlist mailing list
GiDlist at listas.cimne.upc.edu
http://listas.cimne.upc.edu/cgi-bin/mailman/listinfo/gidlist