t8
1.2.0
t8code is a C library to manage a forest of adaptive space-trees of general element classes in parallel.
|
TODO: come back later to see if it's worth having this separate file. More...
#include <t8.h>
Go to the source code of this file.
Macros | |
#define | T8_DTET_DIM (3) |
The spatial dimension. | |
Variables | |
const int | t8_dtet_cid_type_to_parenttype [8][6] |
Store the type of parent for each (cube-id,type) combination. | |
const int | t8_dtet_type_of_child [6][8] |
Store the type of child for each (type,child number) combination, where child number is the number in Bey order. | |
const int | t8_dtet_type_of_child_morton [6][8] |
Store the type of child for each (type,child number) combination, where child number is the number in Morton order. | |
const int | t8_dtet_index_to_bey_number [6][8] |
Store the Bey child number for each (Parent type,Morton child number) combination. | |
const int | t8_dtet_beyid_to_vertex [8] |
The anchor node of a child of a tetrahedron T is the convex combination of T's anchor node x_0 and another node x_i of T. More... | |
const int | t8_dtet_type_cid_to_beyid [6][8] |
Store the Bey child number for each (type,cube-id) combination. | |
const int | t8_dtet_parenttype_beyid_to_Iloc [6][8] |
Store the local index for each (parenttype,Bey child number) combination. | |
const int | t8_dtet_type_cid_to_Iloc [6][8] |
Store the local index for each (type,cube-id) combination. | |
const int | t8_dtet_parenttype_Iloc_to_type [6][8] |
Store the type for each (parenttype,local Index) combination. | |
const int | t8_dtet_parenttype_Iloc_to_cid [6][8] |
Store the cube-id for each (parenttype,local Index) combination. | |
const int | t8_dtet_type_face_to_boundary [6][4][2] |
Store for each (type, face_index) the combination (category, type) of the respective boundary triangle. More... | |
const int | t8_dtet_face_child_id_by_type [6][4][4] |
Store for each (type, face_index) the child_ids of the children of a tet of the given type that share the given face. More... | |
const int | t8_dtet_face_corner [4][3] |
Store the indices of the corner of each face of a tetrahedron. More... | |
const int | t8_dtet_parent_type_type_to_face [6][6] |
For each combination parent_type, type with parent_type != type, provide the face number of the face of a tet that lies whithin a face of the parent. More... | |
TODO: come back later to see if it's worth having this separate file.
|
extern |
The anchor node of a child of a tetrahedron T is the convex combination of T's anchor node x_0 and another node x_i of T.
This array gives the index i in dependence of the Bey child id.
|
extern |
Store for each (type, face_index) the child_ids of the children of a tet of the given type that share the given face.
I.e. [1][3] lists the child_ids of the children of a type 1 tetrahedron that have a subface of face 3 of this tetrahedron. The order of the children is given by the 2-dimensional TM-order on the face.
|
extern |
Store the indices of the corner of each face of a tetrahedron.
face_corner[f][0] is always the lowest corner index of that face. The other 2 corner are given in counterclockwise order as seen from outside of the tet.
|
extern |
For each combination parent_type, type with parent_type != type, provide the face number of the face of a tet that lies whithin a face of the parent.
For each combination there is exactly one of these faces. If parent_type = type then there are multiple faces and thus this case is not covered here. If face is 0 or 3, then the corresponding parent face is also 0 resp. 3. If face is 1 or 2, then the corresponding parent face is 2 resp. 1. Some combination such as parent_type = 0 type = 3 (in general the pair (i, i+3)) do not correspond to any face relations since no tet of the given type has a parent of the parent type. In these cases, the array stores -1. We also store -1 for the parent_type = type combination.
|
extern |
Store for each (type, face_index) the combination (category, type) of the respective boundary triangle.
I.e. {2, 1} means the boundary triangle is of category 2 and type 1. The category determines how the coordinates of the triangle are computed from the parent.