Interpolation_IBM_mean_gradient_proto.cpp

/****************************************************************************
* Copyright (c) 2026, 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 <Interpolation_IBM_mean_gradient_proto.h>
#include <TRUSTTrav.h>
#include <Domaine.h>
 
void Interpolation_IBM_mean_gradient_proto::computeSommetsVoisins(Domaine_dis_base& le_dom_,
                                                                  const Champ_Don_base& solid_points,
                                                                  const Champ_Don_base& corresp_elems,
                                                                  bool has_corres)
{
  int nb_som = le_dom_.nb_som();
  int nb_som_tot = le_dom_.nb_som_tot();
  int nb_elem = le_dom_.nb_elem();
  int nb_elem_tot = le_dom_.nb_elem_tot();
  int nb_som_elem = le_dom_.domaine().nb_som_elem();
  DoubleTab& elems_solid_ref = solid_elems_->valeurs();
  const IntTab& elems = le_dom_.domaine().les_elems();
  const DoubleTab& coordsDom = le_dom_.domaine().coord_sommets();
  const DoubleTab& solidPointsCoords = solid_points.valeurs();
 
  //Cerr << "nb_som_elem = " << nb_som_elem << finl;
 
  DoubleTab& is_dirichlet = my_is_dirichlet_->valeurs();
 
  // Create a nodal indicator identifying whether a node belongs to one or more elements
  // that are totally fluid (without immersed Dirichlet boundary nodes)
  DoubleTrav is_elem_fluide(nb_elem_tot);
  DoubleTrav is_node_voisin_elem_fluide(is_dirichlet);
  is_node_voisin_elem_fluide = 0.;
  for (int num_elem_tf = 0; num_elem_tf < nb_elem_tot; num_elem_tf++)
    {
      is_elem_fluide(num_elem_tf) = 1.;
      // Is this correct?
      for (int j_tf = 0; j_tf < nb_som_elem; j_tf++)
        {
          int num_som_tf = elems(num_elem_tf,j_tf);
          if ((num_som_tf < nb_som) && (is_dirichlet(num_som_tf) > 0.0)) is_elem_fluide(num_elem_tf) = 0.;
        }
      if (is_elem_fluide(num_elem_tf) == 1.)
        {
          for (int j_tf = 0; j_tf < nb_som_elem; j_tf++)
            {
              int num_som_tf = elems(num_elem_tf,j_tf);
              is_node_voisin_elem_fluide(num_som_tf) = 1.;
            }
        }
    }
 
  // Element numbering may have changed between the pre_pro step and
  // the calculation step (case of Salome pre_pro)
  // Use a label field for solid_elems_ (e.g. the Salome element number)
  // and an element field using these labels
  if (has_corres)
    {
      const DoubleTab& corresp_elemsref = corresp_elems.valeurs();
      int nb_tag_max = -1;
      for (int i = 0 ; i < nb_elem_tot ; i++)
        {
          int int_cor_elem = (int)lrint(corresp_elemsref(i));
          if (int_cor_elem > nb_tag_max) nb_tag_max = int_cor_elem;
        }
      int dimtag = nb_tag_max+1;
      DoubleTrav elems_solid_trust(dimtag);
      elems_solid_trust = -0.1*DMAXFLOAT;
      for (int i = 0 ; i < nb_elem_tot ; i++)
        {
          int indextag = (int)lrint(corresp_elemsref(i)) ;
          if (indextag < dimtag && indextag >= 0)
            {
              elems_solid_trust(indextag) = i*1.0;
            }
          else
            {
              Cerr<<"error in computeSommetsVoisins : elem corresp_elemsref(elem) = "<<i<<" "<<corresp_elemsref(i)<<" ; indextag = "<<indextag<<" < 0 or >= "<<dimtag<<finl;
              Process::exit();
            }
        }
      for (int i = 0 ; i < nb_som_tot ; i++)
        {
          if (elems_solid_ref(i) >= 0.0)
            {
              int indexr = (int)lrint(elems_solid_ref(i));
              if (indexr < dimtag && indexr >= 0)
                {
                  if (elems_solid_trust(indexr) >= 0.) elems_solid_ref(i) = elems_solid_trust(indexr);
                }
            }
        }
    }
 
  sommets_voisins_ = IntLists(nb_som);
  int nb_nodes_in_list = 0;
 
  for (int num_elem = 0; num_elem < nb_elem_tot; num_elem++)
    {
      for (int j = 0; j < nb_som_elem; j++)
        {
          int num_som = elems(num_elem,j);
          double x1 = coordsDom(num_som,0);
          double x2 = coordsDom(num_som,1);
          double x3 = coordsDom(num_som,2);
          double xp1 = solidPointsCoords(num_som,0);
          double xp2 = solidPointsCoords(num_som,1);
          double xp3 = solidPointsCoords(num_som,2);
 
          if ((num_som < nb_som) && (is_dirichlet(num_som) > 0.0))
            {
              for (int k = 0; k < nb_som_elem; k++)
                {
                  if (k != j)
                    {
                      int num_som_2 = elems(num_elem,k);
                      double xf1 = coordsDom(num_som_2,0);
                      double xf2 = coordsDom(num_som_2,1);
                      double xf3 = coordsDom(num_som_2,2);
                      double xpf1 = solidPointsCoords(num_som_2,0);
                      double xpf2 = solidPointsCoords(num_som_2,1);
                      double xpf3 = solidPointsCoords(num_som_2,2);
 
                      double d = (x1-xp1)*(xf1-xpf1)+(x2-xp2)*(xf2-xpf2)+(x3-xp3)*(xf3-xpf3);
                      double d1 = (xf1-xpf1)*(xf1-xpf1)+(xf2-xpf2)*(xf2-xpf2)+(xf3-xpf3)*(xf3-xpf3);
                      double d2 = (x1-xp1)*(x1-xp1)+(x2-xp2)*(x2-xp2)+(x3-xp3)*(x3-xp3);
 
                      // Requirements:
                      // *) the neighboring point must be of fluid type (not Dirichlet)
                      // *) the projection of the neighboring fluid point must be on the same side of the
                      //    immersed boundary as the considered Dirichlet point
                      // *) the fluid point projection must be in an element traversed by the
                      //    boundary (we use the immersed boundary velocity at this point)
                      // *) the projection of the neighboring fluid point must be at a squared distance d1 from
                      //    the immersed boundary greater than d2 of the considered Dirichlet point
                      //    (we interpolate; we do not extrapolate; distance criterion:
                      //    d1 = 2.0^2 times d2)
                      // *) the neighboring fluid point must belong to at least one fully fluid element
                      if (is_dirichlet(num_som_2) < 0.0 && d > 0.0 && (3.0*d2) < d1 && is_node_voisin_elem_fluide(num_som_2) == 1.0)
                        {
                          // Element containing the fluid point projection
                          int elems_xpf = (int)lrint(elems_solid_ref(num_som_2));
                          bool flag_xpf = true;
                          //bool flag_prt_nodes = false;
                          int elem_found = le_dom_.domaine().chercher_elements(xpf1,xpf2,xpf3);
                          if (elems_xpf >= 0)
                            {
                              // test de verification prepro Salome/Trust :
                              if ((elems_xpf != elem_found) && (elem_found != -1))
                                {
                                  Cerr << __FILE__ << (int)__LINE__ << "Interpolation_IBM_mean_gradient_proto::computeSommetsVoisins : WARNING : elem solid prepro " << elems_xpf << " != elem solid Trust " << elem_found << finl;
                                  flag_xpf = true;
                                  //flag_prt_nodes = true;
                                }
                            }
                          else
                            {
                              if (elems_xpf == -1.e+50)
                                {
                                  flag_xpf = false;
                                }
                              else if (elem_found != -1)
                                {
                                  Cerr<<"node_fluide = "<<num_som_2<<" we use chercher_elements(xpf,ypf,zpf) = "<<elem_found<<" to replace values from SALOME = "<<elems_xpf<<finl;
                                  Cerr<<"coords_point(node_fluide) : xf yf zf = "<<xf1<<" "<<xf2<<" "<<xf3<<finl;
                                  Cerr<<"solid_points(node_fluide) : xpf ypf zpf = "<<xpf1<<" "<<xpf2<<" "<<xpf3<<finl;
                                  elems_xpf = elem_found ;
                                }
                            }
                          if (!flag_xpf)
                            {
                              // Error handling
                              Cerr << __FILE__ << (int)__LINE__ << "Interpolation_IBM_mean_gradient_proto::computeSommetsVoisins : ERROR : joint width too low?" << finl;
                              Cerr<<"Nb elem; Nb elem tot = "<<nb_elem<<" "<<nb_elem_tot<<finl;
                              Cerr<<"Nb som;  Nb som tot  = "<<nb_som<<" "<<nb_som_tot<<finl;
                              Cerr<<"element; node_Dirichlet = "<<num_elem<<" "<<num_som<<finl;
                              Cerr<<"coords_point(node_Dirichlet) : x y z    = "<<x1<<" "<<x2<<" "<<x3<<finl;
                              Cerr<<"solid_points(node_Dirichlet) : xp yp zp = "<<xp1<<" "<<xp2<<" "<<xp3<<finl;
                              Cerr<<"node_fluide elems_solid_ref(node_fluide) elems_xpf = "<<num_som_2<<" "<<elems_solid_ref(num_som_2)<<" "<<elems_xpf<<finl;
                              Cerr<<"coords_point(node_fluide) : xf yf zf    = "<<xf1<<" "<<xf2<<" "<<xf3<<finl;
                              Cerr<<"solid_points(node_fluide) : xpf ypf zpf = "<<xpf1<<" "<<xpf2<<" "<<xpf3<<finl;
                              Cerr<<"chercher_elements(xpf,ypf,zpf) = "<<elem_found<<finl;
                              /*if (flag_prt_nodes)
                                {
                                  double x1kf = 0.0;
                                  double x2kf = 0.0;
                                  double x3kf = 0.0;
                                  double x1kf2 = 0.0;
                                  double x2kf2 = 0.0;
                                  double x3kf2 = 0.0;
                                  for (int kf = 0; kf < nb_som_elem; kf++)
                                    {
                                      int num_som_kf = elems(elems_xpf,kf);
                                      int num_som_kf2 = elems(elem_found,kf);
                                      x1kf += coordsDom(num_som_kf,0)/nb_som_elem;
                                      x2kf += coordsDom(num_som_kf,1)/nb_som_elem;
                                      x3kf += coordsDom(num_som_kf,2)/nb_som_elem;
                                      x1kf2 += coordsDom(num_som_kf2,0)/nb_som_elem;
                                      x2kf2 += coordsDom(num_som_kf2,1)/nb_som_elem;
                                      x3kf2 += coordsDom(num_som_kf2,2)/nb_som_elem;
                                      Cerr<<"x elems_solid_ref   = "<<coordsDom(num_som_kf,0)<<" "<<coordsDom(num_som_kf,1)<<" "<<coordsDom(num_som_kf,2)<<finl;
                                      Cerr<<"x chercher_elements = "<<coordsDom(num_som_kf2,0)<<" "<<coordsDom(num_som_kf2,1)<<" "<<coordsDom(num_som_kf2,2)<<finl;
                                    }
                                  Cerr<<"bary elems_solid_ref   = "<<x1kf<<" "<<x2kf<<" "<<x3kf<<finl;
                                  Cerr<<"bary chercher_elements = "<<x1kf2<<" "<<x2kf2<<" "<<x3kf2<<finl;
                                }*/
                              Process::exit();
                            }
                          // Require that the fluid point projection be in an element
                          // traversed by the boundary or bordered by elements traversed by the boundary
                          if (elems_xpf >= 0)
                            {
                              for (int kxpf = 0; kxpf < nb_som_elem; kxpf++)
                                {
                                  int num_som_2xpf = elems(elems_xpf,kxpf);
                                  if (is_dirichlet(num_som_2xpf) < 0.0) flag_xpf = false;
                                }
                              if (flag_xpf)
                                {
                                  sommets_voisins_[num_som].add_if_not(num_som_2);
                                  nb_nodes_in_list += 1;
                                }
                            }
                        }
                    }
                }
            }
        }
    }
  Cerr << __FILE__ << (int)__LINE__ << "Interpolation_IBM_mean_gradient_proto::computeSommetsVoisins : nb nodes for interpolation = " <<nb_nodes_in_list<<finl;
}