Data Structures and Workflows for ICME
33
Fig. 7 Schematic showing building-block unit elements for SIMPL geometries. Note how data
may be stored on any unit element that comprises a given simplex. (Figure reproduced courtesy
Groeber and Jackson [33])
n-D rectilinear grid, the total number of values, v, needed for complete definition is
given by the following equation:
v =
n
i=0
N i + 1
where N i is the number of elements along the ith dimension.
The unstructured geometries require explicit definition of point coordinates.
Additionally, for any geometry other than vertex, the connectivity between points
must be stored. SIMPL represents unstructured geometries using shared element
lists. In the shared element list schema, only unique unit elements are stored; for
example, if two triangles share an edge, then the two vertices that comprise that
edge are shared, and need not be stored twice. Despite their simplicity, shared
element lists offer a number of benefits: highly efficient storage of the geometric
33
Fig. 7 Schematic showing building-block unit elements for SIMPL geometries. Note how data
may be stored on any unit element that comprises a given simplex. (Figure reproduced courtesy
Groeber and Jackson [33])
n-D rectilinear grid, the total number of values, v, needed for complete definition is
given by the following equation:
v =
n
i=0
N i + 1
where N i is the number of elements along the ith dimension.
The unstructured geometries require explicit definition of point coordinates.
Additionally, for any geometry other than vertex, the connectivity between points
must be stored. SIMPL represents unstructured geometries using shared element
lists. In the shared element list schema, only unique unit elements are stored; for
example, if two triangles share an edge, then the two vertices that comprise that
edge are shared, and need not be stored twice. Despite their simplicity, shared
element lists offer a number of benefits: highly efficient storage of the geometric