src/INTERP_KERNEL/Geometric2D/InterpKernelGeo2DQuadraticPolygon.hxx

   1 // Copyright (C) 2007-2013  CEA/DEN, EDF R&D
   2 //
   3 // This library is free software; you can redistribute it and/or
   4 // modify it under the terms of the GNU Lesser General Public
   5 // License as published by the Free Software Foundation; either
   6 // version 2.1 of the License.
   7 //
   8 // This library is distributed in the hope that it will be useful,
   9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  11 // Lesser General Public License for more details.
  12 //
  13 // You should have received a copy of the GNU Lesser General Public
  14 // License along with this library; if not, write to the Free Software
  15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
  16 //
  17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
  18 //
  19 // Author : Anthony Geay (CEA/DEN)
  20
  21 #ifndef __INTERPKERNELGEO2DQUADRATICPOLYGON_HXX__
  22 #define __INTERPKERNELGEO2DQUADRATICPOLYGON_HXX__
  23
  24 #include "INTERPKERNELDefines.hxx"
  25
  26 #include "InterpKernelGeo2DComposedEdge.hxx"
  27 #include "InterpKernelGeo2DAbstractEdge.hxx"
  28 #include "InterpKernelGeo2DElementaryEdge.hxx"
  29
  30 #include <list>
  31 #include <vector>
  32
  33 namespace INTERP_KERNEL
  34 {
  35   class Edge;
  36   class MergePoints;
  37
  38   /**
  39    * A set of quadratic or linear edges, not necessarily connected to form a closed polygon.
  40    * Some methods however requires a closed form.
  41    * Class ComposedEdge focuses more on connectivity aspect.
  42    */
  43   class QuadraticPolygon : public ComposedEdge
  44   {
  45   public:
  46     INTERPKERNEL_EXPORT QuadraticPolygon() { }
  47     INTERPKERNEL_EXPORT QuadraticPolygon(const QuadraticPolygon& other):ComposedEdge(other) { }
  48     INTERPKERNEL_EXPORT QuadraticPolygon(const char *fileName);
  49     INTERPKERNEL_EXPORT static QuadraticPolygon *BuildLinearPolygon(std::vector<Node *>& nodes, bool isClosed=true);
  50     INTERPKERNEL_EXPORT static QuadraticPolygon *BuildArcCirclePolygon(std::vector<Node *>& nodes, bool isClosed=true);
  51     INTERPKERNEL_EXPORT static void BuildDbgFile(const std::vector<Node *>& nodes, const char *fileName);
  52     INTERPKERNEL_EXPORT ~QuadraticPolygon();
  53     INTERPKERNEL_EXPORT void closeMe() const;
  54     INTERPKERNEL_EXPORT void circularPermute();
  55     INTERPKERNEL_EXPORT bool isButterflyAbs();
  56     INTERPKERNEL_EXPORT bool isButterfly() const;
  57     INTERPKERNEL_EXPORT void dumpInXfigFile(const char *fileName) const;
  58     INTERPKERNEL_EXPORT void dumpInXfigFileWithOther(const ComposedEdge& other, const char *fileName) const;
  59     //! Before intersecting as intersectWith a normalization is done.
  60     INTERPKERNEL_EXPORT double intersectWithAbs(QuadraticPolygon& other);
  61     INTERPKERNEL_EXPORT double intersectWithAbs1D(QuadraticPolygon& other, bool& isColinear);
  62     //! Before intersecting as intersectWith a normalization is done.
  63     INTERPKERNEL_EXPORT double intersectWithAbs(QuadraticPolygon& other, double* barycenter);
  64     INTERPKERNEL_EXPORT void splitAbs(QuadraticPolygon& other, const std::map<INTERP_KERNEL::Node *,int>& mapThis, const std::map<INTERP_KERNEL::Node *,int>& mapOther, int offset1, int offset2, const std::vector<int>& otherEdgeIds,
  65                                       std::vector<int>& edgesThis, int cellIdThis, std::vector< std::vector<int> >& edgesInOtherColinearWithThis, std::vector< std::vector<int> >& subDivOther, std::vector<double>& addCoo);
  66     INTERPKERNEL_EXPORT void buildFromCrudeDataArray(const std::map<int,INTERP_KERNEL::Node *>& mapp, bool isQuad, const int *nodalBg, const double *coords,
  67                                                      const int *descBg, const int *descEnd, const std::vector<std::vector<int> >& intersectEdges);
  68     INTERPKERNEL_EXPORT void buildFromCrudeDataArray2(const std::map<int,INTERP_KERNEL::Node *>& mapp, bool isQuad, const int *nodalBg, const double *coords, const int *descBg, const int *descEnd, const std::vector<std::vector<int> >& intersectEdges,
  69                                                       const INTERP_KERNEL::QuadraticPolygon& pol1, const int *descBg1, const int *descEnd1, const std::vector<std::vector<int> >& intersectEdges1,
  70                                                       const std::vector< std::vector<int> >& colinear1,
  71                                                       std::map<int,std::vector<INTERP_KERNEL::ElementaryEdge *> >& alreadyExistingIn2);
  72     INTERPKERNEL_EXPORT void updateLocOfEdgeFromCrudeDataArray2(const int *descBg, const int *descEnd, const std::vector<std::vector<int> >& intersectEdges, const INTERP_KERNEL::QuadraticPolygon& pol1, const int *descBg1, const int *descEnd1, const std::vector<std::vector<int> >& intersectEdges1, const std::vector< std::vector<int> >& colinear1) const;
  73     INTERPKERNEL_EXPORT void appendEdgeFromCrudeDataArray(std::size_t edgeId, const std::map<int,INTERP_KERNEL::Node *>& mapp, bool isQuad, const int *nodalBg, const double *coords,
  74                                                           const int *descBg,  const int *descEnd, const std::vector<std::vector<int> >& intersectEdges);
  75     INTERPKERNEL_EXPORT void appendSubEdgeFromCrudeDataArray(Edge *baseEdge, std::size_t j, bool direct, int edgeId, const std::vector<int>& subEdge, const std::map<int,INTERP_KERNEL::Node *>& mapp);
  76     INTERPKERNEL_EXPORT void appendCrudeData(const std::map<INTERP_KERNEL::Node *,int>& mapp, double xBary, double yBary, double fact, int offset, std::vector<double>& addCoordsQuadratic, std::vector<int>& conn, std::vector<int>& connI) const;
  77     INTERPKERNEL_EXPORT void buildPartitionsAbs(QuadraticPolygon& other, std::set<INTERP_KERNEL::Edge *>& edgesThis, std::set<INTERP_KERNEL::Edge *>& edgesBoundaryOther, const std::map<INTERP_KERNEL::Node *,int>& mapp, int idThis, int idOther, int offset,
  78                                                 std::vector<double>& addCoordsQuadratic, std::vector<int>& conn, std::vector<int>& connI, std::vector<int>& nb1, std::vector<int>& nb2);
  79     //
  80     INTERPKERNEL_EXPORT double intersectWith(const QuadraticPolygon& other) const;
  81     INTERPKERNEL_EXPORT double intersectWith(const QuadraticPolygon& other, double* barycenter) const;
  82     INTERPKERNEL_EXPORT std::vector<QuadraticPolygon *> intersectMySelfWith(const QuadraticPolygon& other) const;
  83     INTERPKERNEL_EXPORT void intersectForPerimeter(const QuadraticPolygon& other, double& perimeterThisPart, double& perimeterOtherPart, double& perimeterCommonPart) const;
  84     INTERPKERNEL_EXPORT void intersectForPerimeterAdvanced(const QuadraticPolygon& other, std::vector< double >& polThis, std::vector< double >& polOther) const;
  85     INTERPKERNEL_EXPORT void intersectForPoint(const QuadraticPolygon& other, std::vector< int >& numberOfCreatedPointsPerEdge) const;
  86   public://Only public for tests reasons
  87     INTERPKERNEL_EXPORT void performLocatingOperation(QuadraticPolygon& pol2) const;
  88     INTERPKERNEL_EXPORT void performLocatingOperationSlow(QuadraticPolygon& pol2) const;
  89     INTERPKERNEL_EXPORT static void SplitPolygonsEachOther(QuadraticPolygon& pol1, QuadraticPolygon& pol2, int& nbOfSplits);
  90     INTERPKERNEL_EXPORT std::vector<QuadraticPolygon *> buildIntersectionPolygons(const QuadraticPolygon& pol1, const QuadraticPolygon& pol2) const;
  91     INTERPKERNEL_EXPORT bool amIAChanceToBeCompletedBy(const QuadraticPolygon& pol1Splitted, const QuadraticPolygon& pol2NotSplitted, bool& direction);
  92     INTERPKERNEL_EXPORT static void ComputeResidual(const QuadraticPolygon& pol1, const std::set<Edge *>& notUsedInPol1, const std::set<Edge *>& edgesInPol2OnBoundary, const std::map<INTERP_KERNEL::Node *,int>& mapp, int offset, int idThis,
  93                                                     std::vector<double>& addCoordsQuadratic, std::vector<int>& conn, std::vector<int>& connI, std::vector<int>& nb1, std::vector<int>& nb2);
  94   protected:
  95     std::list<QuadraticPolygon *> zipConsecutiveInSegments() const;
  96     void dumpInXfigFile(std::ostream& stream, int resolution, const Bounds& box) const;
  97     void closePolygons(std::list<QuadraticPolygon *>& pol2Zip, const QuadraticPolygon& pol1, std::vector<QuadraticPolygon *>& results) const;
  98     template<class EDGES>
  99     static void UpdateNeighbours(const MergePoints& merger, IteratorOnComposedEdge it1, IteratorOnComposedEdge it2,
 100                                  const EDGES *e1, const EDGES *e2);
 101     std::list<QuadraticPolygon *>::iterator fillAsMuchAsPossibleWith(const QuadraticPolygon& pol1Splitted,
 102                                                                      std::list<QuadraticPolygon *>::iterator iStart,
 103                                                                      std::list<QuadraticPolygon *>::iterator iEnd,
 104                                                                      bool direction);
 105     static std::list<QuadraticPolygon *>::iterator CheckInList(Node *n, std::list<QuadraticPolygon *>::iterator iStart,
 106                                                                std::list<QuadraticPolygon *>::iterator iEnd);
 107   };
 108 }
 109
 110 namespace INTERP_KERNEL
 111 {
 112   template<class EDGES>
 113   void QuadraticPolygon::UpdateNeighbours(const MergePoints& merger, IteratorOnComposedEdge it1, IteratorOnComposedEdge it2,
 114                                           const EDGES *e1, const EDGES *e2)
 115   {
 116     it1.previousLoop(); it2.previousLoop();
 117     ElementaryEdge *curE1=it1.current(); ElementaryEdge *curE2=it2.current();
 118     curE1->changeEndNodeWith(e1->getStartNode()); curE2->changeEndNodeWith(e2->getStartNode());
 119     it1.nextLoop(); it1.nextLoop(); it2.nextLoop(); it2.nextLoop();
 120     curE1->changeStartNodeWith(e1->getEndNode()); curE2->changeStartNodeWith(e2->getEndNode());
 121   }
 122 }
 123
 124 #endif