mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-05-11 10:44:53 +03:00
42cf5bc1ca
Automatic upgrade of OCCT code by command "occt_upgrade . -nocdl": - WOK-generated header files from inc and sources from drv are moved to src - CDL files removed - All packages are converted to nocdlpack
79 lines
2.3 KiB
C++
79 lines
2.3 KiB
C++
// Copyright (c) 1995-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.
|
|
|
|
//============================================ IntAna2d_AnaIntersection_4.cxx
|
|
//============================================================================
|
|
|
|
#include <gp_Circ2d.hxx>
|
|
#include <gp_Elips2d.hxx>
|
|
#include <gp_Hypr2d.hxx>
|
|
#include <gp_Lin2d.hxx>
|
|
#include <gp_Parab2d.hxx>
|
|
#include <IntAna2d_AnaIntersection.hxx>
|
|
#include <IntAna2d_Conic.hxx>
|
|
#include <IntAna2d_IntPoint.hxx>
|
|
#include <IntAna2d_Outils.hxx>
|
|
#include <Standard_OutOfRange.hxx>
|
|
#include <StdFail_NotDone.hxx>
|
|
|
|
void IntAna2d_AnaIntersection::Perform (const gp_Lin2d& L,
|
|
const IntAna2d_Conic& Conic)
|
|
{
|
|
Standard_Real A,B,C,D,E,F;
|
|
Standard_Real px0,px1,px2;
|
|
Standard_Real DR_A,DR_B,DR_C,X0,Y0;
|
|
Standard_Integer i;
|
|
Standard_Real tx,ty,S;
|
|
|
|
done = Standard_False;
|
|
nbp = 0;
|
|
para = Standard_False;
|
|
iden = Standard_False;
|
|
|
|
Conic.Coefficients(A,B,C,D,E,F);
|
|
L.Coefficients(DR_A,DR_B,DR_C);
|
|
X0=L.Location().X();
|
|
Y0=L.Location().Y();
|
|
|
|
// Parametre: L
|
|
// X = Xo - L DR_B et Y = Yo + L DR_A
|
|
|
|
px0=F + X0*(D+D + A*X0 + 2.0*C*Y0) + Y0*(E+E + B*Y0);
|
|
px1=2.0*(E*DR_A - D*DR_B + X0*(C*DR_A - A*DR_B) + Y0*(B*DR_A - C*DR_B));
|
|
px2=DR_A*(B*DR_A - 2.0*C*DR_B) + A*(DR_B*DR_B);
|
|
|
|
MyDirectPolynomialRoots Sol(px2,px1,px0);
|
|
|
|
if(!Sol.IsDone()) {
|
|
done=Standard_False;
|
|
return;
|
|
}
|
|
else {
|
|
if(Sol.InfiniteRoots()) {
|
|
iden=Standard_True;
|
|
done=Standard_True;
|
|
return;
|
|
}
|
|
nbp=Sol.NbSolutions();
|
|
for(i=1;i<=nbp;i++) {
|
|
S=Sol.Value(i);
|
|
tx=X0 - S*DR_B;
|
|
ty=Y0 + S*DR_A;
|
|
lpnt[i-1].SetValue(tx,ty,S);
|
|
}
|
|
Traitement_Points_Confondus(nbp,lpnt);
|
|
}
|
|
done=Standard_True;
|
|
}
|