Line data    Source code

       1              : /*
       2              :  * Copyright (c) 2011-2015:  G-CSC, Goethe University Frankfurt
       3              :  * Author: Sebastian Reiter
       4              :  * 
       5              :  * This file is part of UG4.
       6              :  * 
       7              :  * UG4 is free software: you can redistribute it and/or modify it under the
       8              :  * terms of the GNU Lesser General Public License version 3 (as published by the
       9              :  * Free Software Foundation) with the following additional attribution
      10              :  * requirements (according to LGPL/GPL v3 §7):
      11              :  * 
      12              :  * (1) The following notice must be displayed in the Appropriate Legal Notices
      13              :  * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
      14              :  * 
      15              :  * (2) The following notice must be displayed at a prominent place in the
      16              :  * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
      17              :  * 
      18              :  * (3) The following bibliography is recommended for citation and must be
      19              :  * preserved in all covered files:
      20              :  * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
      21              :  *   parallel geometric multigrid solver on hierarchically distributed grids.
      22              :  *   Computing and visualization in science 16, 4 (2013), 151-164"
      23              :  * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
      24              :  *   flexible software system for simulating pde based models on high performance
      25              :  *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
      26              :  * 
      27              :  * This program is distributed in the hope that it will be useful,
      28              :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
      29              :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
      30              :  * GNU Lesser General Public License for more details.
      31              :  */
      32              : 
      33              : #ifndef __H__UG__expand_layers__
      34              : #define __H__UG__expand_layers__
      35              : 
      36              : #include <vector>
      37              : #include "lib_grid/lg_base.h"
      38              : 
      39              : namespace ug
      40              : {
      41              : 
      42              : /// Used to tell ExpandLayers_... which subsets should be regarded as layers.
      43              : /**
      44              :  *      - subsetIndex defines the subset of the source (low dimensional) layer.
      45              :  *      - newSubsetIndex defines the subset into which the newly generated elements will go.
      46              :  *      - width describes the width to which a layer shall be expanded.
      47              :  */
      48              : struct FractureInfo{
      49            0 :         FractureInfo(int subsetInd, int newSubsetInd, double w) :
      50            0 :                 subsetIndex(subsetInd), newSubsetIndex(newSubsetInd), width(w)  {}
      51              : 
      52              :         int subsetIndex;
      53              :         int newSubsetIndex;
      54              :         double width;
      55              : };
      56              : 
      57              : /**
      58              :  * This algorithm indirectly uses Grid::mark.
      59              :  *
      60              :  * 1 dimensional fractures specified in fracInfos are expanded to 2 dimensional subsets.
      61              :  * the resulting fractures will then consist of 2 layers of quadrilaterals. On the
      62              :  * boundaries triangles are inserted.
      63              :  *
      64              :  * Through expandFracBoundaries you can tell the algorithm whether inner fracture
      65              :  * boundaries shall be expanded. Note that this means that an additional node is
      66              :  * introduced at each inner fracture boundary vertex and that the associated
      67              :  * fracture elements are connected at two sides.
      68              :  * Note that fractures are always expanded at boundaries which lie on the geometries
      69              :  * boundary.
      70              :  *
      71              :  *      This algorithm requires the option FACEOPT_AUTOGENERATE_EDGES.
      72              :  *      The option is automatically enabled if required.
      73              :  */
      74              : bool ExpandFractures2d(Grid& grid, SubsetHandler& sh,
      75              :                                                 const std::vector<FractureInfo>& fracInfos,
      76              :                                                 bool expandInnerFracBnds, bool expandOuterFracBnds);
      77              : 
      78              : 
      79              : /**
      80              :  * This algorithm indirectly uses Grid::mark.
      81              :  *
      82              :  * 2 dimensional fractures specified in fracInfos are expanded to 3 dimensional subsets.
      83              :  * the resulting fractures will then consist of 2 layers of hexahedrons. On the
      84              :  * boundaries tetrahedrons, prisms and pyramids are inserted.
      85              :  *
      86              :  * Through expandFracBoundaries you can tell the algorithm whether inner fracture
      87              :  * boundaries shall be expanded. Note that this means that an additional node is
      88              :  * introduced at each inner fracture boundary vertex and that the associated
      89              :  * fracture elements are connected at two sides.
      90              :  * Note that fractures are always expanded at boundaries which lie on the geometries
      91              :  * boundary.
      92              :  *
      93              :  *      This algorithm requires the option FACEOPT_AUTOGENERATE_EDGES.
      94              :  *      The option is automatically enabled if required.
      95              :  *
      96              :  *      This algorithm requires the option VOLOPT_AUTOGENERATE_FACES.
      97              :  *      The option is automatically enabled if required.
      98              :  */
      99              : bool ExpandFractures3d(Grid& grid, SubsetHandler& sh,
     100              :                                                 const std::vector<FractureInfo>& fracInfos,
     101              :                                                 bool expandInnerFracBnds, bool expandOuterFracBnds);
     102              : 
     103              : }//     end of namespace
     104              : 
     105              : #endif