1 // Created by: Eugeny MALTCHIKOV
2 // Copyright (c) 2013-2014 OPEN CASCADE SAS
4 // This file is part of Open CASCADE Technology software library.
6 // This library is free software; you can redistribute it and/or modify it under
7 // the terms of the GNU Lesser General Public License version 2.1 as published
8 // by the Free Software Foundation, with special exception defined in the file
9 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
10 // distribution for complete text of the license and disclaimer of any warranty.
12 // Alternatively, this file may be used under the terms of Open CASCADE
13 // commercial license or contractual agreement.
15 #ifndef _IntTools_EdgeEdge_HeaderFile
16 #define _IntTools_EdgeEdge_HeaderFile
18 #include <Standard.hxx>
19 #include <Standard_DefineAlloc.hxx>
20 #include <Standard_Handle.hxx>
22 #include <TopoDS_Edge.hxx>
23 #include <BRepAdaptor_Curve.hxx>
24 #include <Standard_Real.hxx>
25 #include <IntTools_Range.hxx>
26 #include <Standard_Boolean.hxx>
27 #include <Standard_Integer.hxx>
28 #include <IntTools_SequenceOfCommonPrts.hxx>
29 #include <IntTools_SequenceOfRanges.hxx>
30 #include <TopAbs_ShapeEnum.hxx>
35 class BRepAdaptor_Curve;
39 //! The class provides Edge/Edge intersection algorithm
40 //! based on the intersection between edges bounding boxes.
41 class IntTools_EdgeEdge
56 IntTools_EdgeEdge(const TopoDS_Edge& theEdge1, const TopoDS_Edge& theEdge2);
60 IntTools_EdgeEdge(const TopoDS_Edge& theEdge1, const Standard_Real aT11,
61 const Standard_Real aT12, const TopoDS_Edge& theEdge2,
62 const Standard_Real aT21, const Standard_Real aT22);
65 //! Sets the first edge
66 void SetEdge1(const TopoDS_Edge& theEdge);
69 //! Sets the first edge and its range
70 void SetEdge1(const TopoDS_Edge& theEdge, const Standard_Real aT1, const Standard_Real aT2);
73 //! Sets the range for the first edge
74 void SetRange1(const IntTools_Range& theRange1);
77 //! Sets the range for the first edge
78 void SetRange1(const Standard_Real aT1, const Standard_Real aT2);
81 //! Sets the second edge
82 void SetEdge2(const TopoDS_Edge& theEdge);
85 //! Sets the first edge and its range
86 void SetEdge2(const TopoDS_Edge& theEdge, const Standard_Real aT1, const Standard_Real aT2);
89 //! Sets the range for the second edge
90 void SetRange2(const IntTools_Range& theRange);
93 //! Sets the range for the second edge
94 void SetRange2(const Standard_Real aT1, const Standard_Real aT2);
97 //! Sets the Fuzzy value
98 void SetFuzzyValue (const Standard_Real theFuzz);
101 //! Performs the intersection between edges
102 Standard_EXPORT void Perform();
105 //! Returns TRUE if common part(s) is(are) found
106 Standard_Boolean IsDone() const;
109 //! Returns Fuzzy value
110 Standard_Real FuzzyValue() const;
113 //! Returns common parts
114 const IntTools_SequenceOfCommonPrts& CommonParts() const;
117 //! Sets the flag myQuickCoincidenceCheck
118 void UseQuickCoincidenceCheck (const Standard_Boolean bFlag) {
119 myQuickCoincidenceCheck=bFlag;
122 //! Returns the flag myQuickCoincidenceCheck
123 Standard_Boolean IsCoincidenceCheckedQuickly () {
124 return myQuickCoincidenceCheck;
135 //! Prepares the data
136 Standard_EXPORT void Prepare();
139 //! Computes Line/Line intersection.
140 Standard_EXPORT void ComputeLineLine();
143 //! Intermediate function
144 Standard_EXPORT void FindSolutions (IntTools_SequenceOfRanges& theRanges1,
145 IntTools_SequenceOfRanges& theRanges2, Standard_Boolean& bSplit2);
148 //! Looking for the exact intersection ranges
149 Standard_EXPORT void FindSolutions (
150 const IntTools_Range& theR1, const Bnd_Box& theBox1,
151 const IntTools_Range& theR2, const Bnd_Box& theBox2,
152 IntTools_SequenceOfRanges& theRanges1, IntTools_SequenceOfRanges& theRanges2);
155 //! Merges found solutions
156 Standard_EXPORT void MergeSolutions (const IntTools_SequenceOfRanges& theRanges1,
157 const IntTools_SequenceOfRanges& theRanges2, const Standard_Boolean bSplit2);
160 //! Looking for the range of the edge which is in the box
161 Standard_EXPORT static Standard_Boolean FindParameters(const BRepAdaptor_Curve& theBAC,
162 const Standard_Real aT1, const Standard_Real aT2, const Standard_Real theTol,
163 const Standard_Real theRes, const Standard_Real thePTol,
164 const Standard_Real theResCoeff, const Bnd_Box& theCBox,
165 Standard_Real& aTB1, Standard_Real& aTB2);
168 //! Checks if edges coincide on the ranges
169 Standard_EXPORT Standard_Integer CheckCoincidence (const Standard_Real aT11,
170 const Standard_Real aT12, const Standard_Real aT21, const Standard_Real aT22,
171 const Standard_Real theCriteria, const Standard_Real theCurveRes1);
174 //! Adds common part of the given type to myCommonParts
175 Standard_EXPORT void AddSolution (const Standard_Real aT11, const Standard_Real aT12,
176 const Standard_Real aT21, const Standard_Real aT22, const TopAbs_ShapeEnum theType);
179 //! Looking for the minimal distance between edges on the ranges
180 Standard_EXPORT void FindBestSolution (const Standard_Real aT11, const Standard_Real aT12,
181 const Standard_Real aT21, const Standard_Real aT22,
182 Standard_Real& aT1, Standard_Real& aT2);
185 //! Checks is there an intersection between edges on the given ranges
186 //! (for nearly conicident edges)
187 Standard_EXPORT Standard_Boolean IsIntersection (const Standard_Real aT11,
188 const Standard_Real aT12, const Standard_Real aT21, const Standard_Real aT22);
190 //! Checks if the edges are coincident really.
191 Standard_EXPORT Standard_Boolean IsCoincident();
195 Handle(Geom_Curve) myGeom1;
196 Handle(Geom_Curve) myGeom2;
197 BRepAdaptor_Curve myCurve1;
198 BRepAdaptor_Curve myCurve2;
199 Standard_Real myTol1;
200 Standard_Real myTol2;
202 Standard_Real myFuzzyValue;
203 Standard_Real myRes1;
204 Standard_Real myRes2;
205 Standard_Real myResCoeff1;
206 Standard_Real myResCoeff2;
207 Standard_Real myPTol1;
208 Standard_Real myPTol2;
209 IntTools_Range myRange1;
210 IntTools_Range myRange2;
211 Standard_Boolean mySwap;
212 Standard_Integer myErrorStatus;
213 IntTools_SequenceOfCommonPrts myCommonParts;
215 //! Allows avoiding use Edge-Edge intersection
216 //! algorithm (i.e. speeding up the Boolean algorithm)
217 //! if the edges are coincided really.
218 //! If it is not evidently set of this flag should
219 //! be avoided (otherwise, the performance of
220 //! Boolean algorithm will be slower).
221 Standard_Boolean myQuickCoincidenceCheck;
227 #include <IntTools_EdgeEdge.lxx>
229 #endif // _IntTools_EdgeEdge_HeaderFile