mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-07-25 12:55:50 +03:00
e2e0498b17
The root of the problem is incorrect processing of cases when intersection line goes through the apex(es) of sphere. The fix improves this situation. The algorithm is taken from DecomposeResult(...) function (see IntPatch_ImpPrmIntersection.cxx file). Before the fix, faltering steps were done to solve this problem. As result, it worked in some particular cases. Now, its possibilities have been extended significantly. Following changes have been made in the fix: 1. Class IntPatch_ALineToWLine has been rewritten cardinally. It touches as interfaces of existing methods as adding/removing some methods/fields. Correction touches both cases: going through seam of Cone/Sphere and through pole(s) of sphere. Old interface did not allow making some actions with analytical line (ALine), e.g. splitting it on several Walking-lines (WLine). 2. Restriction-line support has been removed from Implicit-Implicit intersection result (see IntPatch_Intersection::GeomGeomPerfom(...) method). It connects with the fact that the intersection algorithm itself returns precise intersection line in analytical cases (in compare with parametric intersector). Therefore, we do not need in additional (restriction) line. 3. New class IntPatch_SpecialPoints has been added. This class contains methods to add some special points (such as apex of cone, pole of sphere, point on surface boundary etc.) in intersection line (IntPatch_PointLine). It is based on the static functions, which already exist in IntPatch_ImpPrmIntersection.cxx file (these functions have been moved to the new class). 4. Method IntPatch_WLineTool::ExtendTwoWlinesToEachOther(...) has been renamed to IntPatch_WLineTool::ExtendTwoWLines(...). It is connected with changing main idea of the method. Now it allows extending WLine to the surface boundary or to the singular point (if it is possible): cone apex, sphere pole etc. Interface of this method has been corrected, too. At that, old functionality (extending to each other) has been kept. For implementation of this algorithm, new enumeration "IntPatchWT_WLsConnectionType" has been created. 5. Method IntPatch_PointLine::CurvatureRadiusOfIntersLine(...) has been added. See IntPatch_PointLine.hxx for detail information. It allows correct step computing depended on the local curvature of the intersection line. This method uses geometrical properties of intersected surfaces to compute local curvature. Therefore, it can be applied in wide range of cases even if the intersection curve is not represented in explicit form (e.g. in case of param-param-intersection). 6. Method IntSurf::SetPeriod(...) has been created. 7. Additional check has been added in Draft_Modification::Perform() method for better choice of correct fragment of intersection line for processing DRAFT operation. 8. New overload method IntPatch_Point::SetValue() has been added. 9. Some refactoring of the code has been made. Creation of test case for issue #27431. --------------------------------------------------------------------------------------------- Some test cases have been adjusted according to their new behavior. tests\bugs\modalg_4\bug62 It is really IMPROVEMENT (but fortuitous). tests\bugs\modalg_5\bug25838 The behavior of this test has been reverted to the state before fixing the issue #27341. Main problem has not been fixed in #27341. It was fortuitous improvement. tests\bugs\moddata_2\bug565 Quality of intersection curve was not checked. And the curve is bad on both MASTER and FIX. Input data are really wrong: plane-like-cone. However, on the MASTER, four intersection curves (the quality is insignificant) are expected. On the fix, not empty intersection result is expected simply. tests\boolean\volumemaker\A8 Differences in images and CPU is expected. Difference in images is expected to be fixed in the issue #26020. Now, we should apply this behavior. Much CPU time is spent by IntTools_FaceFace::ComputeTolReached3d(...) and GeomInt_IntSS::BuildPCurves(...) methods calling. These methods are not touched by the algorithm. It is the result of change of intersection curve(s) form. However, the new Curve(s) seems to be valid and can be applied. As result, new behavior can be applied, too. tests\boolean\volumemaker\F8 tests\boolean\volumemaker\F9 tests\boolean\volumemaker\G5 tests\boolean\volumemaker\G6 CPU difference is expected. Much CPU time is spent by IntPatch_PointLine::CurvatureRadiusOfIntersLine(...) method calling. This method is really new (it does not exist on the MASTER) and is really useful. Therefore, we should apply new behavior. tests\boolean\volumemaker\G1 CPU difference is expected. Much CPU time is spent by IntTools_WLineTool::DecompositionOfWLine(...) and IntTools_FaceFace::ComputeTolReached3d(...) methods calling. These methods are not touched by the algorithm. It is the result of change of intersection curve(s) form. However, the new Curve(s) seems to be valid and can be applied. As result, new behavior can be applied, too. tests\bugs\modalg_6\bug26619 Differences in images is expected. The test keeps its BAD status on the FIX. But the result on the fix is nearer to expected than on the MASTER. Issue #27014 is still actual. As before, it is not clear, why the number of entities is different. The number of section curves has not been changed. Interfered entities are the same as on the MASTER. tests\bugs\modalg_5\bug25319_1(2) The reason is described in the issue #27896. Small correction in the test case
582 lines
17 KiB
C++
582 lines
17 KiB
C++
// Created on: 1992-06-30
|
|
// Created by: Laurent BUCHARD
|
|
// 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.
|
|
|
|
#ifndef OCCT_DEBUG
|
|
#define No_Standard_RangeError
|
|
#define No_Standard_OutOfRange
|
|
#endif
|
|
|
|
//----------------------------------------------------------------------
|
|
//-- Differents constructeurs sont proposes qui correspondent aux
|
|
//-- polynomes en Z :
|
|
//-- A(Sin(Theta),Cos(Theta)) Z**2
|
|
//-- + B(Sin(Theta),Cos(Theta)) Z
|
|
//-- + C(Sin(Theta),Cos(Theta))
|
|
//--
|
|
//-- Une Courbe est definie sur un domaine
|
|
//--
|
|
//-- Value retourne le point de parametre U(Theta),V(Theta)
|
|
//-- ou V est la solution du polynome A V**2 + B V + C
|
|
//-- (Selon les cas, on prend V+ ou V-)
|
|
//--
|
|
//-- D1u calcule le vecteur tangent a la courbe
|
|
//-- et retourne le booleen Standard_False si ce calcul ne peut
|
|
//-- pas etre mene a bien.
|
|
//----------------------------------------------------------------------
|
|
|
|
#include <ElSLib.hxx>
|
|
#include <gp_Cone.hxx>
|
|
#include <gp_Cylinder.hxx>
|
|
#include <gp_Pnt.hxx>
|
|
#include <gp_Vec.hxx>
|
|
#include <gp_XYZ.hxx>
|
|
#include <IntAna_Curve.hxx>
|
|
#include <math_DirectPolynomialRoots.hxx>
|
|
#include <Precision.hxx>
|
|
#include <Standard_DomainError.hxx>
|
|
|
|
//=======================================================================
|
|
//function : IntAna_Curve
|
|
//purpose :
|
|
//=======================================================================
|
|
IntAna_Curve::IntAna_Curve()
|
|
{
|
|
typequadric=GeomAbs_OtherSurface;
|
|
firstbounded=Standard_False;
|
|
lastbounded=Standard_False;
|
|
}
|
|
//=======================================================================
|
|
//function : SetConeQuadValues
|
|
//purpose : Description de l intersection Cone Quadrique
|
|
//=======================================================================
|
|
void IntAna_Curve::SetConeQuadValues(const gp_Cone& Cone,
|
|
const Standard_Real Qxx,
|
|
const Standard_Real Qyy,
|
|
const Standard_Real Qzz,
|
|
const Standard_Real Qxy,
|
|
const Standard_Real Qxz,
|
|
const Standard_Real Qyz,
|
|
const Standard_Real Qx,
|
|
const Standard_Real Qy,
|
|
const Standard_Real Qz,
|
|
const Standard_Real Q1,
|
|
const Standard_Real TOL,
|
|
const Standard_Real DomInf,
|
|
const Standard_Real DomSup,
|
|
const Standard_Boolean twocurves,
|
|
const Standard_Boolean takezpositive)
|
|
{
|
|
|
|
Ax3 = Cone.Position();
|
|
RCyl = Cone.RefRadius();
|
|
|
|
Angle = Cone.SemiAngle();
|
|
Standard_Real UnSurTgAngle = 1.0/(Tan(Cone.SemiAngle()));
|
|
|
|
typequadric= GeomAbs_Cone;
|
|
|
|
TwoCurves = twocurves; //-- deux Z pour un meme parametre
|
|
TakeZPositive = takezpositive; //-- Prendre sur la courbe le Z Positif
|
|
//-- ( -B + Sqrt()) et non (-B - Sqrt())
|
|
|
|
|
|
Z0Cte = Q1; //-- Attention On a Z?Cos Cos(t)
|
|
Z0Sin = 0.0; //-- et Non 2 Z?Cos Cos(t) !!!
|
|
Z0Cos = 0.0; //-- Ce pour tous les Parametres
|
|
Z0CosCos = 0.0; //-- ie pas de Coefficient 2
|
|
Z0SinSin = 0.0; //-- devant les termes CS C S
|
|
Z0CosSin = 0.0;
|
|
|
|
Z1Cte = 2.0*(UnSurTgAngle)*Qz;
|
|
Z1Sin = Qy+Qy;
|
|
Z1Cos = Qx+Qx;
|
|
Z1CosCos = 0.0;
|
|
Z1SinSin = 0.0;
|
|
Z1CosSin = 0.0;
|
|
|
|
Z2Cte = Qzz * UnSurTgAngle*UnSurTgAngle;
|
|
Z2Sin = (UnSurTgAngle+UnSurTgAngle)*Qyz;
|
|
Z2Cos = (UnSurTgAngle+UnSurTgAngle)*Qxz;
|
|
Z2CosCos = Qxx;
|
|
Z2SinSin = Qyy;
|
|
Z2CosSin = Qxy+Qxy;
|
|
|
|
Tolerance = TOL;
|
|
DomainInf = DomInf;
|
|
DomainSup = DomSup;
|
|
|
|
RestrictedInf = RestrictedSup = Standard_True; //-- Le Domaine est Borne
|
|
firstbounded = lastbounded = Standard_False;
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : SetCylinderQuadValues
|
|
//purpose : Description de l intersection Cylindre Quadrique
|
|
//=======================================================================
|
|
void IntAna_Curve::SetCylinderQuadValues(const gp_Cylinder& Cyl,
|
|
const Standard_Real Qxx,
|
|
const Standard_Real Qyy,
|
|
const Standard_Real Qzz,
|
|
const Standard_Real Qxy,
|
|
const Standard_Real Qxz,
|
|
const Standard_Real Qyz,
|
|
const Standard_Real Qx,
|
|
const Standard_Real Qy,
|
|
const Standard_Real Qz,
|
|
const Standard_Real Q1,
|
|
const Standard_Real TOL,
|
|
const Standard_Real DomInf,
|
|
const Standard_Real DomSup,
|
|
const Standard_Boolean twocurves,
|
|
const Standard_Boolean takezpositive)
|
|
{
|
|
|
|
Ax3 = Cyl.Position();
|
|
RCyl = Cyl.Radius();
|
|
typequadric= GeomAbs_Cylinder;
|
|
|
|
TwoCurves = twocurves; //-- deux Z pour un meme parametre
|
|
TakeZPositive = takezpositive; //-- Prendre sur la courbe le Z Positif
|
|
Standard_Real RCylmul2 = RCyl+RCyl; //-- ( -B + Sqrt())
|
|
|
|
Z0Cte = Q1;
|
|
Z0Sin = RCylmul2*Qy;
|
|
Z0Cos = RCylmul2*Qx;
|
|
Z0CosCos = Qxx*RCyl*RCyl;
|
|
Z0SinSin = Qyy*RCyl*RCyl;
|
|
Z0CosSin = RCylmul2*RCyl*Qxy;
|
|
|
|
Z1Cte = Qz+Qz;
|
|
Z1Sin = RCylmul2*Qyz;
|
|
Z1Cos = RCylmul2*Qxz;
|
|
Z1CosCos = 0.0;
|
|
Z1SinSin = 0.0;
|
|
Z1CosSin = 0.0;
|
|
|
|
Z2Cte = Qzz;
|
|
Z2Sin = 0.0;
|
|
Z2Cos = 0.0;
|
|
Z2CosCos = 0.0;
|
|
Z2SinSin = 0.0;
|
|
Z2CosSin = 0.0;
|
|
|
|
Tolerance = TOL;
|
|
DomainInf = DomInf;
|
|
DomainSup = DomSup;
|
|
|
|
RestrictedInf = RestrictedSup = Standard_True;
|
|
firstbounded = lastbounded = Standard_False;
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : IsOpen
|
|
//purpose :
|
|
//=======================================================================
|
|
Standard_Boolean IntAna_Curve::IsOpen() const
|
|
{
|
|
return(RestrictedInf && RestrictedSup);
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : Domain
|
|
//purpose :
|
|
//=======================================================================
|
|
void IntAna_Curve::Domain(Standard_Real& DInf,
|
|
Standard_Real& DSup) const
|
|
{
|
|
if(RestrictedInf && RestrictedSup) {
|
|
DInf=DomainInf;
|
|
DSup=DomainSup;
|
|
if(TwoCurves) {
|
|
DSup+=DSup-DInf;
|
|
}
|
|
}
|
|
else {
|
|
Standard_DomainError::Raise("IntAna_Curve::Domain");
|
|
}
|
|
}
|
|
//=======================================================================
|
|
//function : IsConstant
|
|
//purpose :
|
|
//=======================================================================
|
|
Standard_Boolean IntAna_Curve::IsConstant() const
|
|
{
|
|
//-- ??? Pas facile de decider a la seule vue des Param.
|
|
return(Standard_False);
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : IsFirstOpen
|
|
//purpose :
|
|
//=======================================================================
|
|
Standard_Boolean IntAna_Curve::IsFirstOpen() const
|
|
{
|
|
return(firstbounded);
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : IsLastOpen
|
|
//purpose :
|
|
//=======================================================================
|
|
Standard_Boolean IntAna_Curve::IsLastOpen() const
|
|
{
|
|
return(lastbounded);
|
|
}
|
|
//=======================================================================
|
|
//function : SetIsFirstOpen
|
|
//purpose :
|
|
//=======================================================================
|
|
void IntAna_Curve::SetIsFirstOpen(const Standard_Boolean Flag)
|
|
{
|
|
firstbounded = Flag;
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : SetIsLastOpen
|
|
//purpose :
|
|
//=======================================================================
|
|
void IntAna_Curve::SetIsLastOpen(const Standard_Boolean Flag)
|
|
{
|
|
lastbounded = Flag;
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : InternalUVValue
|
|
//purpose :
|
|
//=======================================================================
|
|
void IntAna_Curve::InternalUVValue(const Standard_Real theta,
|
|
Standard_Real& Param1,
|
|
Standard_Real& Param2,
|
|
Standard_Real& A,
|
|
Standard_Real& B,
|
|
Standard_Real& C,
|
|
Standard_Real& cost,
|
|
Standard_Real& sint,
|
|
Standard_Real& SigneSqrtDis) const
|
|
{
|
|
const Standard_Real aRelTolp = 1.0+Epsilon(1.0), aRelTolm = 1.0-Epsilon(1.0);
|
|
Standard_Real Theta=theta;
|
|
Standard_Boolean SecondSolution=Standard_False;
|
|
|
|
if((Theta<DomainInf*aRelTolm) ||
|
|
((Theta>DomainSup*aRelTolp) && (!TwoCurves)) ||
|
|
(Theta>(DomainSup+DomainSup-DomainInf)*aRelTolp)) {
|
|
SigneSqrtDis = 0.;
|
|
Standard_DomainError::Raise("IntAna_Curve::Domain");
|
|
}
|
|
|
|
if(Theta>DomainSup) {
|
|
Theta=DomainSup+DomainSup-Theta;
|
|
SecondSolution=Standard_True;
|
|
}
|
|
|
|
Param1=Theta;
|
|
|
|
if(!TwoCurves) {
|
|
SecondSolution=TakeZPositive;
|
|
}
|
|
//
|
|
cost = Cos(Theta);
|
|
sint = Sin(Theta);
|
|
Standard_Real costsint = cost*sint;
|
|
|
|
A=Z2Cte+sint*(Z2Sin+sint*Z2SinSin)+cost*(Z2Cos+cost*Z2CosCos)
|
|
+Z2CosSin*costsint;
|
|
|
|
B=Z1Cte+sint*(Z1Sin+sint*Z1SinSin)+cost*(Z1Cos+cost*Z1CosCos)
|
|
+Z1CosSin*costsint;
|
|
|
|
C=Z0Cte+sint*(Z0Sin+sint*Z0SinSin)+cost*(Z0Cos+cost*Z0CosCos)
|
|
+Z0CosSin*costsint;
|
|
|
|
|
|
const Standard_Real aDiscriminant = Max(B*B-4.0*A*C, 0.0);
|
|
|
|
if(Abs(A)<=Precision::PConfusion()) {
|
|
//-- cout<<" IntAna_Curve:: Internal UV Value : A="<<A<<" -> Abs(A)="<<Abs(A)<<endl;
|
|
if(Abs(B)<=Precision::PConfusion()) {
|
|
//-- cout<<" Probleme : Pas de solutions "<<endl;
|
|
Param2=0.0;
|
|
}
|
|
else {
|
|
//modified by NIZNHY-PKV Fri Dec 2 16:02:46 2005f
|
|
Param2 = -C/B;
|
|
/*
|
|
if(!SecondSolution) {
|
|
//-- Cas Param2 = (-B+Sqrt(Discriminant))/(A+A);
|
|
//-- = (-B+Sqrt(B**2 - Eps)) / 2A
|
|
//-- = -C / B
|
|
Param2 = -C/B;
|
|
}
|
|
else {
|
|
//-- Cas Param2 = (-B-Sqrt(Discriminant))/(A+A);
|
|
//-- = (-B-Sqrt(B**2 - Eps)) / 2A
|
|
if(A) {
|
|
Param2 = -B/A;
|
|
}
|
|
else {
|
|
Param2 = -B*10000000.0;
|
|
}
|
|
}
|
|
*/
|
|
//modified by NIZNHY-PKV Fri Dec 2 16:02:54 2005t
|
|
}
|
|
}
|
|
else {
|
|
SigneSqrtDis = (SecondSolution)? Sqrt(aDiscriminant) : -Sqrt(aDiscriminant);
|
|
Param2=(-B+SigneSqrtDis)/(A+A);
|
|
}
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : Value
|
|
//purpose :
|
|
//=======================================================================
|
|
gp_Pnt IntAna_Curve::Value(const Standard_Real theta)
|
|
{
|
|
Standard_Real A, B, C, U, V, sint, cost, SigneSqrtDis;
|
|
//
|
|
A=0.0; B=0.0; C=0.0;
|
|
U=0.0; V=0.0;
|
|
sint=0.0; cost=0.0;
|
|
SigneSqrtDis=0.0;
|
|
InternalUVValue(theta,U,V,A,B,C,cost,sint,SigneSqrtDis);
|
|
//-- checked the parameter U and Raises Domain Error if Error
|
|
return(InternalValue(U,V));
|
|
}
|
|
//=======================================================================
|
|
//function : D1u
|
|
//purpose :
|
|
//=======================================================================
|
|
Standard_Boolean IntAna_Curve::D1u(const Standard_Real theta,
|
|
gp_Pnt& Pt,
|
|
gp_Vec& Vec)
|
|
{
|
|
//-- Pour detecter le cas ou le calcul est impossible
|
|
Standard_Real A, B, C, U, V, sint, cost, SigneSqrtDis;
|
|
A=0.0; B=0.0; C=0.0;
|
|
U=0.0; V=0.0;
|
|
sint=0.0; cost=0.0;
|
|
//
|
|
InternalUVValue(theta,U,V,A,B,C,cost,sint,SigneSqrtDis);
|
|
//
|
|
Pt = Value(theta);
|
|
if(Abs(A)<0.0000001 || Abs(SigneSqrtDis)<0.0000000001) return(Standard_False);
|
|
|
|
|
|
//-- Approximation de la derivee (mieux que le calcul mathematique!)
|
|
Standard_Real dtheta = (DomainSup-DomainInf)*0.000001;
|
|
Standard_Real theta2 = theta+dtheta;
|
|
if((theta2<DomainInf) || ((theta2>DomainSup) && (!TwoCurves))
|
|
|| (theta2>(DomainSup+DomainSup-DomainInf+0.00000000000001))) {
|
|
dtheta = -dtheta;
|
|
theta2 = theta+dtheta;
|
|
}
|
|
gp_Pnt P2 = Value(theta2);
|
|
dtheta = 1.0/dtheta;
|
|
Vec.SetCoord((P2.X()-Pt.X())*dtheta,
|
|
(P2.Y()-Pt.Y())*dtheta,
|
|
(P2.Z()-Pt.Z())*dtheta);
|
|
|
|
return(Standard_True);
|
|
}
|
|
//=======================================================================
|
|
//function : FindParameter
|
|
//purpose : Para est en sortie le parametre sur la courbe
|
|
//=======================================================================
|
|
Standard_Boolean IntAna_Curve::FindParameter (const gp_Pnt& P,
|
|
Standard_Real& Para) const
|
|
{
|
|
Standard_Real theta,z, aTolPrecision=0.0001;
|
|
Standard_Real PIpPI = M_PI + M_PI;
|
|
//
|
|
switch (typequadric) {
|
|
|
|
case GeomAbs_Cylinder:
|
|
{
|
|
ElSLib::CylinderParameters(Ax3,RCyl,P,theta,z);
|
|
}
|
|
break;
|
|
|
|
case GeomAbs_Cone :
|
|
{
|
|
ElSLib::ConeParameters(Ax3,RCyl,Angle,P,theta,z);
|
|
}
|
|
break;
|
|
|
|
default:
|
|
return Standard_False;
|
|
break;
|
|
}
|
|
//
|
|
Standard_Real epsAng = 1.e-8;
|
|
Standard_Real tmin = DomainInf;
|
|
Standard_Real tmax = DomainSup;
|
|
Standard_Real U,V,A,B,C,sint,cost,SigneSqrtDis;
|
|
Standard_Real z1,z2;
|
|
|
|
A=0.0; B=0.0; C=0.0;
|
|
U=0.0; V=0.0;
|
|
sint=0.0; cost=0.0;
|
|
SigneSqrtDis=0.0;
|
|
//U=V=A=B=C=sint=cost=SigneSqrtDis=0.0;
|
|
//
|
|
if (!firstbounded && tmin > theta && (tmin-theta) <= epsAng) {
|
|
theta = tmin;
|
|
}
|
|
else if (!lastbounded && theta > tmax && (theta-tmax) <= epsAng) {
|
|
theta = tmax;
|
|
}
|
|
//
|
|
if (theta < tmin ) {
|
|
theta = theta + PIpPI;
|
|
}
|
|
else if (theta > tmax) {
|
|
theta = theta - PIpPI;
|
|
}
|
|
if (theta < tmin || theta > tmax) {
|
|
if(theta>tmax) {
|
|
InternalUVValue(tmax,U,V,A,B,C,cost,sint,SigneSqrtDis);
|
|
gp_Pnt PMax(InternalValue(U,V));
|
|
if(PMax.Distance(P) < aTolPrecision) {
|
|
Para = tmax;
|
|
return(Standard_True);
|
|
}
|
|
}
|
|
if(theta<tmin) {
|
|
InternalUVValue(tmin,U,V,A,B,C,cost,sint,SigneSqrtDis);
|
|
gp_Pnt PMin(InternalValue(U,V));
|
|
if(PMin.Distance(P) < aTolPrecision) {
|
|
Para = tmin;
|
|
return(Standard_True);
|
|
}
|
|
}
|
|
//-- lbr le 14 Fev 96 : On teste malgre tout si le point n est pas le
|
|
//-- point de debut ou de fin
|
|
//-- cout<<"False 1 "<<endl;
|
|
// theta = tmin; le 25 Nov 96
|
|
}
|
|
|
|
if (TwoCurves) {
|
|
if(theta > tmax)
|
|
theta = tmax;
|
|
if(theta < tmin)
|
|
theta = tmin;
|
|
InternalUVValue(theta,U,z1,A,B,C,cost,sint,SigneSqrtDis);
|
|
A = B = C = sint = cost = SigneSqrtDis = 0.0;
|
|
InternalUVValue(tmax+tmax - theta,U,z2,A,B,C,cost,sint,SigneSqrtDis);
|
|
|
|
if (Abs(z-z1) <= Abs(z-z2)) {
|
|
Para = theta;
|
|
}
|
|
else {
|
|
Para = tmax+tmax - theta;
|
|
}
|
|
}
|
|
else {
|
|
Para = theta;
|
|
}
|
|
|
|
if((Para<DomainInf) || ((Para>DomainSup) && (!TwoCurves))
|
|
|| (Para>(DomainSup+DomainSup-DomainInf+0.00000000000001))) {
|
|
return(Standard_False);
|
|
}
|
|
|
|
InternalUVValue(Para,U,V,A,B,C,cost,sint,SigneSqrtDis);
|
|
gp_Pnt PPara = InternalValue(U,V);
|
|
Standard_Real Dist = PPara.Distance(P);
|
|
if(Dist > aTolPrecision) {
|
|
//-- Il y a eu un probleme
|
|
//-- On teste si le point est un point double
|
|
InternalUVValue(tmin,U,V,A,B,C,cost,sint,SigneSqrtDis);
|
|
PPara = InternalValue(U,V);
|
|
Dist = PPara.Distance(P);
|
|
if(Dist <= aTolPrecision) {
|
|
Para = tmin;
|
|
return(Standard_True);
|
|
}
|
|
|
|
InternalUVValue(tmax,U,V,A,B,C,cost,sint,SigneSqrtDis);
|
|
PPara = InternalValue(U,V);
|
|
Dist = PPara.Distance(P);
|
|
if(Dist <= aTolPrecision) {
|
|
Para = tmax;
|
|
return(Standard_True);
|
|
}
|
|
if (TwoCurves) {
|
|
Standard_Real Theta = DomainSup+DomainSup-DomainInf;
|
|
InternalUVValue(Theta,U,V,A,B,C,cost,sint,SigneSqrtDis);
|
|
PPara = InternalValue(U,V);
|
|
Dist = PPara.Distance(P);
|
|
if(Dist <= aTolPrecision) {
|
|
Para = Theta;
|
|
return(Standard_True);
|
|
}
|
|
}
|
|
return(Standard_False);
|
|
}
|
|
return(Standard_True);
|
|
}
|
|
//=======================================================================
|
|
//function : InternalValue
|
|
//purpose :
|
|
//=======================================================================
|
|
gp_Pnt IntAna_Curve::InternalValue(const Standard_Real U,
|
|
const Standard_Real _V) const
|
|
{
|
|
//-- cout<<" ["<<U<<","<<V<<"]";
|
|
Standard_Real V = _V;
|
|
if(V > 100000.0 ) { V= 100000.0; }
|
|
if(V < -100000.0 ) { V=-100000.0; }
|
|
|
|
switch(typequadric) {
|
|
case GeomAbs_Cone:
|
|
{
|
|
//------------------------------------------------
|
|
//-- Parametrage : X = V * Cos(U) ---
|
|
//-- Y = V * Sin(U) ---
|
|
//-- Z = (V-RCyl) / Tan(SemiAngle)--
|
|
//------------------------------------------------
|
|
//-- Angle Vaut Cone.SemiAngle()
|
|
return(ElSLib::ConeValue(U,(V-RCyl)/Sin(Angle),Ax3,RCyl,Angle));
|
|
}
|
|
break;
|
|
|
|
case GeomAbs_Cylinder:
|
|
return(ElSLib::CylinderValue(U,V,Ax3,RCyl));
|
|
case GeomAbs_Sphere:
|
|
return(ElSLib::SphereValue(U,V,Ax3,RCyl));
|
|
default:
|
|
return(gp_Pnt(0.0,0.0,0.0));
|
|
}
|
|
}
|
|
|
|
//
|
|
//=======================================================================
|
|
//function : SetDomain
|
|
//purpose :
|
|
//=======================================================================
|
|
void IntAna_Curve::SetDomain(const Standard_Real DInf,
|
|
const Standard_Real DSup)
|
|
{
|
|
if(DInf>=DSup) {
|
|
Standard_DomainError::Raise("IntAna_Curve::Domain");
|
|
}
|
|
//
|
|
DomainInf=DInf;
|
|
DomainSup=DSup;
|
|
}
|