Line data    Source code

       1              : /*
       2              :  * Copyright (c) 2017:  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              : #include "orientation_util.h"
      34              : 
      35              : namespace ug{
      36              : 
      37            0 : bool EdgeOrientationMatches(EdgeVertices* ev, Face* f)
      38              : {
      39            0 :         return OrientationMatches(ev, f);
      40              : }
      41              : 
      42            0 : bool OrientationMatches(EdgeVertices* ev, Face* f)
      43              : {
      44              : //      find the first vertex of ed in f
      45              :         size_t i;
      46            0 :         for(i = 0; i < f->num_vertices(); ++i)
      47              :         {
      48            0 :                 if(f->vertex(i) == ev->vertex(0))
      49              :                         break;
      50              :         }
      51              : 
      52            0 :         if(i < f->num_vertices())
      53              :         {
      54              :         //      the first one has been found.
      55              :         //      check whether the second vertex of ed is the
      56              :         //      same as the next vertex of f
      57            0 :                 if(ev->vertex(1) == f->vertex((i+1)%f->num_vertices()))
      58              :                         return true;//  the orientation is the same
      59              :         }
      60              : 
      61              : //      the orientation is not the same.
      62              :         return false;
      63              : }
      64              : 
      65              : 
      66              : UG_API 
      67            0 : bool OrientationMatches(FaceVertices* fv, Volume* v)
      68              : {
      69              : //      find the matching face desc and compare
      70            0 :         FaceDescriptor fd;
      71            0 :         for(size_t iface = 0; iface < v->num_faces(); ++iface){
      72            0 :                 v->face_desc(iface, fd);
      73            0 :                 if(CompareVertices(fv, &fd)){
      74              :                 //      check if their orientation matches
      75              :                 //      find the first vertex of fv in f
      76              :                         size_t i;
      77            0 :                         for(i = 0; i < fd.num_vertices(); ++i)
      78              :                         {
      79            0 :                                 if(fd.vertex(i) == fv->vertex(0))
      80              :                                         break;
      81              :                         }
      82              : 
      83            0 :                         if(i < fd.num_vertices())
      84              :                         {
      85              :                         //      the first one has been found.
      86              :                         //      check whether the second vertex of ed is the
      87              :                         //      same as the next vertex of f
      88            0 :                                 if(fv->vertex(1) == fd.vertex((i+1) % fd.num_vertices()))
      89              :                                         return true;//  the orientation is the same
      90              :                         }
      91              : 
      92              :                 //      the orientation is not the same.
      93            0 :                         return false;
      94              :                 }
      95              :         }
      96              : 
      97              : //      the orientation is not the same.
      98              :         return false;
      99              : }
     100              : 
     101              : }//     end of namespace