ug4
|
Functions | |
int | CollapseEdge (int *newIndsOut, int v0, int v1) |
Creates new volume elements that result from collapsing the edge between v0 and v1 into v0. More... | |
template<class TCmp > | |
int | ConvertToTetrahedra (int *newIndsOut, TCmp cmp) |
fills an array of integers describing tetrahedra that shall replace the pyramid More... | |
bool | IsRegularRefRule (const int edgeMarks) |
returns true if the specified edgeMarks would lead to a regular refinement More... | |
int | Refine (int *newIndsOut, int *newEdgeVrts, bool &newCenterOut, vector3 *, bool *isSnapPoint) |
void | RotatePyramid (int vrtsOut[NUM_VERTICES], int steps) |
Output are the vertices of a pyramid rotated around its vertical axis. More... | |
Variables | |
const int | BOTTOM_EDGE_INDS [NUM_BOTTOM_EDGES] = {0, 1, 2, 3} |
const int | EDGE_FROM_VRTS [5][5] |
Associates the index of the connecting edge with each tuple of vertices. More... | |
const int | EDGE_VRT_INDS [][2] |
the local vertex indices of the given edge More... | |
const int | FACE_CONTAINS_EDGE [][8] |
tells whether the i-th face contains the j-th edge More... | |
const int | FACE_EDGE_INDS [5][4] |
returns the j-th edge of the i-th face More... | |
const int | FACE_FROM_EDGES [][8] |
given two edges, the table returns the face, which contains both (or -1) More... | |
const int | FACE_FROM_VRTS [5][5][5] |
Associates the index of the connecting face with each triple of vertices. More... | |
const int | FACE_VRT_INDS [][4] |
the local vertex indices of the given face More... | |
const int | MAX_NUM_COLLAPSE_INDS_OUT = 5 |
const int | MAX_NUM_CONVERT_TO_TETS_INDS_OUT = 10 |
const int | MAX_NUM_INDS_OUT = 128 |
const int | NUM_BOTTOM_EDGES = 4 |
const int | NUM_EDGES = 8 |
const int | NUM_FACES = 5 |
const int | NUM_QUADS = 1 |
const int | NUM_TOP_EDGES = 4 |
const int | NUM_TRIS = 4 |
const int | NUM_VERTICES = 5 |
const int | OPPOSED_OBJECT [][NUM_VERTICES] = {{1, 6}, {1, 7}, {1, 4}, {1, 5}, {2, 0}} |
const int | TOP_EDGE_INDS [NUM_BOTTOM_EDGES] = {4, 5, 6, 7} |
const int | TOP_VERTEX = 4 |
the pyramids top More... | |
int ug::pyra_rules::CollapseEdge | ( | int * | newIndsOut, |
int | v0, | ||
int | v1 | ||
) |
Creates new volume elements that result from collapsing the edge between v0 and v1 into v0.
Note that the returned array may be empty.
newIndsOut | Array which has to be of size MAX_NUM_COLLAPSE_INDS_OUT. When the algorithm is done, the array will contain sequences of integers: {{gridObjectID, ind1, ind2, ...}, ...}. gridObjectID is a constant enumerated in GridObjectID and describes the type of the grid-object that is built from the following set of corner indices. |
References EDGE_FROM_VRTS, EDGE_VRT_INDS, ug::GOID_TETRAHEDRON, and TOP_VERTEX.
int ug::pyra_rules::ConvertToTetrahedra | ( | int * | newIndsOut, |
TCmp | cmp | ||
) |
fills an array of integers describing tetrahedra that shall replace the pyramid
The method requires a compare-operator that defines a strict (global) ordering on the vertices of pyramid. Note that this operator should return consistent results for all vertices in a given grid. The ordering is used to decide along which diagonal each quadrilateral is split. Each new diagonal will start at the smallest vertex of the corresponding quadrilateral, regarding the given ordering.
The specified compare function (or compare operator) 'bool cmp (int i0, int i1)' will be called with two local corner indices and has to return true, if vertex at the first corner shall be considered smaller (globally) than the vertex at the second corner.
The idea and implementation follows: Dompierre et al., "How to Subdivide Pyramids, Prisms and Hexahedra into Tetrahedra"
newIndsOut | Array which has to be of size MAX_NUM_CONVERT_TO_TETS_INDS_OUT. When the algorithm is done, the array will contain sequences of integers: {{gridObjectID, ind1, ind2, ...}, ...}. gridObjectID is a constant enumerated in GridObjectID and describes the type of the grid-object that is built from the following set of corner indices. |
cmp | A function object that induces a strict ordering on the corners of the pyramid. The method shall return true if the vertex at the first corner-index shall be considered smaller than the vertex at the second corner index. If multiple prisms shall be converted to tetrahedra, it is important that the given ordering is global, i.e., if a pair of vertices is present in two connected prisms, the 'cmp' operator has to return the same value. |
References ug::GOID_TETRAHEDRON, and TOP_VERTEX.
Referenced by ug::ConvertToTetrahedra().
bool ug::pyra_rules::IsRegularRefRule | ( | const int | edgeMarks | ) |
returns true if the specified edgeMarks would lead to a regular refinement
A regular refinement leads to new elements which are all similar to the original element. I.e. which are of the same type and which have similar angles.
edgeMarks | If the i-th edge shall be refined, the expression 'edgeMarks & (1<<i) != 0' has to be true. You can specify multiple refine-edges using or-combinations. E.g., 'edgeMarks = (1<<i) | (1<<j)' would indicate that the i-th and the j-th edge shall be refined. |
int ug::pyra_rules::Refine | ( | int * | newIndsOut, |
int * | newEdgeVrts, | ||
bool & | newCenterOut, | ||
vector3 * | corners = NULL , |
||
bool * | isSnapPoint = NULL |
||
) |
returns an array of integers, which contains the indices of the objects resulting from the refinement of a pyramid.
newIndsOut | Array which has to be of size MAX_NUM_INDS_OUT. When the algorithm is done, the array will contain sequences of integers: {{gridObjectID, ind1, ind2, ...}, ...}. gridObjectID is a constant enumerated in GridObjectID and describes the type of the grid-object that is built from the following set of corner indices. Old vertices are referenced by their local index. Vertices created on an edge are indexed by the index of the edge + NUM_VERTICES. Vertices created on a face are referenced by NUM_VERTICES + NUM_EDGES + index_of_face. If an inner vertex has to be created, it is referenced by NUM_VERTICES + NUM_EDGES + NUM_FACES (in this case newCenterOut is set to true). |
newEdgeVrts | Array of size NUM_EDGES, which has to contain 1 for each edge, which shall be refined and 0 for each edge, which won't be refined. |
newCenterOut | If the refinement-rule requires a center vertex, then this parameter will be set to true. If not, it is set to false. |
corners | Ignored. |
isSnapPoint | (optional) An array of size NUM_VERTICES. If all entries are set to 'false' the behaviour is the same as if the array wasn't specified. If a corner of a quadrilateral is a snap-point and if edges of that quadrilateral are refined, then only new edges connected to the snap-point are introduced. Note that only special snap-point constellations are supported. |
References BOTTOM_EDGE_INDS, EDGE_FROM_VRTS, EDGE_VRT_INDS, FACE_CONTAINS_EDGE, FACE_EDGE_INDS, FACE_FROM_EDGES, FACE_FROM_VRTS, FACE_VRT_INDS, ug::GOID_HEXAHEDRON, ug::GOID_PRISM, ug::GOID_PYRAMID, ug::GOID_TETRAHEDRON, NUM_EDGES, NUM_FACES, NUM_VERTICES, p, ug::shared_rules::RecursiveRefine(), RotatePyramid(), TOP_VERTEX, and UG_LOG.
void ug::pyra_rules::RotatePyramid | ( | int | vrtsOut[NUM_VERTICES], |
int | steps | ||
) |
Output are the vertices of a pyramid rotated around its vertical axis.
Referenced by Refine().
const int ug::pyra_rules::BOTTOM_EDGE_INDS[NUM_BOTTOM_EDGES] = {0, 1, 2, 3} |
Referenced by Refine().
const int ug::pyra_rules::EDGE_FROM_VRTS[5][5] |
Associates the index of the connecting edge with each tuple of vertices.
Use two vertex indices to index into this table to retrieve the index of their connecting edge.
Referenced by CollapseEdge(), and Refine().
const int ug::pyra_rules::EDGE_VRT_INDS[][2] |
the local vertex indices of the given edge
Referenced by CollapseEdge(), and Refine().
const int ug::pyra_rules::FACE_CONTAINS_EDGE[][8] |
tells whether the i-th face contains the j-th edge
Referenced by Refine().
const int ug::pyra_rules::FACE_EDGE_INDS[5][4] |
returns the j-th edge of the i-th face
Referenced by Refine().
const int ug::pyra_rules::FACE_FROM_EDGES[][8] |
given two edges, the table returns the face, which contains both (or -1)
Referenced by Refine().
const int ug::pyra_rules::FACE_FROM_VRTS[5][5][5] |
Associates the index of the connecting face with each triple of vertices.
Use three vertex indices to index into this table to retrieve the index of their connecting face.
Referenced by Refine().
const int ug::pyra_rules::FACE_VRT_INDS[][4] |
the local vertex indices of the given face
Referenced by Refine().
const int ug::pyra_rules::MAX_NUM_COLLAPSE_INDS_OUT = 5 |
const int ug::pyra_rules::MAX_NUM_CONVERT_TO_TETS_INDS_OUT = 10 |
Referenced by ug::ConvertToTetrahedra().
const int ug::pyra_rules::MAX_NUM_INDS_OUT = 128 |
const int ug::pyra_rules::NUM_BOTTOM_EDGES = 4 |
const int ug::pyra_rules::NUM_EDGES = 8 |
Referenced by Refine().
const int ug::pyra_rules::NUM_FACES = 5 |
Referenced by Refine().
const int ug::pyra_rules::NUM_QUADS = 1 |
const int ug::pyra_rules::NUM_TOP_EDGES = 4 |
const int ug::pyra_rules::NUM_TRIS = 4 |
const int ug::pyra_rules::NUM_VERTICES = 5 |
Referenced by Refine().
const int ug::pyra_rules::OPPOSED_OBJECT[][NUM_VERTICES] = {{1, 6}, {1, 7}, {1, 4}, {1, 5}, {2, 0}} |
for each vertex, a pair containing the object type (0: vrt, 1: edge, 2: face) and an index into the associated array, which describe the object which lies on the opposite side of the pyramid, to a given vertex.
const int ug::pyra_rules::TOP_EDGE_INDS[NUM_BOTTOM_EDGES] = {4, 5, 6, 7} |
const int ug::pyra_rules::TOP_VERTEX = 4 |
the pyramids top
Referenced by CollapseEdge(), ConvertToTetrahedra(), and Refine().