tetrahedron_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__tetrahedron_rules__
#define __H__UG__tetrahedron_rules__
 
#include "common/math/ugmath.h"
 
namespace ug{
namespace tet_rules
{
 
//  REFINEMENT RULE
 
enum GlobalRefinementRule{
  STANDARD,
  HYBRID_TET_OCT
};
 
//  LOOKUP TABLES
 
const int NUM_VERTICES  = 4;
const int NUM_EDGES   = 6;
const int NUM_FACES   = 4;
const int NUM_TRIS    = 4;
const int NUM_QUADS   = 0;
const int MAX_NUM_INDS_OUT = 64;//todo: this is just an estimate!
 
const int EDGE_VRT_INDS[][2] = {  {0, 1}, {1, 2}, {2, 0},
                  {0, 3}, {1, 3}, {2,3}};
 
const int FACE_VRT_INDS[][4] = {  {0, 1, 2, -1}, {1, 3, 2, -1},
                  {0, 2, 3, -1}, {0, 3, 1, -1}};
 
const int OPPOSED_EDGE[] = {5, 3, 4, 1, 2, 0};
 
const int OPPOSED_OBJECT[][NUM_VERTICES] = {{2, 1}, {2, 2}, {2, 3}, {2, 0}};
 
//  NOTE: The lists below are all generated automatically
 
const int FACE_EDGE_INDS[4][4] =  {{0, 1, 2, -1}, {4, 5, 1, -1},
                   {2, 5, 3, -1}, {3, 4, 0, -1}};
 
const int FACE_CONTAINS_EDGE[][6] = {{1, 1, 1, 0, 0, 0}, {0, 1, 0, 0, 1, 1},
                   {0, 0, 1, 1, 0, 1}, {1, 0, 0, 1, 1, 0}};
 
 
const int EDGE_FROM_VRTS[4][4] =  {{-1, 0, 2, 3}, {0, -1, 1, 4},
                   {2, 1, -1, 5}, {3, 4, 5, -1}};
 
 
const int FACE_FROM_VRTS[4][4][4] =
      {{{-1, -1, -1, -1}, {-1, -1, 0, 3}, {-1, 0, -1, 2}, {-1, 3, 2, -1}},
       {{-1, -1, 0, 3}, {-1, -1, -1, -1}, {0, -1, -1, 1}, {3, -1, 1, -1}},
       {{-1, 0, -1, 2}, {0, -1, -1, 1}, {-1, -1, -1, -1}, {2, 1, -1, -1}},
       {{-1, 3, 2, -1}, {3, -1, 1, -1}, {2, 1, -1, -1}, {-1, -1, -1, -1}}};
 
const int FACE_FROM_EDGES[][6] =  {{0, 0, 0, 3, 3, -1}, {0, 0, 0, -1, 1, 1},
                   {0, 0, 0, 2, -1, 2}, {3, -1, 2, 2, 3, 2},
                   {3, 1, -1, 3, 1, 1}, {-1, 1, 2, 2, 1, 1}};
 
 
 
 
int Refine(int* newIndsOut, int* newEdgeVrts, bool& newCenterOut,
       vector3* corners = NULL, bool* isSnapPoint = NULL);
 
 
 
bool IsRegularRefRule(const int edgeMarks);
 
 
void SetRefinementRule(GlobalRefinementRule refRule);
GlobalRefinementRule GetRefinementRule();
 
}// end of namespace tet_rules
}// end of namespace ug
 
#endif