Skip to content
Snippets Groups Projects
Select Git revision
  • f55633bad0503ecf844c3a10072aaf1d9e92e2f8
  • master default protected
  • patches-4.14
  • steplayer
  • bl
  • pluginMeshQuality
  • fixBugsAmaury
  • hierarchical-basis
  • alphashapes
  • relaying
  • new_export_boris
  • oras_vs_osm
  • reassign_partitions
  • distributed_fwi
  • rename-classes
  • fix/fortran-api-example-t4
  • robust_partitions
  • reducing_files
  • fix_overlaps
  • 3115-issue-fix
  • 3023-Fillet2D-Update
  • gmsh_4_14_0
  • gmsh_4_13_1
  • gmsh_4_13_0
  • gmsh_4_12_2
  • gmsh_4_12_1
  • gmsh_4_12_0
  • gmsh_4_11_1
  • gmsh_4_11_0
  • gmsh_4_10_5
  • gmsh_4_10_4
  • gmsh_4_10_3
  • gmsh_4_10_2
  • gmsh_4_10_1
  • gmsh_4_10_0
  • gmsh_4_9_5
  • gmsh_4_9_4
  • gmsh_4_9_3
  • gmsh_4_9_2
  • gmsh_4_9_1
  • gmsh_4_9_0
41 results

MFace.cpp

Blame
  • MLine.cpp 2.10 KiB
    // Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
    //
    // See the LICENSE.txt file for license information. Please report all
    // bugs and problems to <gmsh@geuz.org>.
    
    #include "GmshDefines.h"
    #include "MLine.h"
    #include "GaussLegendre1D.h"
    #include "Context.h"
    #include "qualityMeasures.h"
    
    const polynomialBasis* MLine::getFunctionSpace(int o) const
    {
      int order = (o == -1) ? getPolynomialOrder() : o;
      
      switch (order) {
      case 0: return polynomialBases::find(MSH_LIN_1);
      case 1: return polynomialBases::find(MSH_LIN_2);
      case 2: return polynomialBases::find(MSH_LIN_3);
      case 3: return polynomialBases::find(MSH_LIN_4);
      case 4: return polynomialBases::find(MSH_LIN_5);
      case 5: return polynomialBases::find(MSH_LIN_6);
      case 6: return polynomialBases::find(MSH_LIN_7);
      case 7: return polynomialBases::find(MSH_LIN_8);
      case 8: return polynomialBases::find(MSH_LIN_9);
      case 9: return polynomialBases::find(MSH_LIN_10);
      case 10: return polynomialBases::find(MSH_LIN_11);
      default: Msg::Error("Order %d line function space not implemented", order);
      }
      return 0;
    }
    
    const JacobianBasis* MLine::getJacobianFuncSpace(int o) const
    {
      int order = (o == -1) ? getPolynomialOrder() : o;
      
      switch (order) {
      case 1: return JacobianBasis::find(MSH_LIN_2);
      case 2: return JacobianBasis::find(MSH_LIN_3);
      case 3: return JacobianBasis::find(MSH_LIN_4);
      case 4: return JacobianBasis::find(MSH_LIN_5);
      case 5: return JacobianBasis::find(MSH_LIN_6);
      case 6: return JacobianBasis::find(MSH_LIN_7);
      case 7: return JacobianBasis::find(MSH_LIN_8);
      case 8: return JacobianBasis::find(MSH_LIN_9);
      case 9: return JacobianBasis::find(MSH_LIN_10);
      case 10: return JacobianBasis::find(MSH_LIN_11);
      default: Msg::Error("Order %d line function space not implemented", order);
      }
      return 0;
    }
    
    void MLine::getIntegrationPoints(int pOrder, int *npts, IntPt **pts)
    {
      *npts = getNGQLPts(pOrder);
      *pts = getGQLPts(pOrder);
    }
    
    double MLine::getInnerRadius()
    {
      return _v[0]->distance(_v[1]) * .5;
    }
    
    double MLine::getLength()
    {
      return _v[0]->distance(_v[1]);
    }
    
    double MLine::getVolume()
    {
      return getLength();
    }