Segment_poly.cpp

/****************************************************************************
* Copyright (c) 2024, CEA
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*****************************************************************************/
 
#include <Segment_poly.h>
#include <Domaine.h>
#include <Equation_base.h>
#include <Milieu_base.h>
#include <Domaine_Poly_base.h>
// Tri: to check for champ_P1...
#include <Tri_poly.h>
Implemente_instanciable(Segment_poly,"Segment_poly",Elem_poly_base);
 
// printOn and readOn
 
 
Sortie& Segment_poly::printOn(Sortie& s ) const
{
  return s << que_suis_je() << finl;
}
 
Entree& Segment_poly::readOn(Entree& s )
{
  return s ;
}
 
 
/*! @brief Fills in the face_normales array in the Domaine_poly.
 *
 */
void Segment_poly::normale(int num_Face,DoubleTab& Face_normales,
                           const  IntTab& Face_sommets,
                           const IntTab& Face_voisins,
                           const IntTab& elem_faces,
                           const Domaine& domaine_geom) const
{
  // no simple meaning for the normal here
  Face_normales(num_Face,0) = 1;
 
  {
 
    //int n0 = Face_sommets(num_Face,0);
 
    int elem1 = Face_voisins(num_Face,0);
    // int elem2 = Face_voisins(num_Face,1);
 
    int n2=elem_faces(elem1,0);
    if (n2==num_Face) Face_normales(num_Face,0) = -1;
    /*
    const DoubleTab& les_coords = domaine_geom.domaine().coord_sommets();
    //     const IntTab& elem = domaine_geom.elems();
 
       {
    int n2=elem_faces(elem1,0);
    if ( n2 == num_Face )
    n2 = elem_faces(elem1,1);
    n2=Face_sommets(n2,0);
    for (int i=0;i<dim;i++)
    d(i) =les_coords(n0,i)- les_coords(n2,i);
    d/=d.norm();
 
    Face_normales(num_Face,0) = -1;
 
    }
 
    //int n1 = Face_sommets(num_Face,1);
 
    // Orient the normal from elem1 to elem2
    // by searching for the vertex of elem1 that is not on the Face
    int f0,no3;
    int elem1 = Face_voisins(num_Face,0);
    Cerr<<num_Face<<" iii "<<elem1<< " "<<Face_voisins(num_Face,1)<<" "<<(Face_voisins(num_Face,0)==elem1)    <<finl;
    if ( (f0 = elem_faces(elem1,0)) == num_Face )
    f0 = elem_faces(elem1,1);
    if ( (no3 = Face_sommets(f0,0)) != n0  )
    Cerr<<"oo "<<finl;
    else
    {
    Cerr<<"ii"<<finl;
    no3 = Face_sommets(f0,1);
    }
    Cerr<<n0 << " "<<finl;
    */
  }
  return;
  /*
 
 
  double x1,y1;
  double nx,ny;
  int no3; int f0;
  int n0 = Face_sommets(num_Face,0);
  int n1 = Face_sommets(num_Face,1);
  x1 = les_coords(n0,0)-les_coords(n1,0);
  y1 = les_coords(n0,1)-les_coords(n1,1);
  nx = -y1;
  ny = x1;
 
  // Orient the normal from elem1 to elem2
  // by searching for the vertex of elem1 that is not on the Face
  int elem1 = Face_voisins(num_Face,0);
  if ( (f0 = elem_faces(elem1,0)) == num_Face )
    f0 = elem_faces(elem1,1);
  if ( (no3 = Face_sommets(f0,0)) != n0 && no3 != n1 )
    ;
  else
    no3 = Face_sommets(f0,1);
 
  x1 = les_coords(no3,0) - les_coords(n0,0);
  y1 = les_coords(no3,1) - les_coords(n0,1);
 
  if ( (nx*x1+ny*y1) > 0 ) {
    Face_normales(num_Face,0) = - nx;
    Face_normales(num_Face,1) = - ny;
  }
  else {
    Face_normales(num_Face,0) = nx;
    Face_normales(num_Face,1) = ny;
  }
  */
}
 
/*! @brief
 *
 */
void Segment_poly::calcul_vc(const ArrOfInt& Face,ArrOfDouble& vc,
                             const ArrOfDouble& vs,const DoubleTab& vsom,
                             const Champ_Inc_base& vitesse,int type_cl) const
{
  const DoubleVect& porosite_face = vitesse.equation().milieu().porosite_face();
  //Cerr << " type_cl " <<  type_cl << finl;
  switch(type_cl)
    {
    case 0: // the triangle has no Dirichlet face
      {
        vc[0] = vs[0]/3;
        vc[1] = vs[1]/3;
        break;
      }
 
    case 1: // the triangle has one Dirichlet face: face 2
      {
        vc[0]= vitesse.valeurs()(Face[2],0)*porosite_face[Face[2]];
        vc[1]= vitesse.valeurs()(Face[2],1)*porosite_face[Face[2]];
        //vc[0]= vitesse.valeurs()(Face[2],0);
        //vc[1]= vitesse.valeurs()(Face[2],1);
        break;
      }
 
    case 2: // the triangle has one Dirichlet face: face 1
      {
        vc[0]= vitesse.valeurs()(Face[1],0)*porosite_face[Face[1]];
        vc[1]= vitesse.valeurs()(Face[1],1)*porosite_face[Face[1]];
        //vc[0]= vitesse.valeurs()(Face[1],0);
        //vc[1]= vitesse.valeurs()(Face[1],1);
        break;
      }
 
    case 4: // the triangle has one Dirichlet face: face 0
      {
        vc[0]= vitesse.valeurs()(Face[0],0)*porosite_face[Face[0]];
        vc[1]= vitesse.valeurs()(Face[0],1)*porosite_face[Face[0]];
        // vc[0]= vitesse.valeurs()(Face[0],0);
        //vc[1]= vitesse.valeurs()(Face[0],1);
        break;
      }
 
    case 3: // the triangle has two Dirichlet faces: faces 1 and 2
      {
        vc[0]= vsom(0,0);
        vc[1]= vsom(0,1);
        break;
      }
 
    case 5: // the triangle has two Dirichlet faces: faces 0 and 2
      {
        vc[0]= vsom(1,0);
        vc[1]= vsom(1,1);
        break;
      }
 
    case 6: // the triangle has two Dirichlet faces: faces 0 and 1
      {
        vc[0]= vsom(2,0);
        vc[1]= vsom(2,1);
        break;
      }
 
    } // end switch
 
}
 
/*! @brief Computes the coordinates xg of the centre of a non-standard element;
 *   also computes idirichlet = number of Dirichlet faces of the element.
 *
 *  If idirichlet=2, n1 is the index of the vertex coinciding with G.
 *
 */
void Segment_poly::calcul_xg(DoubleVect& xg, const DoubleTab& x,
                             const int type_elem_Cl,int& idirichlet,int& n1,int& ,int& ) const
{
  int j,dim=xg.size();
  switch(type_elem_Cl)
    {
 
    case 0:  // the triangle has no Dirichlet face: it has 3 facets
      //  point G is the barycentre of the triangle vertices
      {
        for (j=0; j<dim; j++)
          xg[j]=(x(0,j)+x(1,j)+x(2,j))/3;
 
        idirichlet=0;
        break;
      }
 
    case 1:  // the triangle has one Dirichlet face: face 2
      // point G is the barycentre of the vertices of face 2
 
      {
        for (j=0; j<dim; j++)
          xg[j]=(x(0,j)+x(1,j))/2;
 
        idirichlet=1;
        break;
      }
 
    case 2:  // the triangle has one Dirichlet face: face 1
      // point G is the barycentre of the vertices of face 1
 
      {
        for (j=0; j<dim; j++)
          xg[j]=(x(0,j)+x(2,j))/2;
 
        idirichlet=1;
        break;
      }
 
    case 4:  // the triangle has one Dirichlet face: face 0
      // point G is the barycentre of the vertices of face 0
 
      {
        for (j=0; j<dim; j++)
          xg[j]=(x(1,j)+x(2,j))/2;
 
        idirichlet=1;
        break;
      }
 
    case 6 : // the triangle has two Dirichlet faces: faces 0,1
      // point G is vertex 2 of the triangle
 
      {
        for (j=0; j<dim; j++)
          xg[j]=x(2,j);
 
        idirichlet=2;
        n1 = 2;
        break;
 
      }
 
    case 5 : // the triangle has two Dirichlet faces: faces 0,2
      // point G is vertex 1 of the triangle
 
      {
        for (j=0; j<dim; j++)
          xg[j]=x(1,j);
 
        idirichlet=2;
        n1 = 1;
        break;
 
      }
 
    case 3 : // the triangle has two Dirichlet faces: faces 1,2
      // point G is vertex 0 of the triangle
 
      {
        for (j=0; j<dim; j++)
          xg[j]=x(0,j);
 
        idirichlet=2;
        n1 = 0;
        break;
 
      }
 
    } // end switch
 
}