split_prism.hpp

Go to the documentation of this file.

//    |  /           |
//    ' /   __| _` | __|  _ \   __|
//    . \  |   (   | |   (   |\__ `
//   _|\_\_|  \__,_|\__|\___/ ____/
//                   Multi-Physics
//
//  License:         BSD License
//                   Kratos default license: kratos/license.txt
//
//  Main authors:    Pooyan Dadvand
//                   Riccardo Rossi
//
//
 
#if !defined(KRATOS_SPLIT_PRISM)
#define  KRATOS_SPLIT_PRISM
 
/***********************************************************************************/
/***********************************************************************************/
 
void PrismSplitMode(
  const int aux_ids[12],
  int edge_ids[6]
)
{
    /* Edge 01*/
    if (aux_ids[6] < 0)
    {
        if (aux_ids[0] > aux_ids[1])
    {
      edge_ids[0] = 0;
      edge_ids[3] = 3;
    }
        else
    {
      edge_ids[0] = 1;
      edge_ids[3] = 4;
    }
    }
    else
    {
        edge_ids[0] = 6;
        edge_ids[3] = 9;
    }
 
    /* Edge 12*/
    if (aux_ids[7] < 0)
        if (aux_ids[1] > aux_ids[2])
    {
      edge_ids[1] = 1;
      edge_ids[4] = 4;
    }
        else
    {
      edge_ids[1] = 2;
      edge_ids[4] = 5;
    }
    else
    {
        edge_ids[1] = 7;
        edge_ids[4] = 10;
    }
 
    /* Edge 20*/
    if (aux_ids[8] < 0)
    {
        if (aux_ids[2] > aux_ids[0])
    {
      edge_ids[2] = 2;
      edge_ids[5] = 5;
    }
        else
    {
      edge_ids[2] = 0;
      edge_ids[5] = 3;
    }
    }
    else
    {
        edge_ids[2] = 8;
        edge_ids[5] = 11;
    }
}
 
/***********************************************************************************/
/***********************************************************************************/
 
inline void PrismGetNewConnectivityGID(
  const int prism_index,
  const int t[24],
  const int aux_ids[12],
  int* id0,
  int* id1,
  int* id2,
  int* id3,
  int* id4,
  int* id5
)
{
    unsigned int base = prism_index * 6;
    *id0 = aux_ids[t[base]];
    *id1 = aux_ids[t[base + 1]];
    *id2 = aux_ids[t[base + 2]];
    *id3 = aux_ids[t[base + 3]];
    *id4 = aux_ids[t[base + 4]];
    *id5 = aux_ids[t[base + 5]];
}
 
int Split_Prism(
  const int  edges[6],
  int  t[24],
  int* number_elem,
  int* splitted_edges,
  int* nint
)
{
    *splitted_edges = 0;
    int topology[6];
    topology[0] = 0;
    topology[1] = 0;
    topology[2] = 0;
    topology[3] = 0;
    topology[4] = 0;
    topology[5] = 0;
 
    for (unsigned int i = 0; i < 6; i++)
    {
        if (edges[i] > 2)
        {
            topology[i] = 1;
            *splitted_edges = *splitted_edges + 1;
        }
    }
 
    if (*splitted_edges == 0 && *nint == 0)
    {
        /* No splitting needed */
        *number_elem = 1;
        // Lower face
        t[0] = 0;
        t[1] = 1;
        t[2] = 2;
 
        // Upper face
        t[3] = 3;
        t[4] = 4;
        t[5] = 5;
 
        return 0;
    }
    /*WARNING = case new central node needed*/
    else if (*splitted_edges == 0 && *nint == 1)
    {
        *number_elem = 3;
        // Lower face
        t[0] = 6;
        t[1] = 0;
        t[2] = 1;
 
        t[6] = 6;
        t[7] = 1;
        t[8] = 2;
 
        t[8] = 6;
        t[8] = 2;
        t[8] = 0;
 
        // Upper face
        t[3] = 9;
        t[4] = 3;
        t[5] = 4;
 
        t[9]  = 9;
        t[10] = 4;
        t[11] = 5;
 
        t[11] = 9;
        t[11] = 5;
        t[11] = 3;
 
        return 1;
    }
    else if (*splitted_edges == 2)
    {
        *number_elem = 2;
        /* Case 1*/
        if (topology[0] == 1)
        {
            // Lower face
            t[0] = 6;
            t[1] = 2;
            t[2] = 0;
 
            t[6] = 6;
            t[7] = 1;
            t[8] = 2;
 
            // Upper face
            t[3] = 9;
            t[4] = 5;
            t[5] = 3;
 
            t[9]  = 9;
            t[10] = 4;
            t[11] = 5;
        }
        /* Case 2*/
        else if (topology[1] == 1)
        {
            // Lower face
            t[0] = 7;
            t[1] = 0;
            t[2] = 1;
 
            t[6] = 7;
            t[7] = 2;
            t[8] = 0;
 
            // Upper face
            t[3] = 10;
            t[4] = 3;
            t[5] = 4;
 
            t[9]  = 10;
            t[10] = 5;
            t[11] = 3;
        }
        /* Case 3*/
        else if (topology[2] == 1)
        {
            // Lower face
            t[0] = 8;
            t[1] = 1;
            t[2] = 2;
 
            t[6] = 8;
            t[7] = 0;
            t[8] = 1;
 
            // Upper face
            t[3] = 11;
            t[4] = 4;
            t[5] = 5;
 
            t[9]  = 11;
            t[10] = 3;
            t[11] = 4;
        }
 
        return 1;
    }
    else if (*splitted_edges == 4)
    {
        *number_elem = 3;
        /* Case 4*/
        if (topology[0] == 1 && topology[1] == 1)
        {
            if (edges[2] == 0) // If I colapse to the node 0 local
            {
                // Lower face
                t[0] = 7;
                t[1] = 6;
                t[2] = 1;
 
                t[6] = 7;
                t[7] = 0;
                t[8] = 6;
 
                t[12] = 7;
                t[13] = 2;
                t[14] = 0;
 
                // Upper face
                t[3] = 10;
                t[4] = 9;
                t[5] = 4;
 
                t[9]  = 10;
                t[10] = 3;
                t[11] = 9;
 
                t[15] = 10;
                t[16] = 5;
                t[17] = 3;
 
            }
            else if (edges[2] == 2) // If I colapse to the node 2 local
            {
                // Lower face
                t[0] = 7;
                t[1] = 6;
                t[2] = 1;
 
                t[6] = 7;
                t[7] = 2;
                t[8] = 6;
 
                t[12] = 6;
                t[13] = 2;
                t[14] = 0;
 
                // Upper face
                t[3] = 10;
                t[4] = 9;
                t[5] = 4;
 
                t[9]  = 10;
                t[10] = 5;
                t[11] = 9;
 
                t[15] = 9;
                t[16] = 5;
                t[17] = 3;
            }
        }
        /* Case 5*/
        else if (topology[1] == 1 && topology[2] == 1)
        {
            if (edges[0] == 0) // If I colapse to the node 0 local
            {
                // Lower face
                t[0] = 5;
                t[1] = 4;
                t[2] = 2;
 
                t[6] = 5;
                t[7] = 0;
                t[8] = 4;
 
                t[12] = 4;
                t[13] = 0;
                t[14] = 1;
            }
            else if (edges[0] == 1)
            {
                // Lower face
                t[0] = 5;
                t[1] = 4;
                t[2] = 2;
 
                t[6] = 5;
                t[7] = 1;
                t[8] = 4;
 
                t[12] = 5;
                t[13] = 0;
                t[14] = 1;
            }
        }
        /* Case 6 */
        else if (topology[0] == 1 && topology[2] == 1)
        {
            if (edges[1] == 1)
            {
                // Lower face
                t[0] = 8;
                t[1] = 0;
                t[2] = 6;
 
                t[6] = 8;
                t[7] = 6;
                t[8] = 1;
 
                t[12] = 8;
                t[13] = 1;
                t[14] = 2;
 
                // Upper face
                t[3] = 11;
                t[4] = 3;
                t[5] = 9;
 
                t[9] = 11;
                t[10] = 9;
                t[11] = 4;
 
                t[15] = 11;
                t[14] = 4;
                t[15] = 5;
            }
            else if (edges[1] == 2)
            {
                // Lower face
                t[0] = 8;
                t[1] = 0;
                t[2] = 6;
 
                t[6] = 8;
                t[7] = 6;
                t[8] = 2;
 
                t[12] = 6;
                t[13] = 1;
                t[14] = 2;
 
                // Upper face
                t[3] = 11;
                t[4] = 3;
                t[5] = 9;
 
                t[9]  = 11;
                t[10] = 9;
                t[11] = 5;
 
                t[15] = 9;
                t[16] = 4;
                t[17] = 5;
            }
        }
        return 1;
    }
    else if (*splitted_edges == 6)
    {
        *number_elem = 4;
        // Lower face
        t[0] = 8;
        t[1] = 0;
        t[2] = 6;
 
        t[6] = 8;
        t[7] = 6;
        t[8] = 7;
 
        t[12] = 7;
        t[13] = 6;
        t[14] = 1;
 
        t[18] = 8;
        t[19] = 7;
        t[20] = 2;
 
        // Upper face
        t[3] = 11;
        t[4] = 3;
        t[5] = 9;
 
        t[9]  = 11;
        t[10] = 9;
        t[11] = 10;
 
        t[15] = 10;
        t[16] = 9;
        t[17] = 4;
 
        t[21] = 11;
        t[22] = 10;
        t[23] = 5;
 
        return 1;
    }
    else
    {
        return 0;
    }
 
}
 
#endif /* KRATOS_SPLIT_PRISM  defined */