1 // Created on: 1992-01-02
2 // Created by: Remi GILET
3 // Copyright (c) 1992-1999 Matra Datavision
4 // Copyright (c) 1999-2014 OPEN CASCADE SAS
6 // This file is part of Open CASCADE Technology software library.
8 // This library is free software; you can redistribute it and/or modify it under
9 // the terms of the GNU Lesser General Public License version 2.1 as published
10 // by the Free Software Foundation, with special exception defined in the file
11 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
12 // distribution for complete text of the license and disclaimer of any warranty.
14 // Alternatively, this file may be used under the terms of Open CASCADE
15 // commercial license or contractual agreement.
19 #include <GccAna_Circ2d2TanOn.hxx>
20 #include <GccAna_Circ2dBisec.hxx>
21 #include <GccEnt_BadQualifier.hxx>
22 #include <GccEnt_QualifiedCirc.hxx>
23 #include <GccInt_BLine.hxx>
24 #include <GccInt_IType.hxx>
25 #include <gp_Ax2d.hxx>
26 #include <gp_Circ2d.hxx>
27 #include <gp_Dir2d.hxx>
28 #include <gp_Pnt2d.hxx>
29 #include <IntAna2d_AnaIntersection.hxx>
30 #include <IntAna2d_Conic.hxx>
31 #include <IntAna2d_IntPoint.hxx>
32 #include <TColStd_Array1OfReal.hxx>
34 //=========================================================================
35 // Creation of a circle tangent to two circles C1 and C2. +
36 // centered on a circle. +
37 // We start with distinguishing various boundary cases that will be +
38 // processed separately. +
39 // In the general case: +
40 // ==================== +
41 // We calculate bissectrices to C1 and C2 that give us all +
42 // possible locations of centers of all circles tangent to C1 and C2. +
43 // We intersect these bissectrices with circle OnCirc which gives us +
44 // points among which we choose the solutions. +
45 // The choice is made basing in Qualifiers of C1 and C2. +
46 //=========================================================================
48 GccAna_Circ2d2TanOn (const GccEnt_QualifiedCirc& Qualified1 ,
49 const GccEnt_QualifiedCirc& Qualified2 ,
50 const gp_Circ2d& OnCirc ,
51 const Standard_Real Tolerance ):
68 WellDone = Standard_False;
70 if (!(Qualified1.IsEnclosed() || Qualified1.IsEnclosing() ||
71 Qualified1.IsOutside() || Qualified1.IsUnqualified()) ||
72 !(Qualified2.IsEnclosed() || Qualified2.IsEnclosing() ||
73 Qualified2.IsOutside() || Qualified2.IsUnqualified())) {
74 throw GccEnt_BadQualifier();
77 Standard_Real Tol= Abs(Tolerance);
78 gp_Circ2d C1 = Qualified1.Qualified();
79 gp_Circ2d C2 = Qualified2.Qualified();
81 TColStd_Array1OfReal Radius(1,2);
82 TColStd_Array1OfReal Rradius(1,2);
83 gp_Pnt2d center1(C1.Location());
84 gp_Pnt2d center2(C2.Location());
86 Standard_Real R1 = C1.Radius();
87 Standard_Real R2 = C2.Radius();
89 //=========================================================================
90 // Processing of boundary cases. +
91 //=========================================================================
93 Standard_Integer nbsol1 = 1;
94 Standard_Integer nbsol2 = 0;
95 Standard_Real Ron = OnCirc.Radius();
96 Standard_Real distcco = OnCirc.Location().Distance(center1);
97 gp_Dir2d dircc(OnCirc.Location().XY()-center1.XY());
98 gp_Pnt2d pinterm(center1.XY()+(distcco-Ron)*dircc.XY());
99 Standard_Real distcc2 =pinterm.Distance(center2);
100 Standard_Real distcc1 =pinterm.Distance(center1);
101 Standard_Real d1 = Abs(distcc2-R2-Abs(distcc1-R1));
102 Standard_Real d2 = Abs(distcc2+R2-Abs(distcc1-R1));
103 Standard_Real d3 = Abs(distcc2-R2-(distcc1+R1));
104 Standard_Real d4 = Abs(distcc2+R2-(distcc1+R1));
105 if ( d1 > Tol || d2 > Tol || d3 > Tol || d4 > Tol) {
106 pinterm = gp_Pnt2d(center1.XY()+(distcco+Ron)*dircc.XY());
107 distcc2 =pinterm.Distance(center2);
108 distcc1 =pinterm.Distance(center1);
109 d1 = Abs(distcc2-R2-Abs(distcc1-R1));
110 d2 = Abs(distcc2+R2-Abs(distcc1-R1));
111 d3 = Abs(distcc2-R2-(distcc1+R1));
112 d4 = Abs(distcc2+R2-(distcc1+R1));
113 if ( d1 > Tol || d2 > Tol || d3 > Tol || d4 > Tol) { nbsol1 = 0; }
116 if (Qualified1.IsEnclosed() || Qualified1.IsOutside()) {
118 Radius(1) = Abs(distcc1-R1);
120 else if (Qualified1.IsEnclosing()) {
122 Radius(1) = R1+distcc1;
124 else if (Qualified1.IsUnqualified()) {
126 Radius(1) = Abs(distcc1-R1);
127 Radius(2) = R1+distcc1;
129 if (Qualified2.IsEnclosed() || Qualified2.IsOutside()) {
131 Rradius(1) = Abs(distcc2-R2);
133 else if (Qualified2.IsEnclosing()) {
135 Rradius(1) = R2+distcc2;
137 else if (Qualified2.IsUnqualified()) {
139 Rradius(1) = Abs(distcc2-R2);
140 Rradius(2) = R2+distcc2;
142 for (Standard_Integer i = 1 ; i <= nbsol1 ; i++) {
143 for (Standard_Integer j = 1 ; j <= nbsol2 ; j++) {
144 if (Abs(Radius(i)-Rradius(j)) <= Tol) {
145 WellDone = Standard_True;
147 cirsol(NbrSol) = gp_Circ2d(gp_Ax2d(pinterm,dirx),Radius(i));
148 // ===========================================================
149 gp_Dir2d dc1(center1.XY()-pinterm.XY());
150 gp_Dir2d dc2(center2.XY()-pinterm.XY());
151 distcc1 = pinterm.Distance(center1);
152 distcc2 = pinterm.Distance(center2);
153 if (!Qualified1.IsUnqualified()) {
154 qualifier1(NbrSol) = Qualified1.Qualifier();
156 else if (Abs(distcc1+Radius(i)-R1) < Tol) {
157 qualifier1(NbrSol) = GccEnt_enclosed;
159 else if (Abs(distcc1-R1-Radius(i)) < Tol) {
160 qualifier1(NbrSol) = GccEnt_outside;
162 else { qualifier1(NbrSol) = GccEnt_enclosing; }
163 if (!Qualified2.IsUnqualified()) {
164 qualifier2(NbrSol) = Qualified2.Qualifier();
166 else if (Abs(distcc2+Radius(i)-R2) < Tol) {
167 qualifier2(NbrSol) = GccEnt_enclosed;
169 else if (Abs(distcc2-R2-Radius(i)) < Tol) {
170 qualifier2(NbrSol) = GccEnt_outside;
172 else { qualifier2(NbrSol) = GccEnt_enclosing; }
173 pnttg1sol(NbrSol) = gp_Pnt2d(pinterm.XY()+Radius(i)*dc1.XY());
174 pnttg2sol(NbrSol) = gp_Pnt2d(pinterm.XY()+Radius(i)*dc2.XY());
175 pntcen(NbrSol) = cirsol(NbrSol).Location();
176 par1sol(NbrSol)=ElCLib::Parameter(cirsol(NbrSol),pnttg1sol(NbrSol));
177 pararg1(NbrSol)=ElCLib::Parameter(C1,pnttg1sol(NbrSol));
178 par2sol(NbrSol)=ElCLib::Parameter(cirsol(NbrSol),pnttg2sol(NbrSol));
179 pararg2(NbrSol)=ElCLib::Parameter(C2,pnttg2sol(NbrSol));
180 parcen3(NbrSol)=ElCLib::Parameter(OnCirc,pntcen(NbrSol));
184 if (WellDone) { return; }
187 //=========================================================================
189 //=========================================================================
191 GccAna_Circ2dBisec Bis(C1,C2);
193 TColStd_Array1OfReal Rbid(1,2);
194 TColStd_Array1OfReal RBid(1,2);
195 Standard_Integer nbsolution = Bis.NbSolutions();
196 for (Standard_Integer i = 1 ; i <= nbsolution ; i++) {
197 Handle(GccInt_Bisec) Sol = Bis.ThisSolution(i);
198 GccInt_IType typ = Sol->ArcType();
199 IntAna2d_AnaIntersection Intp;
200 if (typ == GccInt_Cir) {
201 Intp.Perform(OnCirc,Sol->Circle());
203 else if (typ == GccInt_Lin) {
204 Intp.Perform(Sol->Line(),OnCirc);
206 else if (typ == GccInt_Hpr) {
207 Intp.Perform(OnCirc,IntAna2d_Conic(Sol->Hyperbola()));
209 else if (typ == GccInt_Ell) {
210 Intp.Perform(OnCirc,IntAna2d_Conic(Sol->Ellipse()));
213 if ((!Intp.IsEmpty())&&(!Intp.ParallelElements())&&
214 (!Intp.IdenticalElements())) {
215 for (Standard_Integer j = 1 ; j <= Intp.NbPoints() ; j++) {
216 gp_Pnt2d Center(Intp.Point(j).Value());
217 Standard_Real dist1 = Center.Distance(center1);
218 Standard_Real dist2 = Center.Distance(center2);
219 Standard_Integer nbsol = 0;
220 Standard_Integer nsol = 0;
221 Standard_Integer nnsol = 0;
224 if (Qualified1.IsEnclosed()) {
225 if (dist1-R1 < Tol) {
227 Rbid(1) = Abs(R1-dist1);
230 else if (Qualified1.IsOutside()) {
231 if (R1-dist1 < Tol) {
233 Rbid(1) = Abs(dist1-R1);
236 else if (Qualified1.IsEnclosing()) {
240 else if (Qualified1.IsUnqualified()) {
243 Rbid(1) = Abs(dist1-R1);
245 if (Qualified2.IsEnclosed() && nbsol != 0) {
246 if (dist2-R2 < Tol) {
248 RBid(1) = Abs(R2-dist2);
251 else if (Qualified2.IsOutside() && nbsol != 0) {
252 if (R2-dist2 < Tol) {
254 RBid(1) = Abs(R2-dist2);
257 else if (Qualified2.IsEnclosing() && nbsol != 0) {
261 else if (Qualified2.IsUnqualified() && nbsol != 0) {
264 RBid(2) = Abs(R2-dist2);
266 for (Standard_Integer isol = 1; isol <= nbsol ; isol++) {
267 for (Standard_Integer jsol = 1; jsol <= nsol ; jsol++) {
268 if (Abs(Rbid(isol)-RBid(jsol)) <= Tol) {
270 Radius(nnsol) = (RBid(jsol)+Rbid(isol))/2.;
275 for (Standard_Integer k = 1 ; k <= nnsol ; k++) {
277 cirsol(NbrSol) = gp_Circ2d(gp_Ax2d(Center,dirx),Radius(k));
278 // ==========================================================
279 distcc1 = Center.Distance(center1);
280 distcc2 = Center.Distance(center2);
281 if (!Qualified1.IsUnqualified()) {
282 qualifier1(NbrSol) = Qualified1.Qualifier();
284 else if (Abs(distcc1+Radius(k)-R1) < Tol) {
285 qualifier1(NbrSol) = GccEnt_enclosed;
287 else if (Abs(distcc1-R1-Radius(k)) < Tol) {
288 qualifier1(NbrSol) = GccEnt_outside;
290 else { qualifier1(NbrSol) = GccEnt_enclosing; }
291 if (!Qualified2.IsUnqualified()) {
292 qualifier2(NbrSol) = Qualified2.Qualifier();
294 else if (Abs(distcc2+Radius(k)-R2) < Tol) {
295 qualifier2(NbrSol) = GccEnt_enclosed;
297 else if (Abs(distcc2-R2-Radius(k)) < Tol) {
298 qualifier2(NbrSol) = GccEnt_outside;
300 else { qualifier2(NbrSol) = GccEnt_enclosing; }
301 if (Center.Distance(center1) <= Tolerance &&
302 Abs(Radius(k)-C1.Radius()) <= Tolerance) {
303 TheSame1(NbrSol) = 1;
306 TheSame1(NbrSol) = 0;
307 gp_Dir2d dc1(center1.XY()-Center.XY());
308 pnttg1sol(NbrSol)=gp_Pnt2d(Center.XY()+Radius(k)*dc1.XY());
309 par1sol(NbrSol)=ElCLib::Parameter(cirsol(NbrSol),
311 pararg1(NbrSol)=ElCLib::Parameter(C1,pnttg1sol(NbrSol));
313 if (Center.Distance(center2) <= Tolerance &&
314 Abs(Radius(k)-C2.Radius()) <= Tolerance) {
315 TheSame2(NbrSol) = 1;
318 TheSame2(NbrSol) = 0;
319 gp_Dir2d dc2(center2.XY()-Center.XY());
320 pnttg2sol(NbrSol)=gp_Pnt2d(Center.XY()+Radius(k)*dc2.XY());
321 par2sol(NbrSol)=ElCLib::Parameter(cirsol(NbrSol),
323 pararg2(NbrSol)=ElCLib::Parameter(C2,pnttg2sol(NbrSol));
325 pntcen(NbrSol) = Center;
326 parcen3(NbrSol)=ElCLib::Parameter(OnCirc,pntcen(NbrSol));
331 WellDone = Standard_True;