[occt.git] / src / Geom2dGcc / Geom2dGcc_Circ2d2TanRad.cxx

// Created on: 1992-10-21
// Created by: Remi GILET
// Copyright (c) 1992-1999 Matra Datavision
// Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.


#include <GccAna_Circ2d2TanRad.hxx>
#include <GccEnt_BadQualifier.hxx>
#include <GccEnt_QualifiedCirc.hxx>
#include <GccEnt_QualifiedLin.hxx>
#include <Geom2d_Circle.hxx>
#include <Geom2d_Line.hxx>
#include <Geom2d_Point.hxx>
#include <Geom2dAdaptor_Curve.hxx>
#include <Geom2dGcc_Circ2d2TanRad.hxx>
#include <Geom2dGcc_Circ2d2TanRadGeo.hxx>
#include <Geom2dGcc_QCurve.hxx>
#include <Geom2dGcc_QualifiedCurve.hxx>
#include <gp_Circ2d.hxx>
#include <gp_Lin2d.hxx>
#include <gp_Pnt2d.hxx>
#include <Standard_NegativeValue.hxx>
#include <Standard_OutOfRange.hxx>
#include <StdFail_NotDone.hxx>

static const Standard_Integer aNbSolMAX = 16;

// circulaire tangent a deux cercles et de rayon donne
//====================================================
//========================================================================
// On initialise WellDone a false.                                       +
// On recupere le cercle C1 et le cercle C2.                             +
// On sort en erreur dans les cas ou la construction est impossible.     +
// On distingue les cas limites pour les triater separement.             +
// On fait la parallele a C1 dans le bon sens.                           +
// On fait la parallele a C2 dans le bon sens.                           +
// On intersecte les paralleles ==> point de centre de la solution.      +
// On cree la solution qu on ajoute aux solutions deja trouvees.         +
// On remplit les champs.                                                +
//========================================================================

Geom2dGcc_Circ2d2TanRad::
   Geom2dGcc_Circ2d2TanRad (const Geom2dGcc_QualifiedCurve& Qualified1 ,
			    const Geom2dGcc_QualifiedCurve& Qualified2 ,
			    const Standard_Real             Radius     ,
			    const Standard_Real             Tolerance  ):
  cirsol(1,aNbSolMAX)   ,
  qualifier1(1,aNbSolMAX),
  qualifier2(1,aNbSolMAX),
  TheSame1(1,aNbSolMAX) ,
  TheSame2(1,aNbSolMAX) ,
  pnttg1sol(1,aNbSolMAX),
  pnttg2sol(1,aNbSolMAX),
  par1sol(1,aNbSolMAX)  ,
  par2sol(1,aNbSolMAX)  ,
  pararg1(1,aNbSolMAX)  ,
  pararg2(1,aNbSolMAX)  
{
  if (Radius < 0.) { throw Standard_NegativeValue(); }
  else {
    Geom2dAdaptor_Curve C1 = Qualified1.Qualified();
    Geom2dAdaptor_Curve C2 = Qualified2.Qualified();
    Handle(Geom2d_Curve) CC1 = C1.Curve();
    Handle(Geom2d_Curve) CC2 = C2.Curve();
    GeomAbs_CurveType Type1 = C1.GetType();
    GeomAbs_CurveType Type2 = C2.GetType();

//=============================================================================
//                            Appel a GccAna.                                 +
//=============================================================================

    Invert = Standard_False;
    NbrSol = 0;
    if ((Type1 == GeomAbs_Line || Type1 == GeomAbs_Circle) &&
	(Type2 == GeomAbs_Line || Type2 == GeomAbs_Circle)) {
      if (Type1 == GeomAbs_Circle) {
	Handle(Geom2d_Circle) CCC1 = Handle(Geom2d_Circle)::DownCast(CC1);
	gp_Circ2d c1(CCC1->Circ2d());
	GccEnt_QualifiedCirc Qc1 = GccEnt_QualifiedCirc(c1,
						       Qualified1.Qualifier());
	if (Type2 == GeomAbs_Circle) {
	  Handle(Geom2d_Circle) CCC2 = Handle(Geom2d_Circle)::DownCast(CC2);
	  gp_Circ2d c2(CCC2->Circ2d());
	  GccAna_Circ2d2TanRad CircAna(Qc1,
			       GccEnt_QualifiedCirc(c2,Qualified2.Qualifier()),
				       Radius,Tolerance);
	  WellDone = CircAna.IsDone();
	  NbrSol = CircAna.NbSolutions();
	  for(Standard_Integer i=1; i<=NbrSol; i++) {
	    CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	  }
	  Results(CircAna);
	}
	else {
	  Handle(Geom2d_Line) LL2 = Handle(Geom2d_Line)::DownCast(CC2);
	  gp_Lin2d l2(LL2->Lin2d());
	  if (!Qualified2.IsEnclosing()) {
	    GccAna_Circ2d2TanRad CircAna(Qc1,
				GccEnt_QualifiedLin(l2,Qualified2.Qualifier()),
					 Radius,Tolerance);
	    WellDone = CircAna.IsDone();
	    NbrSol = CircAna.NbSolutions();
	    for(Standard_Integer i=1; i<=NbrSol; i++) {
	      CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	    }
	    Results(CircAna);
	  }
	  else { 
	    WellDone = Standard_False;
	    throw GccEnt_BadQualifier();
	  }
	}
      }
      else {
	Handle(Geom2d_Line) LL1 = Handle(Geom2d_Line)::DownCast(CC1);
	gp_Lin2d l1(LL1->Lin2d());
	if (Qualified1.IsEnclosing()) {
	  WellDone = Standard_False;
	  throw GccEnt_BadQualifier();
	}
	else {
	  GccEnt_QualifiedLin Ql1 = GccEnt_QualifiedLin(l1,
						       Qualified1.Qualifier());
	  if (Type2 == GeomAbs_Circle) {
	    Handle(Geom2d_Circle) CCC2 = Handle(Geom2d_Circle)::DownCast(CC2);
	    gp_Circ2d c2(CCC2->Circ2d());
	    Invert = Standard_True;
	    GccAna_Circ2d2TanRad CircAna(GccEnt_QualifiedCirc(c2,
						       Qualified2.Qualifier()),
					 Ql1,Radius,Tolerance);
	    WellDone = CircAna.IsDone();
	    NbrSol = CircAna.NbSolutions();
	    for(Standard_Integer i=1; i<=NbrSol; i++) {
	      CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	    }
	    Results(CircAna);
	  }
	  else {
	    Handle(Geom2d_Line) LL2 = Handle(Geom2d_Line)::DownCast(CC2);
	    gp_Lin2d l2(LL2->Lin2d());
	    if (!Qualified2.IsEnclosing()) {
	      GccAna_Circ2d2TanRad CircAna(Ql1,
				GccEnt_QualifiedLin(l2,Qualified2.Qualifier()),
					   Radius,Tolerance);
	      WellDone = CircAna.IsDone();
	      NbrSol = CircAna.NbSolutions();
	      for(Standard_Integer i=1; i<=NbrSol; i++) {
		CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	      }
	      Results(CircAna);
	    }
	    else { 
	      WellDone = Standard_False;
	      throw GccEnt_BadQualifier();
	    }
	  }
	}
      }
    }
//=============================================================================
//                            Appel a GccGeo.                                 +
//=============================================================================
    else {
      if (Type1 == GeomAbs_Line) {
	Handle(Geom2d_Line) LL1 = Handle(Geom2d_Line)::DownCast(CC1);
	gp_Lin2d l1(LL1->Lin2d());
	if (Qualified1.IsEnclosing()) {
	  WellDone = Standard_False;
	  throw GccEnt_BadQualifier();
	}
	else {
	  GccEnt_QualifiedLin Ql1 = GccEnt_QualifiedLin(l1,
						       Qualified1.Qualifier());
	  Geom2dGcc_QCurve Qc2(C2,Qualified2.Qualifier());
	  Geom2dGcc_Circ2d2TanRadGeo CircGeo(Ql1,Qc2,Radius,Tolerance);
	  WellDone = CircGeo.IsDone();
	  NbrSol = CircGeo.NbSolutions();
	  for(Standard_Integer i=1; i<=NbrSol; i++) {
	    CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	  }
	  Results(CircGeo);
	}
      }
      else if (Type1 == GeomAbs_Circle) {
	Handle(Geom2d_Circle) CCC1 = Handle(Geom2d_Circle)::DownCast(CC1);
	gp_Circ2d c1(CCC1->Circ2d());
	GccEnt_QualifiedCirc Qc1 = GccEnt_QualifiedCirc(c1,
						       Qualified1.Qualifier());
	Geom2dGcc_QCurve Qc2(C2,Qualified2.Qualifier());
	Geom2dGcc_Circ2d2TanRadGeo CircGeo(Qc1,Qc2,Radius,Tolerance);
	WellDone = CircGeo.IsDone();
	NbrSol = CircGeo.NbSolutions();
	for(Standard_Integer i=1; i<=NbrSol; i++) {
	  CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	}
	Results(CircGeo);
      }
      else if (Type2 == GeomAbs_Line) {
	Invert = Standard_True;
	Handle(Geom2d_Line) LL2 = Handle(Geom2d_Line)::DownCast(CC2);
	gp_Lin2d l2(LL2->Lin2d());
	if (Qualified2.IsEnclosing()) {
	  WellDone = Standard_False;
	  throw GccEnt_BadQualifier();
	}
	else {
	  GccEnt_QualifiedLin Ql2 = GccEnt_QualifiedLin(l2,
						       Qualified2.Qualifier());
	  Geom2dGcc_QCurve Qc1(C1,Qualified1.Qualifier());
	  Geom2dGcc_Circ2d2TanRadGeo CircGeo(Ql2,Qc1,Radius,Tolerance);
	  WellDone = CircGeo.IsDone();
	  NbrSol = CircGeo.NbSolutions();
	  for(Standard_Integer i=1; i<=NbrSol; i++) {
	    CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	  }
	  Results(CircGeo);
	}
      }
      else if (Type2 == GeomAbs_Circle) {
	Invert = Standard_True;
	Handle(Geom2d_Circle) CCC2 = Handle(Geom2d_Circle)::DownCast(CC2);
	gp_Circ2d c2(CCC2->Circ2d());
	GccEnt_QualifiedCirc Qc2 = GccEnt_QualifiedCirc(c2,
						       Qualified2.Qualifier());
	Geom2dGcc_QCurve Qc1(C1,Qualified1.Qualifier());
	Geom2dGcc_Circ2d2TanRadGeo CircGeo(Qc2,Qc1,Radius,Tolerance);
	WellDone = CircGeo.IsDone();
	NbrSol = CircGeo.NbSolutions();
	for(Standard_Integer i=1; i<=NbrSol; i++) {
	  CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	}
	Results(CircGeo);
      }
      else {
	Geom2dGcc_QCurve Qc1(C1,Qualified1.Qualifier());
	Geom2dGcc_QCurve Qc2(C2,Qualified2.Qualifier());
	Geom2dGcc_Circ2d2TanRadGeo CircGeo(Qc1,Qc2,Radius,Tolerance);
	WellDone = CircGeo.IsDone();
	NbrSol = CircGeo.NbSolutions();
	for(Standard_Integer i=1; i<=NbrSol; i++) {
	  CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	}
	Results(CircGeo);
      }
    }
  }
}

Geom2dGcc_Circ2d2TanRad::
   Geom2dGcc_Circ2d2TanRad (const Geom2dGcc_QualifiedCurve& Qualified1 ,
			    const Handle(Geom2d_Point)&     Point      ,
			    const Standard_Real             Radius     ,
			    const Standard_Real             Tolerance  ):
  cirsol(1,aNbSolMAX)   ,
  qualifier1(1,aNbSolMAX),
  qualifier2(1,aNbSolMAX),
  TheSame1(1,aNbSolMAX) ,
  TheSame2(1,aNbSolMAX) ,
  pnttg1sol(1,aNbSolMAX),
  pnttg2sol(1,aNbSolMAX),
  par1sol(1,aNbSolMAX)  ,
  par2sol(1,aNbSolMAX)  ,
  pararg1(1,aNbSolMAX)  ,
  pararg2(1,aNbSolMAX)  
{
  if (Radius < 0.) { throw Standard_NegativeValue(); }
  else {
    Geom2dAdaptor_Curve C1 = Qualified1.Qualified();
    Handle(Geom2d_Curve) CC1 = C1.Curve();
    GeomAbs_CurveType Type1 = C1.GetType();

//=============================================================================
//                            Appel a GccAna.                                 +
//=============================================================================

    Invert = Standard_False;
    NbrSol = 0;
    if (Type1 == GeomAbs_Line || Type1 == GeomAbs_Circle) {
      if (Type1 == GeomAbs_Circle) {
	Handle(Geom2d_Circle) CCC1 = Handle(Geom2d_Circle)::DownCast(CC1);
	gp_Circ2d c1(CCC1->Circ2d());
	GccEnt_QualifiedCirc Qc1(c1,Qualified1.Qualifier());
	GccAna_Circ2d2TanRad CircAna(Qc1,Point->Pnt2d(),Radius,Tolerance);
	WellDone = CircAna.IsDone();
	NbrSol = CircAna.NbSolutions();
	for(Standard_Integer i=1; i<=NbrSol; i++) {
	  CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	}
	Results(CircAna);
      }
      else {
	Handle(Geom2d_Line) LLL1 = Handle(Geom2d_Line)::DownCast(CC1);
	gp_Lin2d l1(LLL1->Lin2d());
	GccEnt_QualifiedLin Ql1(l1,Qualified1.Qualifier());
	GccAna_Circ2d2TanRad CircAna(Ql1,Point->Pnt2d(),Radius,Tolerance);
	WellDone = CircAna.IsDone();
	NbrSol = CircAna.NbSolutions();
	for(Standard_Integer i=1; i<=NbrSol; i++) {
	  CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	}
	Results(CircAna);
      }
    }
//=============================================================================
//                            Appel a GccGeo.                                 +
//=============================================================================
    else {
      Geom2dGcc_QCurve Qc1(C1,Qualified1.Qualifier());
      Geom2dGcc_Circ2d2TanRadGeo CircGeo(Qc1,Point->Pnt2d(),Radius,Tolerance);
      WellDone = CircGeo.IsDone();
      NbrSol = CircGeo.NbSolutions();
      for(Standard_Integer i=1; i<=NbrSol; i++) {
	CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
      }
      Results(CircGeo);
    }
  }
}
  
Geom2dGcc_Circ2d2TanRad::
   Geom2dGcc_Circ2d2TanRad (const Handle(Geom2d_Point)& Point1     ,
			    const Handle(Geom2d_Point)& Point2     ,
			    const Standard_Real         Radius     ,
			    const Standard_Real         Tolerance  ):
  cirsol(1,2)   ,
  qualifier1(1,2),
  qualifier2(1,2),
  TheSame1(1,2) ,
  TheSame2(1,2) ,
  pnttg1sol(1,2),
  pnttg2sol(1,2),
  par1sol(1,2)  ,
  par2sol(1,2)  ,
  pararg1(1,2)  ,
  pararg2(1,2)  
{
  if (Radius < 0.) { throw Standard_NegativeValue(); }
  else {

//=============================================================================
//                            Appel a GccAna.                                 +
//=============================================================================

    Invert = Standard_False;
    NbrSol = 0;
    GccAna_Circ2d2TanRad CircAna(Point1->Pnt2d(),Point2->Pnt2d(),
				 Radius,Tolerance);
    WellDone = CircAna.IsDone();
    NbrSol = CircAna.NbSolutions();
    for(Standard_Integer i=1; i<=NbrSol; i++) {
      CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
    }
    Results(CircAna);
  }
}

void Geom2dGcc_Circ2d2TanRad::Results(const GccAna_Circ2d2TanRad& Circ)
{
  for (Standard_Integer j = 1; j <= NbrSol; j++) {
    cirsol(j)   = Circ.ThisSolution(j);
    if (Circ.IsTheSame1(j)) { TheSame1(j) = 1; }
    else {TheSame1(j) = 0; }
    if (Circ.IsTheSame2(j)) { TheSame2(j) = 1; }
    else {TheSame2(j) = 0; }
    Circ.Tangency1(j,par1sol(j),pararg1(j),pnttg1sol(j));
    Circ.Tangency2(j,par2sol(j),pararg2(j),pnttg2sol(j));
  }
}

void Geom2dGcc_Circ2d2TanRad::Results(const Geom2dGcc_Circ2d2TanRadGeo& Circ)
{
  for (Standard_Integer j = 1; j <= NbrSol; j++) {
    cirsol(j)   = Circ.ThisSolution(j);
    if (Circ.IsTheSame1(j)) { TheSame1(j) = 1; }
    else {TheSame1(j) = 0; }
    if (Circ.IsTheSame2(j)) { TheSame2(j) = 1; }
    else {TheSame2(j) = 0; }
    Circ.Tangency1(j,par1sol(j),pararg1(j),pnttg1sol(j));
    Circ.Tangency2(j,par2sol(j),pararg2(j),pnttg2sol(j));
  }
}

Standard_Boolean Geom2dGcc_Circ2d2TanRad::
   IsDone () const { return WellDone; }

Standard_Integer Geom2dGcc_Circ2d2TanRad::
  NbSolutions () const 
{ 
  return NbrSol;
}

gp_Circ2d Geom2dGcc_Circ2d2TanRad::
  ThisSolution (const Standard_Integer Index) const 
{
  if (!WellDone) { throw StdFail_NotDone(); }
  if (Index <= 0 ||Index > NbrSol) { throw Standard_OutOfRange(); }
  return cirsol(Index);
}

void Geom2dGcc_Circ2d2TanRad::
  WhichQualifier (const Standard_Integer Index   ,
	                GccEnt_Position& Qualif1 ,
	                GccEnt_Position& Qualif2) const
{
  if (!WellDone) { throw StdFail_NotDone(); }
  else if (Index <= 0 ||Index > NbrSol) { throw Standard_OutOfRange(); }
  else {
    if (Invert) {
      Qualif1 = qualifier2(Index);
      Qualif2 = qualifier1(Index);
    }
    else {
      Qualif1 = qualifier1(Index);
      Qualif2 = qualifier2(Index);
    }
  }
}

void Geom2dGcc_Circ2d2TanRad::
  Tangency1 (const Standard_Integer Index,
	           Standard_Real&   ParSol,
	           Standard_Real&   ParArg,
	           gp_Pnt2d&        PntSol) const
{
  if (!WellDone) { throw StdFail_NotDone(); }
  else if (Index <= 0 ||Index > NbrSol) { throw Standard_OutOfRange(); }
  else {
    if (Invert) {
      if (TheSame2(Index) == 0) {
	ParSol = par2sol(Index);
	ParArg = pararg2(Index);
        PntSol = pnttg2sol(Index);
      }
      else { throw StdFail_NotDone(); }
    }
    else {
      if (TheSame1(Index) == 0) {
	ParSol = par1sol(Index);
	ParArg = pararg1(Index);
        PntSol = pnttg1sol(Index);
      }
      else { throw StdFail_NotDone(); }
    }
  }
}

void Geom2dGcc_Circ2d2TanRad::
   Tangency2 (const Standard_Integer Index,
              Standard_Real& ParSol,
              Standard_Real& ParArg,
              gp_Pnt2d& PntSol) const
{
  if (!WellDone) { throw StdFail_NotDone(); }
  else if (Index <= 0 ||Index > NbrSol) { throw Standard_OutOfRange(); }
  else {
    if (!Invert) {
      if (TheSame2(Index) == 0) {
	ParSol = par2sol(Index);
	ParArg = pararg2(Index);
        PntSol = pnttg2sol(Index);
      }
      else { throw StdFail_NotDone(); }
    }
    else {
      if (TheSame1(Index) == 0) {
	ParSol = par1sol(Index);
	ParArg = pararg1(Index);
        PntSol = pnttg1sol(Index);
      }
      else { throw StdFail_NotDone(); }
    }
  }
}

Standard_Boolean Geom2dGcc_Circ2d2TanRad::
   IsTheSame1 (const Standard_Integer Index) const
{
  if (!WellDone) { throw StdFail_NotDone(); }
  if (Index <= 0 ||Index > NbrSol) { throw Standard_OutOfRange(); }
  if (Invert) {
    if (TheSame2(Index) == 0) { return Standard_False; }
    else { return Standard_True; }
  }
  else {
    if (TheSame1(Index) == 0) { return Standard_False; }
    else { return Standard_True; }
  }
}

Standard_Boolean Geom2dGcc_Circ2d2TanRad::
   IsTheSame2 (const Standard_Integer Index) const
{
  if (!WellDone) { throw StdFail_NotDone(); }
  if (Index <= 0 ||Index > NbrSol) { throw Standard_OutOfRange(); }
  if (!Invert) {
    if (TheSame2(Index) == 0) { return Standard_False; }
    else { return Standard_True; }
  }
  else {
    if (TheSame1(Index) == 0) { return Standard_False; }
    else { return Standard_True; }
  }
//  return Standard_True;
}
Commit	Line	Data
b311480e	1	// Created on: 1992-10-21
	2	// Created by: Remi GILET
	3	// Copyright (c) 1992-1999 Matra Datavision
973c2be1	4	// Copyright (c) 1999-2014 OPEN CASCADE SAS
b311480e	5	//
973c2be1	6	// This file is part of Open CASCADE Technology software library.
b311480e	7	//
d5f74e42	8	// This library is free software; you can redistribute it and/or modify it under
d5f74e42	9	// the terms of the GNU Lesser General Public License version 2.1 as published
973c2be1	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.
b311480e	13	//
973c2be1	14	// Alternatively, this file may be used under the terms of Open CASCADE
973c2be1	15	// commercial license or contractual agreement.
7fd59977	16
42cf5bc1	17
7fd59977	18	#include <GccAna_Circ2d2TanRad.hxx>
7fd59977	19	#include <GccEnt_BadQualifier.hxx>
42cf5bc1	20	#include <GccEnt_QualifiedCirc.hxx>
42cf5bc1	21	#include <GccEnt_QualifiedLin.hxx>
7fd59977	22	#include <Geom2d_Circle.hxx>
7fd59977	23	#include <Geom2d_Line.hxx>
42cf5bc1	24	#include <Geom2d_Point.hxx>
	25	#include <Geom2dAdaptor_Curve.hxx>
	26	#include <Geom2dGcc_Circ2d2TanRad.hxx>
	27	#include <Geom2dGcc_Circ2d2TanRadGeo.hxx>
	28	#include <Geom2dGcc_QCurve.hxx>
	29	#include <Geom2dGcc_QualifiedCurve.hxx>
7fd59977	30	#include <gp_Circ2d.hxx>
7fd59977	31	#include <gp_Lin2d.hxx>
42cf5bc1	32	#include <gp_Pnt2d.hxx>
7fd59977	33	#include <Standard_NegativeValue.hxx>
7fd59977	34	#include <Standard_OutOfRange.hxx>
42cf5bc1	35	#include <StdFail_NotDone.hxx>
7fd59977	36
1d19db8d	37	static const Standard_Integer aNbSolMAX = 16;
7fd59977	38
	39	// circulaire tangent a deux cercles et de rayon donne
	40	//====================================================
	41	//========================================================================
	42	// On initialise WellDone a false. +
	43	// On recupere le cercle C1 et le cercle C2. +
	44	// On sort en erreur dans les cas ou la construction est impossible. +
	45	// On distingue les cas limites pour les triater separement. +
	46	// On fait la parallele a C1 dans le bon sens. +
	47	// On fait la parallele a C2 dans le bon sens. +
	48	// On intersecte les paralleles ==> point de centre de la solution. +
	49	// On cree la solution qu on ajoute aux solutions deja trouvees. +
	50	// On remplit les champs. +
	51	//========================================================================
	52
	53	Geom2dGcc_Circ2d2TanRad::
	54	Geom2dGcc_Circ2d2TanRad (const Geom2dGcc_QualifiedCurve& Qualified1 ,
	55	const Geom2dGcc_QualifiedCurve& Qualified2 ,
	56	const Standard_Real Radius ,
	57	const Standard_Real Tolerance ):
1d19db8d	58	cirsol(1,aNbSolMAX) ,
	59	qualifier1(1,aNbSolMAX),
	60	qualifier2(1,aNbSolMAX),
	61	TheSame1(1,aNbSolMAX) ,
	62	TheSame2(1,aNbSolMAX) ,
	63	pnttg1sol(1,aNbSolMAX),
	64	pnttg2sol(1,aNbSolMAX),
	65	par1sol(1,aNbSolMAX) ,
	66	par2sol(1,aNbSolMAX) ,
	67	pararg1(1,aNbSolMAX) ,
	68	pararg2(1,aNbSolMAX)
7fd59977	69	{
9775fa61	70	if (Radius < 0.) { throw Standard_NegativeValue(); }
7fd59977	71	else {
	72	Geom2dAdaptor_Curve C1 = Qualified1.Qualified();
	73	Geom2dAdaptor_Curve C2 = Qualified2.Qualified();
	74	Handle(Geom2d_Curve) CC1 = C1.Curve();
	75	Handle(Geom2d_Curve) CC2 = C2.Curve();
	76	GeomAbs_CurveType Type1 = C1.GetType();
	77	GeomAbs_CurveType Type2 = C2.GetType();
	78
	79	//=============================================================================
	80	// Appel a GccAna. +
	81	//=============================================================================
	82
	83	Invert = Standard_False;
	84	NbrSol = 0;
	85	if ((Type1 == GeomAbs_Line \|\| Type1 == GeomAbs_Circle) &&
	86	(Type2 == GeomAbs_Line \|\| Type2 == GeomAbs_Circle)) {
	87	if (Type1 == GeomAbs_Circle) {
	88	Handle(Geom2d_Circle) CCC1 = Handle(Geom2d_Circle)::DownCast(CC1);
	89	gp_Circ2d c1(CCC1->Circ2d());
	90	GccEnt_QualifiedCirc Qc1 = GccEnt_QualifiedCirc(c1,
	91	Qualified1.Qualifier());
	92	if (Type2 == GeomAbs_Circle) {
	93	Handle(Geom2d_Circle) CCC2 = Handle(Geom2d_Circle)::DownCast(CC2);
	94	gp_Circ2d c2(CCC2->Circ2d());
	95	GccAna_Circ2d2TanRad CircAna(Qc1,
	96	GccEnt_QualifiedCirc(c2,Qualified2.Qualifier()),
	97	Radius,Tolerance);
	98	WellDone = CircAna.IsDone();
	99	NbrSol = CircAna.NbSolutions();
	100	for(Standard_Integer i=1; i<=NbrSol; i++) {
	101	CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	102	}
	103	Results(CircAna);
	104	}
	105	else {
	106	Handle(Geom2d_Line) LL2 = Handle(Geom2d_Line)::DownCast(CC2);
	107	gp_Lin2d l2(LL2->Lin2d());
	108	if (!Qualified2.IsEnclosing()) {
	109	GccAna_Circ2d2TanRad CircAna(Qc1,
	110	GccEnt_QualifiedLin(l2,Qualified2.Qualifier()),
	111	Radius,Tolerance);
	112	WellDone = CircAna.IsDone();
	113	NbrSol = CircAna.NbSolutions();
	114	for(Standard_Integer i=1; i<=NbrSol; i++) {
	115	CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	116	}
	117	Results(CircAna);
	118	}
	119	else {
	120	WellDone = Standard_False;
9775fa61	121	throw GccEnt_BadQualifier();
7fd59977	122	}
	123	}
	124	}
	125	else {
	126	Handle(Geom2d_Line) LL1 = Handle(Geom2d_Line)::DownCast(CC1);
	127	gp_Lin2d l1(LL1->Lin2d());
	128	if (Qualified1.IsEnclosing()) {
	129	WellDone = Standard_False;
9775fa61	130	throw GccEnt_BadQualifier();
7fd59977	131	}
	132	else {
	133	GccEnt_QualifiedLin Ql1 = GccEnt_QualifiedLin(l1,
	134	Qualified1.Qualifier());
	135	if (Type2 == GeomAbs_Circle) {
	136	Handle(Geom2d_Circle) CCC2 = Handle(Geom2d_Circle)::DownCast(CC2);
	137	gp_Circ2d c2(CCC2->Circ2d());
	138	Invert = Standard_True;
	139	GccAna_Circ2d2TanRad CircAna(GccEnt_QualifiedCirc(c2,
	140	Qualified2.Qualifier()),
	141	Ql1,Radius,Tolerance);
	142	WellDone = CircAna.IsDone();
	143	NbrSol = CircAna.NbSolutions();
	144	for(Standard_Integer i=1; i<=NbrSol; i++) {
	145	CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	146	}
	147	Results(CircAna);
	148	}
	149	else {
	150	Handle(Geom2d_Line) LL2 = Handle(Geom2d_Line)::DownCast(CC2);
	151	gp_Lin2d l2(LL2->Lin2d());
	152	if (!Qualified2.IsEnclosing()) {
	153	GccAna_Circ2d2TanRad CircAna(Ql1,
	154	GccEnt_QualifiedLin(l2,Qualified2.Qualifier()),
	155	Radius,Tolerance);
	156	WellDone = CircAna.IsDone();
	157	NbrSol = CircAna.NbSolutions();
	158	for(Standard_Integer i=1; i<=NbrSol; i++) {
	159	CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	160	}
	161	Results(CircAna);
	162	}
	163	else {
	164	WellDone = Standard_False;
9775fa61	165	throw GccEnt_BadQualifier();
7fd59977	166	}
	167	}
	168	}
	169	}
	170	}
	171	//=============================================================================
	172	// Appel a GccGeo. +
	173	//=============================================================================
	174	else {
	175	if (Type1 == GeomAbs_Line) {
	176	Handle(Geom2d_Line) LL1 = Handle(Geom2d_Line)::DownCast(CC1);
	177	gp_Lin2d l1(LL1->Lin2d());
	178	if (Qualified1.IsEnclosing()) {
	179	WellDone = Standard_False;
9775fa61	180	throw GccEnt_BadQualifier();
7fd59977	181	}
	182	else {
	183	GccEnt_QualifiedLin Ql1 = GccEnt_QualifiedLin(l1,
	184	Qualified1.Qualifier());
0b85f9a6	185	Geom2dGcc_QCurve Qc2(C2,Qualified2.Qualifier());
578ce4be	186	Geom2dGcc_Circ2d2TanRadGeo CircGeo(Ql1,Qc2,Radius,Tolerance);
7fd59977	187	WellDone = CircGeo.IsDone();
	188	NbrSol = CircGeo.NbSolutions();
	189	for(Standard_Integer i=1; i<=NbrSol; i++) {
	190	CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	191	}
	192	Results(CircGeo);
	193	}
	194	}
	195	else if (Type1 == GeomAbs_Circle) {
	196	Handle(Geom2d_Circle) CCC1 = Handle(Geom2d_Circle)::DownCast(CC1);
	197	gp_Circ2d c1(CCC1->Circ2d());
	198	GccEnt_QualifiedCirc Qc1 = GccEnt_QualifiedCirc(c1,
	199	Qualified1.Qualifier());
0b85f9a6	200	Geom2dGcc_QCurve Qc2(C2,Qualified2.Qualifier());
578ce4be	201	Geom2dGcc_Circ2d2TanRadGeo CircGeo(Qc1,Qc2,Radius,Tolerance);
7fd59977	202	WellDone = CircGeo.IsDone();
	203	NbrSol = CircGeo.NbSolutions();
	204	for(Standard_Integer i=1; i<=NbrSol; i++) {
	205	CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	206	}
	207	Results(CircGeo);
	208	}
	209	else if (Type2 == GeomAbs_Line) {
	210	Invert = Standard_True;
	211	Handle(Geom2d_Line) LL2 = Handle(Geom2d_Line)::DownCast(CC2);
	212	gp_Lin2d l2(LL2->Lin2d());
	213	if (Qualified2.IsEnclosing()) {
	214	WellDone = Standard_False;
9775fa61	215	throw GccEnt_BadQualifier();
7fd59977	216	}
	217	else {
	218	GccEnt_QualifiedLin Ql2 = GccEnt_QualifiedLin(l2,
	219	Qualified2.Qualifier());
0b85f9a6	220	Geom2dGcc_QCurve Qc1(C1,Qualified1.Qualifier());
578ce4be	221	Geom2dGcc_Circ2d2TanRadGeo CircGeo(Ql2,Qc1,Radius,Tolerance);
7fd59977	222	WellDone = CircGeo.IsDone();
	223	NbrSol = CircGeo.NbSolutions();
	224	for(Standard_Integer i=1; i<=NbrSol; i++) {
	225	CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	226	}
	227	Results(CircGeo);
	228	}
	229	}
	230	else if (Type2 == GeomAbs_Circle) {
	231	Invert = Standard_True;
	232	Handle(Geom2d_Circle) CCC2 = Handle(Geom2d_Circle)::DownCast(CC2);
	233	gp_Circ2d c2(CCC2->Circ2d());
	234	GccEnt_QualifiedCirc Qc2 = GccEnt_QualifiedCirc(c2,
	235	Qualified2.Qualifier());
0b85f9a6	236	Geom2dGcc_QCurve Qc1(C1,Qualified1.Qualifier());
578ce4be	237	Geom2dGcc_Circ2d2TanRadGeo CircGeo(Qc2,Qc1,Radius,Tolerance);
7fd59977	238	WellDone = CircGeo.IsDone();
	239	NbrSol = CircGeo.NbSolutions();
	240	for(Standard_Integer i=1; i<=NbrSol; i++) {
	241	CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	242	}
	243	Results(CircGeo);
	244	}
	245	else {
0b85f9a6	246	Geom2dGcc_QCurve Qc1(C1,Qualified1.Qualifier());
0b85f9a6	247	Geom2dGcc_QCurve Qc2(C2,Qualified2.Qualifier());
578ce4be	248	Geom2dGcc_Circ2d2TanRadGeo CircGeo(Qc1,Qc2,Radius,Tolerance);
7fd59977	249	WellDone = CircGeo.IsDone();
	250	NbrSol = CircGeo.NbSolutions();
	251	for(Standard_Integer i=1; i<=NbrSol; i++) {
	252	CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	253	}
	254	Results(CircGeo);
	255	}
	256	}
	257	}
	258	}
	259
	260	Geom2dGcc_Circ2d2TanRad::
	261	Geom2dGcc_Circ2d2TanRad (const Geom2dGcc_QualifiedCurve& Qualified1 ,
	262	const Handle(Geom2d_Point)& Point ,
	263	const Standard_Real Radius ,
	264	const Standard_Real Tolerance ):
4c26106f	265	cirsol(1,aNbSolMAX) ,
	266	qualifier1(1,aNbSolMAX),
	267	qualifier2(1,aNbSolMAX),
	268	TheSame1(1,aNbSolMAX) ,
	269	TheSame2(1,aNbSolMAX) ,
	270	pnttg1sol(1,aNbSolMAX),
	271	pnttg2sol(1,aNbSolMAX),
	272	par1sol(1,aNbSolMAX) ,
	273	par2sol(1,aNbSolMAX) ,
	274	pararg1(1,aNbSolMAX) ,
	275	pararg2(1,aNbSolMAX)
7fd59977	276	{
9775fa61	277	if (Radius < 0.) { throw Standard_NegativeValue(); }
7fd59977	278	else {
	279	Geom2dAdaptor_Curve C1 = Qualified1.Qualified();
	280	Handle(Geom2d_Curve) CC1 = C1.Curve();
	281	GeomAbs_CurveType Type1 = C1.GetType();
	282
	283	//=============================================================================
	284	// Appel a GccAna. +
	285	//=============================================================================
	286
	287	Invert = Standard_False;
	288	NbrSol = 0;
	289	if (Type1 == GeomAbs_Line \|\| Type1 == GeomAbs_Circle) {
	290	if (Type1 == GeomAbs_Circle) {
	291	Handle(Geom2d_Circle) CCC1 = Handle(Geom2d_Circle)::DownCast(CC1);
	292	gp_Circ2d c1(CCC1->Circ2d());
	293	GccEnt_QualifiedCirc Qc1(c1,Qualified1.Qualifier());
	294	GccAna_Circ2d2TanRad CircAna(Qc1,Point->Pnt2d(),Radius,Tolerance);
	295	WellDone = CircAna.IsDone();
	296	NbrSol = CircAna.NbSolutions();
	297	for(Standard_Integer i=1; i<=NbrSol; i++) {
	298	CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	299	}
	300	Results(CircAna);
	301	}
	302	else {
	303	Handle(Geom2d_Line) LLL1 = Handle(Geom2d_Line)::DownCast(CC1);
	304	gp_Lin2d l1(LLL1->Lin2d());
	305	GccEnt_QualifiedLin Ql1(l1,Qualified1.Qualifier());
	306	GccAna_Circ2d2TanRad CircAna(Ql1,Point->Pnt2d(),Radius,Tolerance);
	307	WellDone = CircAna.IsDone();
	308	NbrSol = CircAna.NbSolutions();
	309	for(Standard_Integer i=1; i<=NbrSol; i++) {
	310	CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	311	}
	312	Results(CircAna);
	313	}
	314	}
	315	//=============================================================================
	316	// Appel a GccGeo. +
	317	//=============================================================================
	318	else {
0b85f9a6	319	Geom2dGcc_QCurve Qc1(C1,Qualified1.Qualifier());
578ce4be	320	Geom2dGcc_Circ2d2TanRadGeo CircGeo(Qc1,Point->Pnt2d(),Radius,Tolerance);
7fd59977	321	WellDone = CircGeo.IsDone();
	322	NbrSol = CircGeo.NbSolutions();
	323	for(Standard_Integer i=1; i<=NbrSol; i++) {
	324	CircGeo.WhichQualifier(i,qualifier1(i),qualifier2(i));
	325	}
	326	Results(CircGeo);
	327	}
	328	}
	329	}
	330
	331	Geom2dGcc_Circ2d2TanRad::
	332	Geom2dGcc_Circ2d2TanRad (const Handle(Geom2d_Point)& Point1 ,
	333	const Handle(Geom2d_Point)& Point2 ,
	334	const Standard_Real Radius ,
	335	const Standard_Real Tolerance ):
	336	cirsol(1,2) ,
	337	qualifier1(1,2),
	338	qualifier2(1,2),
	339	TheSame1(1,2) ,
	340	TheSame2(1,2) ,
	341	pnttg1sol(1,2),
	342	pnttg2sol(1,2),
	343	par1sol(1,2) ,
	344	par2sol(1,2) ,
	345	pararg1(1,2) ,
	346	pararg2(1,2)
	347	{
9775fa61	348	if (Radius < 0.) { throw Standard_NegativeValue(); }
7fd59977	349	else {
	350
	351	//=============================================================================
	352	// Appel a GccAna. +
	353	//=============================================================================
	354
	355	Invert = Standard_False;
	356	NbrSol = 0;
	357	GccAna_Circ2d2TanRad CircAna(Point1->Pnt2d(),Point2->Pnt2d(),
	358	Radius,Tolerance);
	359	WellDone = CircAna.IsDone();
	360	NbrSol = CircAna.NbSolutions();
	361	for(Standard_Integer i=1; i<=NbrSol; i++) {
	362	CircAna.WhichQualifier(i,qualifier1(i),qualifier2(i));
	363	}
	364	Results(CircAna);
	365	}
	366	}
	367
	368	void Geom2dGcc_Circ2d2TanRad::Results(const GccAna_Circ2d2TanRad& Circ)
	369	{
	370	for (Standard_Integer j = 1; j <= NbrSol; j++) {
	371	cirsol(j) = Circ.ThisSolution(j);
	372	if (Circ.IsTheSame1(j)) { TheSame1(j) = 1; }
	373	else {TheSame1(j) = 0; }
	374	if (Circ.IsTheSame2(j)) { TheSame2(j) = 1; }
	375	else {TheSame2(j) = 0; }
	376	Circ.Tangency1(j,par1sol(j),pararg1(j),pnttg1sol(j));
	377	Circ.Tangency2(j,par2sol(j),pararg2(j),pnttg2sol(j));
	378	}
	379	}
	380
578ce4be	381	void Geom2dGcc_Circ2d2TanRad::Results(const Geom2dGcc_Circ2d2TanRadGeo& Circ)
7fd59977	382	{
	383	for (Standard_Integer j = 1; j <= NbrSol; j++) {
	384	cirsol(j) = Circ.ThisSolution(j);
	385	if (Circ.IsTheSame1(j)) { TheSame1(j) = 1; }
	386	else {TheSame1(j) = 0; }
	387	if (Circ.IsTheSame2(j)) { TheSame2(j) = 1; }
	388	else {TheSame2(j) = 0; }
	389	Circ.Tangency1(j,par1sol(j),pararg1(j),pnttg1sol(j));
	390	Circ.Tangency2(j,par2sol(j),pararg2(j),pnttg2sol(j));
	391	}
	392	}
	393
	394	Standard_Boolean Geom2dGcc_Circ2d2TanRad::
	395	IsDone () const { return WellDone; }
	396
	397	Standard_Integer Geom2dGcc_Circ2d2TanRad::
	398	NbSolutions () const
	399	{
	400	return NbrSol;
	401	}
	402
	403	gp_Circ2d Geom2dGcc_Circ2d2TanRad::
	404	ThisSolution (const Standard_Integer Index) const
	405	{
9775fa61	406	if (!WellDone) { throw StdFail_NotDone(); }
9775fa61	407	if (Index <= 0 \|\|Index > NbrSol) { throw Standard_OutOfRange(); }
7fd59977	408	return cirsol(Index);
	409	}
	410
	411	void Geom2dGcc_Circ2d2TanRad::
	412	WhichQualifier (const Standard_Integer Index ,
	413	GccEnt_Position& Qualif1 ,
	414	GccEnt_Position& Qualif2) const
	415	{
9775fa61	416	if (!WellDone) { throw StdFail_NotDone(); }
9775fa61	417	else if (Index <= 0 \|\|Index > NbrSol) { throw Standard_OutOfRange(); }
7fd59977	418	else {
	419	if (Invert) {
	420	Qualif1 = qualifier2(Index);
	421	Qualif2 = qualifier1(Index);
	422	}
	423	else {
	424	Qualif1 = qualifier1(Index);
	425	Qualif2 = qualifier2(Index);
	426	}
	427	}
	428	}
	429
	430	void Geom2dGcc_Circ2d2TanRad::
	431	Tangency1 (const Standard_Integer Index,
	432	Standard_Real& ParSol,
	433	Standard_Real& ParArg,
	434	gp_Pnt2d& PntSol) const
	435	{
9775fa61	436	if (!WellDone) { throw StdFail_NotDone(); }
9775fa61	437	else if (Index <= 0 \|\|Index > NbrSol) { throw Standard_OutOfRange(); }
7fd59977	438	else {
	439	if (Invert) {
	440	if (TheSame2(Index) == 0) {
	441	ParSol = par2sol(Index);
	442	ParArg = pararg2(Index);
	443	PntSol = pnttg2sol(Index);
	444	}
9775fa61	445	else { throw StdFail_NotDone(); }
7fd59977	446	}
	447	else {
	448	if (TheSame1(Index) == 0) {
	449	ParSol = par1sol(Index);
	450	ParArg = pararg1(Index);
	451	PntSol = pnttg1sol(Index);
	452	}
9775fa61	453	else { throw StdFail_NotDone(); }
7fd59977	454	}
	455	}
	456	}
	457
	458	void Geom2dGcc_Circ2d2TanRad::
	459	Tangency2 (const Standard_Integer Index,
	460	Standard_Real& ParSol,
	461	Standard_Real& ParArg,
	462	gp_Pnt2d& PntSol) const
	463	{
9775fa61	464	if (!WellDone) { throw StdFail_NotDone(); }
9775fa61	465	else if (Index <= 0 \|\|Index > NbrSol) { throw Standard_OutOfRange(); }
7fd59977	466	else {
	467	if (!Invert) {
	468	if (TheSame2(Index) == 0) {
	469	ParSol = par2sol(Index);
	470	ParArg = pararg2(Index);
	471	PntSol = pnttg2sol(Index);
	472	}
9775fa61	473	else { throw StdFail_NotDone(); }
7fd59977	474	}
	475	else {
	476	if (TheSame1(Index) == 0) {
	477	ParSol = par1sol(Index);
	478	ParArg = pararg1(Index);
	479	PntSol = pnttg1sol(Index);
	480	}
9775fa61	481	else { throw StdFail_NotDone(); }
7fd59977	482	}
	483	}
	484	}
	485
	486	Standard_Boolean Geom2dGcc_Circ2d2TanRad::
	487	IsTheSame1 (const Standard_Integer Index) const
	488	{
9775fa61	489	if (!WellDone) { throw StdFail_NotDone(); }
9775fa61	490	if (Index <= 0 \|\|Index > NbrSol) { throw Standard_OutOfRange(); }
7fd59977	491	if (Invert) {
	492	if (TheSame2(Index) == 0) { return Standard_False; }
	493	else { return Standard_True; }
	494	}
	495	else {
	496	if (TheSame1(Index) == 0) { return Standard_False; }
	497	else { return Standard_True; }
	498	}
7fd59977	499	}
	500
	501	Standard_Boolean Geom2dGcc_Circ2d2TanRad::
	502	IsTheSame2 (const Standard_Integer Index) const
	503	{
9775fa61	504	if (!WellDone) { throw StdFail_NotDone(); }
9775fa61	505	if (Index <= 0 \|\|Index > NbrSol) { throw Standard_OutOfRange(); }
7fd59977	506	if (!Invert) {
	507	if (TheSame2(Index) == 0) { return Standard_False; }
	508	else { return Standard_True; }
	509	}
	510	else {
	511	if (TheSame1(Index) == 0) { return Standard_False; }
	512	else { return Standard_True; }
	513	}
d3f26155	514	// return Standard_True;
7fd59977	515	}