Quadrangle_VEF.cpp

/****************************************************************************
* Copyright (c) 2025, 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 <Quadrangle_VEF.h>
#include <Domaine.h>
#include <Triangle.h>
#include <Polygon_geom_tools.h>
 
// Vertex numbering convention:
//  y
//  ^
//  |
//  2-----3
//  |     |
//  |     |
//  |     |
//  0-----1--> x
//
// Face numbering convention for a quadrangle:
//
//  *--3--*
//  |     |
//  0     2
//  |     |
//  *--1--*
static int faces_sommets_quadra[4][2] =
{
  { 0, 2 },
  { 0, 1 },
  { 1, 3 },
  { 2, 3 }
};
 
Implemente_instanciable_32_64(Quadrangle_VEF_32_64,"Quadrangle",Elem_geom_base_32_64<_T_>);
 
template <typename _SIZE_>
Sortie& Quadrangle_VEF_32_64<_SIZE_>::printOn(Sortie& s ) const
{
  return s;
}
 
 
template <typename _SIZE_>
Entree& Quadrangle_VEF_32_64<_SIZE_>::readOn(Entree& s )
{
  return s;
}
 
 
/*! @brief Returns the LML name of a Quadrangle_VEF = "GOLGOTH24".
 *
 * @return Always equal to "GOLGOTH24" (or "VOXEL8" / "QUADRANGLE_3D" depending on dimension).
 */
template <typename _SIZE_>
const Nom& Quadrangle_VEF_32_64<_SIZE_>::nom_lml() const
{
  // static Nom nom="GOLGOTH24";
  static Nom nom="VOXEL8";
  if (dimension==3) nom="QUADRANGLE_3D";
  return nom;
}
 
 
/*! @brief Returns 1 if element "element" of the domain associated with this geometric element contains the point
 *
 * with coordinates specified by "pos". Returns 0 otherwise.
 *
 * @param pos Coordinates of the point to locate.
 * @param element Index of the domain element in which to search for the point.
 * @return 1 if the point belongs to element "element", 0 otherwise.
 */
template <typename _SIZE_>
int Quadrangle_VEF_32_64<_SIZE_>::contient(const ArrOfDouble& pos, int_t element) const
{
  assert(pos.size_array()==2);
  const Domaine_t& domaine=mon_dom.valeur();
  const Domaine_t& dom=domaine;
  int_t som0 = domaine.sommet_elem(element,0);
  int_t som1 = domaine.sommet_elem(element,1);
  int_t som2 = domaine.sommet_elem(element,2);
  int_t som3 = domaine.sommet_elem(element,3);
  // First check if the point is one of the quadrangle vertices
  if( (est_egal(dom.coord(som0,0),pos[0]) && est_egal(dom.coord(som0,1),pos[1]))
      || (est_egal(dom.coord(som1,0),pos[0]) && est_egal(dom.coord(som1,1),pos[1]))
      || (est_egal(dom.coord(som2,0),pos[0]) && est_egal(dom.coord(som2,1),pos[1]))
      || (est_egal(dom.coord(som3,0),pos[0]) && est_egal(dom.coord(som3,1),pos[1])) )
    return 1;
  double prod,p0,p1,p2,p3;
  // Compute prod = 01 cross product 02 along z
  prod = (dom.coord(som1,0)-dom.coord(som0,0))*(dom.coord(som2,1)-dom.coord(som0,1))
         - (dom.coord(som1,1)-dom.coord(som0,1))*(dom.coord(som2,0)-dom.coord(som0,0));
  double signe;
  if (prod >= 0)
    signe = 1;
  else
    signe = -1;
  // Compute p0 = 0M cross product 1M along z
  p0 = (pos[0]-dom.coord(som0,0))*(pos[1]-dom.coord(som1,1))
       - (pos[1]-dom.coord(som0,1))*(pos[0]-dom.coord(som1,0));
  p0 *= signe;
  // Compute p1 = 1M cross product 3M along z
  p1 = (pos[0]-dom.coord(som1,0))*(pos[1]-dom.coord(som3,1))
       - (pos[1]-dom.coord(som1,1))*(pos[0]-dom.coord(som3,0));
  p1 *= signe;
  // Compute p2 = 3M cross product 2M along z
  p2 = (pos[0]-dom.coord(som3,0))*(pos[1]-dom.coord(som2,1))
       - (pos[1]-dom.coord(som3,1))*(pos[0]-dom.coord(som2,0));
  p2 *= signe;
  // Compute p3 = 2M cross product 0M along z
  p3 = (pos[0]-dom.coord(som2,0))*(pos[1]-dom.coord(som0,1))
       - (pos[1]-dom.coord(som2,1))*(pos[0]-dom.coord(som0,0));
  p3 *= signe;
  double epsilon=std::fabs(prod)*Objet_U::precision_geom;
  if ((p0>-epsilon) && (p1>-epsilon) && (p2>-epsilon) && (p3>-epsilon))
    return 1;
  else
    return 0;
}
 
 
/*! @brief Returns 1 if the vertices specified by parameter "som" are the vertices of element "element"
 *
 * in the domain associated with this geometric element. Returns 0 otherwise.
 *
 * @param som Vertex indices to compare with those of element "element".
 * @param element Index of the domain element whose vertices are to be compared.
 * @return 1 if the specified vertices are those of the given element, 0 otherwise.
 */
template <typename _SIZE_>
int Quadrangle_VEF_32_64<_SIZE_>::contient(const SmallArrOfTID_t& som, int_t element ) const
{
  const Domaine_t& domaine=mon_dom.valeur();
  if((domaine.sommet_elem(element,0)==som[0])&&
      (domaine.sommet_elem(element,1)==som[1])&&
      (domaine.sommet_elem(element,2)==som[2])&&
      (domaine.sommet_elem(element,3)==som[3]))
    return 1;
  else
    return 0;
}
 
/*! @brief Computes the volumes of the elements of the associated domain.
 *
 * @param volumes Vector to fill with the volumes of domain elements.
 */
template <typename _SIZE_>
void Quadrangle_VEF_32_64<_SIZE_>::calculer_volumes(DoubleVect_t& volumes) const
{
  const Domaine_t& domaine = mon_dom.valeur();
  const DoubleTab_t& coord = domaine.coord_sommets();
  const int_t size_tot = domaine.nb_elem_tot();
  assert(volumes.size_totale() == size_tot);
 
  for (int_t num_poly = 0; num_poly < size_tot; num_poly++)
    {
      const int_t S0 = domaine.sommet_elem(num_poly,0);
      const int_t S1 = domaine.sommet_elem(num_poly,1);
      const int_t S2 = domaine.sommet_elem(num_poly,2);
      const int_t S3 = domaine.sommet_elem(num_poly,3);
      const int_t S[4] = { S0, S1, S2, S3 };
 
      // TRUST quadrangle local numbering is "butterfly-shaped": 0-1-2-3.
      // The boundary (CCW) order is 0-1-3-2; use this for the shoelace formula.
      static const int ord[4] = {0, 1, 3, 2};
 
      const auto index_of = [&](int i) -> int_t { return S[ ord[i] ]; };
      const Polygon_geom_data geom = compute_polygon_geom(coord, dimension, 4, index_of, Objet_U::bidim_axi);
 
      if (!Objet_U::bidim_axi)
        volumes[num_poly] = geom.area_;
      else
        volumes[num_poly] = 2.0 * M_PI * std::fabs(geom.moment_r_);
    }
}
 
 
/*! @brief Reorders the vertices of the quadrangle elements.
 */
template <typename _SIZE_>
void Quadrangle_VEF_32_64<_SIZE_>::reordonner()
{
  Domaine_t& domaine=mon_dom.valeur();
  IntTab_t& elem=domaine.les_elems();
 
  SmallArrOfTID_t S(4);
  //ArrOfInt NS(4);
  //DoubleTab co(4,2);
  int_t num_poly;
  const int_t nb_elem=domaine.nb_elem();
  for (num_poly=0; num_poly<nb_elem; num_poly++)
    {
      for(int i=0; i<4; i++)
        S[i] = elem(num_poly,i);
 
      // adapted from Hexaedre_VEF::reordonne
 
      const DoubleTab_t& coord=domaine.les_sommets();
      DoubleTab v(3,3);
      for (int i=1; i<4; i++)
        for (int dir=0; dir<2; dir++)
          v(i-1,dir)=coord(S[i],dir)-coord(S[0],dir);
      ArrOfDouble prod_(3);
      int opp=-1;
      for (int op=0; op<3; op++)
        {
          DoubleTab prod_v(3,3);
          for (int i=0; i<3; i++)
            {
              //  prod_v(i,0)=v(op,1)*v(i,2)-v(op,2)*v(i,1);
              //prod_v(i,1)=v(op,2)*v(i,0)-v(op,0)*v(i,2);
              prod_v(i,2)=v(op,0)*v(i,1)-v(op,1)*v(i,0);
            }
          //Cerr<<prod_v<<finl;
          double prod=0;
          int i1=-1,i2=-1;
          if (op==0)
            {
              i1=1;
              i2=2;
            }
          else if (op==1)
            {
              i1=0;
              i2=2;
            }
          else if (op==2)
            {
              i1=0;
              i2=1;
            }
          for (int dir=0; dir<3; dir++)
            prod+=(prod_v(i1,dir)*prod_v(i2,dir));
          prod_[op]=prod;
          if (prod<0)
            {
              if (opp!=-1)
                {
                  op=2;
                  // two negative products: do nothing
                }
              opp=op;
 
            }
        }
      if (opp!=2)
        {
          int i2=2;
          int i1=1;
          int i3=3;
          int i2b=i2;
          if (opp==0) i2b=i1;
          int_t tmp=elem(num_poly,i2b);
          elem(num_poly,i2b)=elem(num_poly,i3);
          elem(num_poly,i3)=tmp;
          Cerr << "Permutation of local nodes "<<i2b<<" and "<<i3<<" on the element " <<num_poly<<" prod "<<prod_<<finl;
        }
 
    }
}
 
/*! @brief See ElemGeomBase::get_tab_faces_sommets_locaux.
 *
 */
template <typename _SIZE_>
int Quadrangle_VEF_32_64<_SIZE_>::get_tab_faces_sommets_locaux(IntTab& faces_som_local) const
{
  faces_som_local.resize(4,2);
  for (int i=0; i<4; i++)
    for (int j=0; j<2; j++)
      faces_som_local(i,j) = faces_sommets_quadra[i][j];
  return 1;
}
 
 
template class Quadrangle_VEF_32_64<int>;
#if INT_is_64_ == 2
template class Quadrangle_VEF_32_64<trustIdType>;
#endif