Skip to content
Snippets Groups Projects
Select Git revision
  • ef83848c5821f68f049929795df615f2c57e8e22
  • master default protected
  • pluginMeshQuality
  • fixBugsAmaury
  • hierarchical-basis
  • alphashapes
  • bl
  • 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
  • convert_fdivs
  • tmp_jcjc24
  • 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

MLine.cpp

Blame
  • MLine.cpp 4.01 KiB
    // Gmsh - Copyright (C) 1997-2019 C. Geuzaine, J.-F. Remacle
    //
    // See the LICENSE.txt file for license information. Please report all
    // issues on https://gitlab.onelab.info/gmsh/gmsh/issues.
    
    #include "GmshDefines.h"
    #include "MLine.h"
    #include "nodalBasis.h"
    #include "BasisFactory.h"
    #include "GaussLegendre1D.h"
    #include "Context.h"
    #include "decasteljau.h"
    #include "bezierBasis.h"
    
    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(); }
    
    int MLine3::getNumEdgesRep(bool curved)
    {
      return curved ? CTX::instance()->mesh.numSubEdges : 1;
    }
    
    void MLine3::getEdgeRep(bool curved, int num, double *x, double *y, double *z,
                            SVector3 *n)
    {
      if(curved) {
        int numSubEdges = CTX::instance()->mesh.numSubEdges;
        SPoint3 pnt1, pnt2;
        pnt(-1. + 2 * (double)num / numSubEdges, 0., 0., pnt1);
        pnt(-1. + 2 * (double)(num + 1) / numSubEdges, 0., 0, pnt2);
        x[0] = pnt1.x();
        x[1] = pnt2.x();
        y[0] = pnt1.y();
        y[1] = pnt2.y();
        z[0] = pnt1.z();
        z[1] = pnt2.z();
        n[0] = n[1] = MEdge(_v[0], _v[1]).normal();
      }
      else
        MLine::getEdgeRep(false, num, x, y, z, n);
    }
    
    int MLineN::getNumEdgesRep(bool curved)
    {
      return curved ? CTX::instance()->mesh.numSubEdges : 1;
    }
    
    void MLineN::getEdgeRep(bool curved, int num, double *x, double *y, double *z,
                            SVector3 *n)
    {
      if(curved) {
        int numSubEdges = CTX::instance()->mesh.numSubEdges;
        SPoint3 pnt1, pnt2;
        pnt(-1. + 2 * (double)num / numSubEdges, 0., 0., pnt1);
        pnt(-1. + 2 * (double)(num + 1) / numSubEdges, 0., 0, pnt2);
        x[0] = pnt1.x();
        x[1] = pnt2.x();
        y[0] = pnt1.y();
        y[1] = pnt2.y();
        z[0] = pnt1.z();
        z[1] = pnt2.z();