Trianguler_fin.cpp

/****************************************************************************
* Copyright (c) 2023, 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 <Trianguler_fin.h>
#include <Domaine.h>
 
Implemente_instanciable(Trianguler_fin, "Trianguler_fin", Triangulation_base);
// XD trianguler_fin triangulate trianguler_fin INHERITS_BRACE Trianguler_fin is the recommended option to triangulate
// XD_CONT rectangles. NL2 As an extension (subdivision) of Triangulate_h option, this one cut each initial rectangle in
// XD_CONT 8 triangles (against 4, previously). This cutting ensures : NL2 - a correct cutting in the corners (in
// XD_CONT respect to pressure discretization PreP1B). NL2 - a better isotropy of elements than with Trianguler_h
// XD_CONT option. NL2 - a better alignment of summits (this could have a benefit effect on calculation near walls since
// XD_CONT first elements in contact with it are all contained in the same constant thickness, and, by this way, a 2D
// XD_CONT cartesian grid based on summits can be engendered and used to realize statistical analysis in plane channel
// XD_CONT configuration for instance). Principle: NL2 \includeimage{{triangulerfin.jpeg}}
 
 
Sortie& Trianguler_fin::printOn(Sortie& os) const { return Interprete::printOn(os); }
 
Entree& Trianguler_fin::readOn(Entree& is) { return Interprete::readOn(is); }
 
/*! @brief Triangule tous les element d'un domaine: transforme les elements goemetriques du domaine en triangles.
 *
 *     Pour l'instant on ne sait trianguler que des Rectangles
 *     (on les coupe en 8).
 *
 * @param (Domaine& domaine) le domaine dont on veut trianguler les elements
 */
void Trianguler_fin::trianguler(Domaine& dom) const
{
  const DoubleTab& xs = dom.coord_sommets();
  IntTab& les_elems = dom.les_elems();
  int oldsz = les_elems.dimension(0);
  DoubleTab& sommets = dom.les_sommets();
  int nbs = sommets.dimension(0);
 
  {
    DoubleTab sommets_ajoutes(oldsz, dimension);
    dom.type_elem()->calculer_centres_gravite(sommets_ajoutes);
    sommets.resize(4 * nbs, dimension);
    for (int i = 0; i < oldsz; i++)
      for (int j = 0; j < dimension; j++)
        sommets(nbs + i, j) = sommets_ajoutes(i, j);
  }
 
  if ((dom.type_elem()->que_suis_je() == "Rectangle") || (dom.type_elem()->que_suis_je() == "Quadrangle"))
    {
      dom.typer("Triangle");
      IntTab new_elems(8 * oldsz, 3);
      IntTab fait_sommet_arete(4 * nbs, 3);
      fait_sommet_arete = -1;
      int j = 0;
 
      for (int i = 0; i < oldsz; i++)
        {
          int i0 = les_elems(i, 0);
          int i1 = les_elems(i, 1);
          int i2 = les_elems(i, 2);
          int i3 = les_elems(i, 3);
          int i01 = -1;
          int i02 = -1;
          int i13 = -1;
          int i23 = -1;
 
          for (int ii = 0; ii < j; ii++)
            {
              if (fait_sommet_arete(ii, 0) == i0 && fait_sommet_arete(ii, 1) == i1)
                i01 = nbs + oldsz + ii;
              if (fait_sommet_arete(ii, 0) == i0 && fait_sommet_arete(ii, 1) == i2)
                i02 = nbs + oldsz + ii;
              if (fait_sommet_arete(ii, 0) == i1 && fait_sommet_arete(ii, 1) == i3)
                i13 = nbs + oldsz + ii;
              if (fait_sommet_arete(ii, 0) == i2 && fait_sommet_arete(ii, 1) == i3)
                i23 = nbs + oldsz + ii;
            }
 
          if (i01 == -1)
            {
              fait_sommet_arete(j, 0) = i0;
              fait_sommet_arete(j, 1) = i1;
              i01 = nbs + oldsz + j;
              sommets(i01, 0) = 0.5 * (xs(i0, 0) + xs(i1, 0));
              sommets(i01, 1) = 0.5 * (xs(i0, 1) + xs(i1, 1));
              j++;
            }
 
          if (i02 == -1)
            {
              fait_sommet_arete(j, 0) = i0;
              fait_sommet_arete(j, 1) = i2;
              i02 = nbs + oldsz + j;
              sommets(i02, 0) = 0.5 * (xs(i0, 0) + xs(i2, 0));
              sommets(i02, 1) = 0.5 * (xs(i0, 1) + xs(i2, 1));
              j++;
            }
 
          if (i13 == -1)
            {
              fait_sommet_arete(j, 0) = i1;
              fait_sommet_arete(j, 1) = i3;
              i13 = nbs + oldsz + j;
              sommets(i13, 0) = 0.5 * (xs(i1, 0) + xs(i3, 0));
              sommets(i13, 1) = 0.5 * (xs(i1, 1) + xs(i3, 1));
              j++;
            }
 
          if (i23 == -1)
            {
              fait_sommet_arete(j, 0) = i2;
              fait_sommet_arete(j, 1) = i3;
              i23 = nbs + oldsz + j;
              sommets(i23, 0) = 0.5 * (xs(i2, 0) + xs(i3, 0));
              sommets(i23, 1) = 0.5 * (xs(i2, 1) + xs(i3, 1));
              j++;
            }
 
          new_elems(i, 0) = i + nbs;
          new_elems(i, 1) = i0;
          new_elems(i, 2) = i01;
 
          new_elems(i + oldsz, 0) = i + nbs;
          new_elems(i + oldsz, 1) = i01;
          new_elems(i + oldsz, 2) = i1;
          mettre_a_jour_sous_domaine(dom, i, i + oldsz, 1);
 
          new_elems(i + 2 * oldsz, 0) = i + nbs;
          new_elems(i + 2 * oldsz, 1) = i1;
          new_elems(i + 2 * oldsz, 2) = i13;
          mettre_a_jour_sous_domaine(dom, i, i + 2 * oldsz, 1);
 
          new_elems(i + 3 * oldsz, 0) = i + nbs;
          new_elems(i + 3 * oldsz, 1) = i13;
          new_elems(i + 3 * oldsz, 2) = i3;
          mettre_a_jour_sous_domaine(dom, i, i + 3 * oldsz, 1);
 
          new_elems(i + 4 * oldsz, 0) = i + nbs;
          new_elems(i + 4 * oldsz, 1) = i3;
          new_elems(i + 4 * oldsz, 2) = i23;
          mettre_a_jour_sous_domaine(dom, i, i + 4 * oldsz, 1);
 
          new_elems(i + 5 * oldsz, 0) = i + nbs;
          new_elems(i + 5 * oldsz, 1) = i23;
          new_elems(i + 5 * oldsz, 2) = i2;
          mettre_a_jour_sous_domaine(dom, i, i + 5 * oldsz, 1);
 
          new_elems(i + 6 * oldsz, 0) = i + nbs;
          new_elems(i + 6 * oldsz, 1) = i2;
          new_elems(i + 6 * oldsz, 2) = i02;
          mettre_a_jour_sous_domaine(dom, i, i + 6 * oldsz, 1);
 
          new_elems(i + 7 * oldsz, 0) = i + nbs;
          new_elems(i + 7 * oldsz, 1) = i02;
          new_elems(i + 7 * oldsz, 2) = i0;
          mettre_a_jour_sous_domaine(dom, i, i + 7 * oldsz, 1);
 
        }
 
      if (nbs + oldsz + j > 4 * nbs)
        {
          Cerr << " Review the sizing of sommets() in Trianguler_fin " << finl;
          exit();
        }
      sommets.resize(nbs + oldsz + j, dimension);
      les_elems.ref(new_elems);
 
      // Reconstruction de l'octree
      Cerr << "We have split the rectangles..." << finl;
      dom.invalide_octree();
      dom.typer("Triangle");
      Cerr << "  Reconstruction of the Octree" << finl;
      dom.construit_octree();
      Cerr << "  Octree rebuilt" << finl;
 
      Cerr << "Splitting of the boundaries" << finl;
      for (auto &itr : dom.faces_bord())
        {
          Faces& les_faces = itr.faces();
          les_faces.typer(Type_Face::segment_2D);
          IntTab& sommetsfaces = les_faces.les_sommets();
          int nb_faces = sommetsfaces.dimension(0);
          IntTab nouveaux(2 * nb_faces, 2);
          les_faces.voisins().resize(2 * nb_faces, 2);
          les_faces.voisins() = -1;
 
          for (int i = 0; i < nb_faces; i++)
            {
              int i0 = sommetsfaces(i, 0);
              int i1 = sommetsfaces(i, 1);
              int i01 = -1;
              for (int ii = 0; ii < nbs + oldsz + j; ii++)
                if (fait_sommet_arete(ii, 0) == i0 && fait_sommet_arete(ii, 1) == i1)
                  i01 = nbs + oldsz + ii;
              assert(i01 >= 0);
              nouveaux(2 * i, 0) = i0;
              nouveaux(2 * i, 1) = i01;
              nouveaux(2 * i + 1, 0) = i01;
              nouveaux(2 * i + 1, 1) = i1;
            }
          sommetsfaces.ref(nouveaux);
        }
 
      Cerr << "Splitting of the connectors" << finl;
      for (auto &itr : dom.faces_raccord())
        {
          Faces& les_faces = itr->faces();
          les_faces.typer(Type_Face::segment_2D);
          IntTab& sommetsfaces = les_faces.les_sommets();
          int nb_faces = sommetsfaces.dimension(0);
          IntTab nouveaux(2 * nb_faces, 2);
          les_faces.voisins().resize(2 * nb_faces, 2);
          les_faces.voisins() = -1;
 
          for (int i = 0; i < nb_faces; i++)
            {
              int i0 = sommetsfaces(i, 0);
              int i1 = sommetsfaces(i, 1);
              int i01 = -1;
              for (int ii = 0; ii < nbs + oldsz + j; ii++)
                if (fait_sommet_arete(ii, 0) == i0 && fait_sommet_arete(ii, 1) == i1)
                  i01 = nbs + oldsz + ii;
              assert(i01 >= 0);
              nouveaux(2 * i, 0) = i0;
              nouveaux(2 * i, 1) = i01;
              nouveaux(2 * i + 1, 0) = i01;
              nouveaux(2 * i + 1, 1) = i1;
            }
          sommetsfaces.ref(nouveaux);
        }
 
      Cerr << "Splitting of the internal boundary faces" << finl;
      for (auto &itr : dom.bords_int())
        {
          Faces& les_faces = itr.faces();
          les_faces.typer(Type_Face::segment_2D);
          IntTab& sommetsfaces = les_faces.les_sommets();
          int nb_faces = sommetsfaces.dimension(0);
          IntTab nouveaux(2 * nb_faces, 2);
          les_faces.voisins().resize(2 * nb_faces, 2);
          les_faces.voisins() = -1;
 
          for (int i = 0; i < nb_faces; i++)
            {
              int i0 = sommetsfaces(i, 0);
              int i1 = sommetsfaces(i, 1);
              int i01 = -1;
              for (int ii = 0; ii < nbs + oldsz + j; ii++)
                if (fait_sommet_arete(ii, 0) == i0 && fait_sommet_arete(ii, 1) == i1)
                  i01 = nbs + oldsz + ii;
              assert(i01 >= 0);
              nouveaux(2 * i, 0) = i0;
              nouveaux(2 * i, 1) = i01;
              nouveaux(2 * i + 1, 0) = i01;
              nouveaux(2 * i + 1, 1) = i1;
            }
          sommetsfaces.ref(nouveaux);
        }
 
      Cerr << "Splitting of the group of faces" << finl;
      for (auto &itr : dom.groupes_faces())
        {
          Faces& les_faces = itr.faces();
          les_faces.typer(Type_Face::segment_2D);
          IntTab& sommetsfaces = les_faces.les_sommets();
          int nb_faces = sommetsfaces.dimension(0);
          IntTab nouveaux(2 * nb_faces, 2);
          les_faces.voisins().resize(2 * nb_faces, 2);
          les_faces.voisins() = -1;
 
          for (int i = 0; i < nb_faces; i++)
            {
              int i0 = sommetsfaces(i, 0);
              int i1 = sommetsfaces(i, 1);
              int i01 = -1;
              for (int ii = 0; ii < nbs + oldsz + j; ii++)
                if (fait_sommet_arete(ii, 0) == i0 && fait_sommet_arete(ii, 1) == i1)
                  i01 = nbs + oldsz + ii;
              assert(i01 >= 0);
              nouveaux(2 * i, 0) = i0;
              nouveaux(2 * i, 1) = i01;
              nouveaux(2 * i + 1, 0) = i01;
              nouveaux(2 * i + 1, 1) = i1;
            }
          sommetsfaces.ref(nouveaux);
        }
    }
  else
    {
      Cerr << "We do not yet know how to Trianguler_fin the " << dom.type_elem()->que_suis_je() << "s" << finl;
      Process::exit();
    }
}