1 // Copyright (C) 2007-2012 CEA/DEN, EDF R&D
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.
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.
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
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
19 // Author : Anthony Geay (CEA/DEN)
21 #ifndef __INTERPKERNELGEO2DEDGEARCCIRCLE_HXX__
22 #define __INTERPKERNELGEO2DEDGEARCCIRCLE_HXX__
24 #include "INTERPKERNELDefines.hxx"
25 #include "InterpKernelGeo2DEdge.hxx"
27 namespace INTERP_KERNEL
29 class INTERPKERNEL_EXPORT ArcCArcCIntersector : public SameTypeEdgeIntersector
32 ArcCArcCIntersector(const EdgeArcCircle& e1, const EdgeArcCircle& e2);
33 bool haveTheySameDirection() const;
34 void getPlacements(Node *start, Node *end, TypeOfLocInEdge& whereStart, TypeOfLocInEdge& whereEnd, MergePoints& commonNode) const;
35 void areOverlappedOrOnlyColinears(const Bounds *whereToFind, bool& obviousNoIntersection, bool& areOverlapped);
36 std::list< IntersectElement > getIntersectionsCharacteristicVal() const;
38 //! return angle in ]-Pi;Pi[ - 'node' must be on curve of '_e1'
39 double getAngle(Node *node) const;
40 static bool areArcsOverlapped(const EdgeArcCircle& a1, const EdgeArcCircle& a2);
42 const EdgeArcCircle& getE1() const { return (const EdgeArcCircle&)_e1; }
43 const EdgeArcCircle& getE2() const { return (const EdgeArcCircle&)_e2; }
48 class INTERPKERNEL_EXPORT ArcCSegIntersector : public CrossTypeEdgeIntersector
51 ArcCSegIntersector(const EdgeArcCircle& e1, const EdgeLin& e2, bool reverse=true);
53 void getPlacements(Node *start, Node *end, TypeOfLocInEdge& whereStart, TypeOfLocInEdge& whereEnd, MergePoints& commonNode) const;
54 void areOverlappedOrOnlyColinears(const Bounds *whereToFind, bool& obviousNoIntersection, bool& areOverlapped);
55 std::list< IntersectElement > getIntersectionsCharacteristicVal() const;
57 const EdgeArcCircle& getE1() const { return (const EdgeArcCircle&)_e1; }
58 const EdgeLin& getE2() const { return (const EdgeLin&)_e2; }
67 class INTERPKERNEL_EXPORT EdgeArcCircle : public Edge
70 EdgeArcCircle(std::istream& lineInXfig);
71 EdgeArcCircle(Node *start, Node *middle, Node *end, bool direction = true);
72 EdgeArcCircle(double sX, double sY, double mX, double mY, double eX, double eY);
73 EdgeArcCircle(Node *start, Node *end, const double *center, double radius, double angle0, double deltaAngle, bool direction=true);
75 void changeMiddle(Node *newMiddle);
76 void dumpInXfigFile(std::ostream& stream, bool direction, int resolution, const Bounds& box) const;
78 double getAreaOfZone() const;
79 double getCurveLength() const;
80 void getBarycenter(double *bary) const;
81 void getBarycenterOfZone(double *bary) const;
82 bool isIn(double characterVal) const;
83 Node *buildRepresentantOfMySelf() const;
84 bool isLower(double val1, double val2) const;
85 double getCharactValue(const Node& node) const;
86 double getCharactValueBtw0And1(const Node& node) const;
87 double getDistanceToPoint(const double *pt) const;
88 bool isNodeLyingOn(const double *coordOfNode) const;
89 TypeOfFunction getTypeOfFunc() const { return ARC_CIRCLE; }
90 void dynCastFunction(const EdgeLin * &seg,
91 const EdgeArcCircle * &arcSeg) const { arcSeg=this; }
92 const double *getCenter() const { return _center; }
93 void getCenter(double *center) const { center[0]=_center[0]; center[1]=_center[1]; }
94 bool doIHaveSameDirectionAs(const Edge& other) const { return false; }
95 void applySimilarity(double xBary, double yBary, double dimChar);
96 void unApplySimilarity(double xBary, double yBary, double dimChar);
97 double getAngle0() const { return _angle0; }
98 double getRadius() const { return _radius; }
99 double getAngle() const { return _angle; }
100 void tesselate(const int *conn, int offset, double eps, std::vector<int>& newConn, std::vector<double>& addCoo) const;
101 static EdgeArcCircle *BuildFromNodes(Node *start, Node *middle, Node *end);
102 static double GetAbsoluteAngle(const double *vect, double& normVect);
103 static double GetAbsoluteAngleOfNormalizedVect(double ux, double uy);
104 static void GetArcOfCirclePassingThru(const double *start, const double *middle, const double *end,
105 double *center, double& radius, double& angleInRad, double& angleInRad0);
106 //! To avoid in aggressive optimizations nan.
107 static double SafeSqrt(double val) { double ret=std::max(val,0.); return sqrt(ret); }
108 static double SafeAcos(double cosAngle) { double ret=std::min(cosAngle,1.); ret=std::max(ret,-1.); return acos(ret); }
109 static double SafeAsin(double sinAngle) { double ret=std::min(sinAngle,1.); ret=std::max(ret,-1.); return asin(ret); }
110 //! @param start and @param angleIn in ]-Pi;Pi] and @param delta in ]-2*Pi,2*Pi[
111 static bool IsIn2Pi(double start, double delta, double angleIn);
112 //! 'delta' 'start' in ]-Pi;Pi[
113 static bool IsAngleNotIn(double start, double delta, double angleIn);
114 //! for an angle 'angle' in ]-3*Pi;3*Pi[ returns angle in ]-Pi;Pi[
115 static double NormalizeAngle(double angle) { if(angle>M_PI) return angle-2.*M_PI; if(angle<-M_PI) return angle+2.*M_PI; return angle; }
118 Edge *buildEdgeLyingOnMe(Node *start, Node *end, bool direction=true) const;
119 void fillGlobalInfoAbs(bool direction, const std::map<INTERP_KERNEL::Node *,int>& mapThis, const std::map<INTERP_KERNEL::Node *,int>& mapOther, int offset1, int offset2, double fact, double baryX, double baryY,
120 std::vector<int>& edgesThis, std::vector<double>& addCoo, std::map<INTERP_KERNEL::Node *,int> mapAddCoo) const;
121 void fillGlobalInfoAbs2(const std::map<INTERP_KERNEL::Node *,int>& mapThis, const std::map<INTERP_KERNEL::Node *,int>& mapOther, int offset1, int offset2, double fact, double baryX, double baryY,
122 std::vector<int>& edgesOther, std::vector<double>& addCoo, std::map<INTERP_KERNEL::Node *,int>& mapAddCoo) const;
124 //!Value between -2Pi and 2Pi
126 //!Value between -Pi and Pi