Skip to content
Snippets Groups Projects
Select Git revision
  • 4bfa7c0dd0c8773576b100ca892b4782465d5f96
  • 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

Probe.cpp

Blame
  • GEdgeLoop.cpp 4.50 KiB
    // Gmsh - Copyright (C) 1997-2016 C. Geuzaine, J.-F. Remacle
    //
    // See the LICENSE.txt file for license information. Please report all
    // bugs and problems to the public mailing list <gmsh@onelab.info>.
    
    #include <algorithm>
    #include <functional>
    #include "GEdgeLoop.h"
    #include "GmshMessage.h"
    
    void GEdgeSigned::print() const
    {
      Msg::Info("GEdgeSigned : Edge %d sign %d Ordered Vertices %d,%d",
                ge->tag(), _sign, getBeginVertex()->tag(), getEndVertex()->tag());
    }
    
    int countInList(std::list<GEdge*> &wire, GEdge *ge)
    {
      std::list<GEdge*>::iterator it = wire.begin();
      std::list<GEdge*>::iterator ite = wire.end();
      int count = 0;
      while(it != ite){
        if(*it == ge) count++;
        ++it;
      }
      return count;
    }
    
    GEdgeSigned nextOne(GEdgeSigned *thisOne, std::list<GEdge*> &wire)
    {
      if(!thisOne){
        GEdge *ge = *(wire.begin());
        wire.erase(wire.begin());
        return GEdgeSigned(1, ge);
      }
    
      GVertex *gv = thisOne->getEndVertex();
    
      std::list<GEdge*> possibleChoices;
    
      std::list<GEdge*>::iterator it = wire.begin();
      std::list<GEdge*>::iterator ite = wire.end();
      while(it != ite){
        GEdge *ge = *it;
        GVertex *v1 = ge->getBeginVertex();
        GVertex *v2 = ge->getEndVertex();
        if(v1 == gv || v2 == gv) possibleChoices.push_back(ge);
        ++it;
      }
      it = possibleChoices.begin();
      ite = possibleChoices.end();
      while(it != ite){
        GEdge *ge = *it;
        if(countInList(possibleChoices, ge) == 2){
          wire.erase(std::remove_if(wire.begin(), wire.end(),
                                    std::bind2nd(std::equal_to<GEdge*>(), ge)),
                     wire.end());
          wire.push_back(ge);
          GVertex *v1 = ge->getBeginVertex();
          GVertex *v2 = ge->getEndVertex();
          if(v1 == gv) return GEdgeSigned(1, ge);
          if(v2 == gv) return GEdgeSigned(-1, ge);
          Msg::Error("Something wrong in edge loop 1");
          thisOne->print();
        }
        ++it;
      }
      it = possibleChoices.begin();
      ite = possibleChoices.end();
      while(it != ite){
        GEdge *ge = *it;
        if(ge != thisOne->ge){
          wire.erase(std::remove_if(wire.begin(),wire.end(),
                                    std::bind2nd(std::equal_to<GEdge*>(), ge)),
                     wire.end());
          GVertex *v1 = ge->getBeginVertex();
          GVertex *v2 = ge->getEndVertex();
          if(v1 == gv) return GEdgeSigned(1, ge);
          if(v2 == gv) return GEdgeSigned(-1, ge);
          Msg::Error("Something wrong in edge loop 2");
          thisOne->print();
        }
        ++it;
      }
    
      // should never end up here
      return GEdgeSigned(0, 0);
    }
    
    int GEdgeLoop::count(GEdge* ge) const
    {
      GEdgeLoop::citer it = begin();
      GEdgeLoop::citer ite = end();
      int count = 0;
      while(it != ite){
        if(it->ge == ge) count++;
        ++it;
      }
      return count;
    }
    
    static void loopTheLoop(std::list<GEdge*> &wire,
    			std::list<GEdgeSigned> &loop,
    			GEdge **degeneratedToInsert)
    {
      GEdgeSigned *prevOne = 0;
      GEdgeSigned ges(0,0);
    
      while(wire.size()){
        if (prevOne && (*degeneratedToInsert) &&
    	(*degeneratedToInsert)->getBeginVertex () == prevOne->getEndVertex()){
          ges = GEdgeSigned(1,*degeneratedToInsert);
          *degeneratedToInsert = 0;
          // printf("second degenerated edge inserted\n");
        }
        else ges = nextOne(prevOne, wire);
        if(ges.getSign() == 0){ // oops
          if (0){
    	Msg::Error("Something wrong in edge loop of size=%d, no sign !", wire.size());
    	for (std::list<GEdge* >::iterator it = wire.begin(); it != wire.end(); it++){
    	  Msg::Error("GEdge=%d begin=%d end =%d", (*it)->tag(),
    		     (*it)->getBeginVertex()->tag(), (*it)->getEndVertex()->tag());
    	}
          }
          break;
        }
        prevOne = &ges;
        // ges.print();
        loop.push_back(ges);
      }
    }
    
    
    GEdgeLoop::GEdgeLoop(const std::list<GEdge*> &cwire)
    {
      // Sometimes OCC puts a nasty degenerated edge in the middle of the
      // wire ...  pushing it to front fixes the problem as it concerns
      // gmsh
      std::list<GEdge*> wire;
      std::vector<GEdge*> degenerated;
      GEdge *degeneratedToInsert = 0;
      for (std::list<GEdge*>::const_iterator it = cwire.begin(); it != cwire.end(); ++it){
        GEdge *ed = *it;
        if (ed->degenerate(0))degenerated.push_back(ed);
        else wire.push_back(ed);
      }
    
      if (degenerated.size() == 1){
        wire.push_front(degenerated[0]);
      }
      else if (degenerated.size() == 2){
        degeneratedToInsert = degenerated[1];
        wire.push_front(degenerated[0]);
      }
      else if (degenerated.size() > 2){
        Msg::Error("More than two degenerated edges in one model face of an OCC model");
      }
    
      while (!wire.empty()){
        //    printf("wire.size = %d\n",wire.size());
        loopTheLoop(wire,loop,&degeneratedToInsert);
        //    break;
      }
    }