prism_rules.h

Go to the documentation of this file.

/*
 * Copyright (c) 2011-2015:  G-CSC, Goethe University Frankfurt
 * Author: Sebastian Reiter
 * 
 * This file is part of UG4.
 * 
 * UG4 is free software: you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License version 3 (as published by the
 * Free Software Foundation) with the following additional attribution
 * requirements (according to LGPL/GPL v3 §7):
 * 
 * (1) The following notice must be displayed in the Appropriate Legal Notices
 * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (2) The following notice must be displayed at a prominent place in the
 * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (3) The following bibliography is recommended for citation and must be
 * preserved in all covered files:
 * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
 *   parallel geometric multigrid solver on hierarchically distributed grids.
 *   Computing and visualization in science 16, 4 (2013), 151-164"
 * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
 *   flexible software system for simulating pde based models on high performance
 *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU Lesser General Public License for more details.
 */
 
#ifndef __H__UG__prism_rules__
#define __H__UG__prism_rules__
 
//  only required for dummy-parameter ug::vector3*
#include "common/math/ugmath_types.h"
 
namespace ug{
namespace prism_rules{
 
//  LOOKUP TABLES
 
const int NUM_VERTICES  = 6;
const int NUM_EDGES   = 9;
const int NUM_FACES   = 5;
const int NUM_TRIS    = 2;
const int NUM_QUADS   = 3;
const int MAX_NUM_INDS_OUT = 128;//todo: this is just an estimate!
const int MAX_NUM_CONVERT_TO_TETS_INDS_OUT = 15;
const int MAX_NUM_COLLAPSE_INDS_OUT = 6;
 
const int EDGE_VRT_INDS[][2] = {  {0, 1}, {1, 2}, {2, 0},
                  {0, 3}, {1, 4}, {2, 5},
                  {3, 4}, {4, 5}, {5, 3}};
 
const int FACE_VRT_INDS[][4] = {  {0, 1, 2, -1},  {0, 3, 4, 1},
//                  {1, 4, 5, 2}, {0, 2, 5, 3},
                  {1, 4, 5, 2}, {2, 5, 3, 0},
                  {3, 5, 4, -1}};
 
const int OPPOSED_FACE[NUM_FACES] = {4, -1, -1, -1, 0};
 
 
const int OPPOSED_OBJECT[][NUM_VERTICES] = {{1, 7}, {1, 8}, {1, 6}, {1, 1}, {1, 2}, {1, 0}};
 
 
//  SOME HELPER TABLES
const int TOP_FACE =  4;
const int BOTTOM_FACE = 0;
 
const int IS_BOTTOM_EDGE[9] = {1, 1, 1, 0, 0, 0, 0, 0, 0};
const int IS_SIDE_EDGE[9] =   {0, 0, 0, 1, 1, 1, 0, 0, 0};
const int IS_TOP_EDGE[9] =    {0, 0, 0, 0, 0, 0, 1, 1, 1};
 
const int TRIS[2] =   {0, 4};
const int QUADS[3] =  {1, 2, 3};
 
//  NOTE: The lists below are all generated automatically
 
const int FACE_EDGE_INDS[5][4] =  {{0, 1, 2, -1}, {3, 6, 4, 0}, {4, 7, 5, 1},
                   {5, 8, 3, 2}, {8, 7, 6, -1}};
//const int FACE_EDGE_INDS[5][4] =  {{0, 1, 2, -1}, {3, 6, 4, 0}, {4, 7, 5, 1},
//                   {2, 5, 8, 3}, {8, 7, 6, -1}};
 
const int FACE_CONTAINS_EDGE[][9] =
        {{1, 1, 1, 0, 0, 0, 0, 0, 0}, {1, 0, 0, 1, 1, 0, 1, 0, 0},
         {0, 1, 0, 0, 1, 1, 0, 1, 0}, {0, 0, 1, 1, 0, 1, 0, 0, 1},
         {0, 0, 0, 0, 0, 0, 1, 1, 1}};
 
 
const int EDGE_FROM_VRTS[6][6] =
        {{-1, 0, 2, 3, -1, -1}, {0, -1, 1, -1, 4, -1},
         {2, 1, -1, -1, -1, 5}, {3, -1, -1, -1, 6, 8},
         {-1, 4, -1, 6, -1, 7}, {-1, -1, 5, 8, 7, -1}};
 
 
const int FACE_FROM_VRTS[6][6][6] =
              {{{-1, -1, -1, -1, -1, -1}, {-1, -1, 0, 1, 1, -1},
                {-1, 0, -1, 3, -1, 3}, {-1, 1, 3, -1, 1, 3},
                {-1, 1, -1, 1, -1, -1}, {-1, -1, 3, 3, -1, -1}},
               {{-1, -1, 0, 1, 1, -1}, {-1, -1, -1, -1, -1, -1},
                {0, -1, -1, -1, 2, 2}, {1, -1, -1, -1, 1, -1},
                {1, -1, 2, 1, -1, 2}, {-1, -1, 2, -1, 2, -1}},
               {{-1, 0, -1, 3, -1, 3}, {0, -1, -1, -1, 2, 2},
                {-1, -1, -1, -1, -1, -1}, {3, -1, -1, -1, -1, 3},
                {-1, 2, -1, -1, -1, 2}, {3, 2, -1, 3, 2, -1}},
               {{-1, 1, 3, -1, 1, 3}, {1, -1, -1, -1, 1, -1},
                {3, -1, -1, -1, -1, 3}, {-1, -1, -1, -1, -1, -1},
                {1, 1, -1, -1, -1, 4}, {3, -1, 3, -1, 4, -1}},
               {{-1, 1, -1, 1, -1, -1}, {1, -1, 2, 1, -1, 2},
                {-1, 2, -1, -1, -1, 2}, {1, 1, -1, -1, -1, 4},
                {-1, -1, -1, -1, -1, -1}, {-1, 2, 2, 4, -1, -1}},
               {{-1, -1, 3, 3, -1, -1}, {-1, -1, 2, -1, 2, -1},
                {3, 2, -1, 3, 2, -1}, {3, -1, 3, -1, 4, -1},
                {-1, 2, 2, 4, -1, -1}, {-1, -1, -1, -1, -1, -1}}};
 
const int FACE_FROM_EDGES[][9] =
        {{0, 0, 0, 1, 1, -1, 1, -1, -1}, {0, 0, 0, -1, 2, 2, -1, 2, -1},
         {0, 0, 0, 3, -1, 3, -1, -1, 3}, {1, -1, 3, 1, 1, 3, 1, -1, 3},
         {1, 2, -1, 1, 1, 2, 1, 2, -1}, {-1, 2, 3, 3, 2, 2, -1, 2, 3},
         {1, -1, -1, 1, 1, -1, 1, 4, 4}, {-1, 2, -1, -1, 2, 2, 4, 2, 4},
         {-1, -1, 3, 3, -1, 3, 4, 4, 3}};
 
 
int Refine(int* newIndsOut, int* newEdgeVrts, bool& newCenterOut,
       vector3* corners = NULL, bool* isSnapPoint = NULL);
 
 
 
bool IsRegularRefRule(const int edgeMarks);
 
 
 
template <class TCmp>
int ConvertToTetrahedra(int* newIndsOut, TCmp cmp);
 
 
 
int CollapseEdge(int* newIndsOut, int v0, int v1);
 
}// end of namespace
}// end of namespace
 
//  include implementation
#include "prism_rules_impl.h"
 
#endif