//======================================================================
-// Modified by skv - Tue Mar 1 14:22:09 2005 OCC8169 Begin
-// #define NBITER_MAX_POLYGON 3
#define NBITER_MAX_POLYGON 10
-// Modified by skv - Tue Mar 1 14:22:09 2005 OCC8169 End
#define TOL_CONF_MINI 0.0000000001
#define TOL_MINI 0.0000000001
//======================================================================
-IntCurve_IntPolyPolyGen::IntCurve_IntPolyPolyGen(void) {
+IntCurve_IntPolyPolyGen::IntCurve_IntPolyPolyGen()
+{
+ const Standard_Integer aMinPntNb = 20; // Minimum number of samples.
+ myMinPntNb = aMinPntNb;
done = Standard_False;
}
//======================================================================
Standard_Real TlConf=(TheTolConf < TOL_CONF_MINI)? TOL_CONF_MINI : TheTolConf;
Perform(C1,D1,C2,D2,TlConf,Tl,0,DU,DV);
//----------------------------------------------------------------------
- //-- Traitement des points en bouts
+ //-- Processing of end points
//----------------------------------------------------------------------
Standard_Boolean HeadOn1 = Standard_False;
Standard_Boolean HeadOn2 = Standard_False;
//--------------------------------------------------------------------
- //-- On ne rejette les points Head Head ... End End
- //-- si ils figurent deja dans un bout de segment
- //-- ( On ne peut pas tester les egalites sur les parametres)
- //-- ( ces points n etant pas trouves a EpsX pres )
- //-- PosSegment = 1 si Head Head
- //-- 2 si Head End
- //-- 4 si End Head
- //-- 8 si End End
+ //-- The points Head Head ... End End are not rejected if
+ //-- they are already present at the end of segment
+ //-- ( It is not possible to test the equities on the parameters)
+ //-- ( these points are not found at EpsX precision )
+ //-- PosSegment = 1 if Head Head
+ //-- 2 if Head End
+ //-- 4 if End Head
+ //-- 8 if End End
//--------------------------------------------------------------------
Standard_Integer PosSegment = 0;
Standard_Integer n=this->NbPoints();
//--------------------------------------------------------------------
- //-- On ne rejette les points Head Head ... End End
- //-- si ils figurent deja dans un bout de segment
- //-- ( On ne peut pas tester les egalites sur les parametres)
- //-- ( ces points n etant pas trouves a EpsX pres )
- //-- PosSegment = 1 si Head Head
- //-- 2 si Head End
- //-- 4 si End Head
- //-- 8 si End End
+ //-- The points Head Head ... End End are not rejected if
+ //-- they are already present at the end of segment
+ //-- ( It is not possible to test the equities on the parameters)
+ //-- ( these points are not found at EpsX precision )
+ //-- PosSegment = 1 if Head Head
+ //-- 2 if Head End
+ //-- 4 if End Head
+ //-- 8 if End End
//--------------------------------------------------------------------
Standard_Integer PosSegment = 0;
if(NbIter>3 || (NbIter>2 && nbsamples>100)) return;
- nbsamples*=2; //--- On prend systematiquement 2 fois plus de points que
- //-- sur une courbe normale.
- //-- Les courbes auto-intersectantes donne souvent des
- //-- polygones assez loin de la courbe a parametre ct.
+ nbsamples*=2; //--- We take systematically two times more points
+ //-- than on a normal curve.
+ //-- Auto-intersecting curves often produce
+ //-- polygons rather far from the curve with parameter ct.
if(NbIter>0) {
nbsamples=(3*(nbsamples*NbIter))/2;
}
//-- Poly1.Dump();
//----------------------------------------------------------------------
- //-- Si la deflection est inferieure a la Tolerance de Confusion
- //-- Alors la deflection du polygone est fixee a TolConf
- //-- (Detection des Zones de Tangence)
+ //-- If the deflection is less than the Tolerance of Confusion
+ //-- then the deflection of the polygon is set in TolConf
+ //-- (Detection of Tangency Zones)
//----------------------------------------------------------------------
if(Poly1.DeflectionOverEstimation() < TolConf) {
Poly1.SetDeflectionOverEstimation(TolConf);
Standard_Real U,V;
//----------------------------------------------------------------------
- //-- Traitement des SectionPoint
+ //-- Processing of SectionPoint
//----------------------------------------------------------------------
Standard_Integer Nbsp = InterPP.NbSectionPoints();
if(Nbsp>=1) {
//-- ---------------------------------------------------------------------
- //-- tri tri tri tri tri tri tri tri tri tri tri tri tri tri
+ //-- filtering, filtering, filtering ...
//--
Standard_Integer* TriIndex = new Standard_Integer [Nbsp+1];
Standard_Integer* PtrSegIndex1 = new Standard_Integer [Nbsp+1];
EIP.Perform(Poly1,Poly1,SegIndex1,SegIndex2,ParamOn1,ParamOn2);
if(EIP.NbRoots()==0) {
- //-- On supprime tous les segments voisins
+ //-- All neighbor segments are removed
for(Standard_Integer k=sp+1;k<=Nbsp;k++) {
Standard_Integer kk=TriIndex[k];
// --- avoid negative indicies as well as in outer done
}
else if(EIP.NbRoots()>=1) {
//--------------------------------------------------------------------
- //-- On verifie que le point trouve est bien une racine
+ //-- It is checked if the found point is a root
//--------------------------------------------------------------------
EIP.Roots(U,V);
if(Abs(U-V)<=EpsX1) {
//-----------------------------------------
- //-- Solution non valide
- //-- Les maths ont du converger vers une
- //-- solution triviale ( point U = V )
+ //-- Solution not valid
+ //-- The maths should have converged in a
+ //-- trivial solution ( point U = V )
//-----------------------------------------
Dist = TolConf+1.0;
}
//-----------------------------------------------------------------
- //-- On verifie que le point (u,v) n existe pas deja
+ //-- It is checked if the point (u,v) already exists
//--
done = Standard_True;
Standard_Integer nbp=NbPoints();
}
}
- if(Dist <= TolConf) { //-- Ou le point est deja present
+ if(Dist <= TolConf) { //-- Or the point is already present
IntRes2d_Position Pos1 = IntRes2d_Middle;
IntRes2d_Position Pos2 = IntRes2d_Middle;
IntRes2d_Transition Trans1,Trans2;
//-----------------------------------------------------------------
- //-- Calcul des Positions des Points sur la courbe
+ //-- Calculate Positions of Points on the curve
//--
if(P1.Distance(DomainOnCurve1.FirstPoint())<=DomainOnCurve1.FirstTolerance())
Pos1 = IntRes2d_Head;
}
//--------------------------------------------------------------------
- //-- On Teste si un point de bout de segment a deja ces trnasitions
- //-- Si Oui, on ne cree pas de nouveau point
+ //-- It is tested if a point at the end of segment already has its transitions
+ //-- If Yes, the new point is not created
//--
- //-- PosSegment = 1 si Head Head
- //-- 2 si Head End
- //-- 4 si End Head
- //-- 8 si End End
+ //-- PosSegment = 1 if Head Head
+ //-- 2 if Head End
+ //-- 4 if End Head
+ //-- 8 if End End
//--------------------------------------------------------------------
if(Pos1 == IntRes2d_Head) {
if((Pos2 == IntRes2d_Head)&&(PosSegment & 1)) return(Standard_False);
return(Standard_False);
}
-
-//======================================================================
-void IntCurve_IntPolyPolyGen::Perform( const TheCurve& C1
- ,const IntRes2d_Domain& D1
- ,const TheCurve& C2
- ,const IntRes2d_Domain& D2
- ,const Standard_Real TolConf
- ,const Standard_Real Tol
- ,const Standard_Integer NbIter
- ,const Standard_Real DeltaU
- ,const Standard_Real DeltaV) {
-
+//=======================================================================
+//function : Perform
+//purpose : Base method to perform polyline / polyline intersection for
+// pair of curves.
+//=======================================================================
+void IntCurve_IntPolyPolyGen::Perform(const TheCurve& C1,
+ const IntRes2d_Domain& D1,
+ const TheCurve& C2,
+ const IntRes2d_Domain& D2,
+ const Standard_Real TolConf,
+ const Standard_Real Tol,
+ const Standard_Integer NbIter,
+ const Standard_Real DeltaU,
+ const Standard_Real DeltaV)
+{
Standard_Integer nbsamplesOnC1,nbsamplesOnC2;
done = Standard_False;
if(NbIter>NBITER_MAX_POLYGON) return;
- nbsamplesOnC1 = TheCurveTool::NbSamples(C1,D1.FirstParameter(),D1.LastParameter());
+ // Number of samples tunning.
+ nbsamplesOnC1 = TheCurveTool::NbSamples(C1,D1.FirstParameter(),D1.LastParameter());
+ nbsamplesOnC2 = TheCurveTool::NbSamples(C2,D2.FirstParameter(),D2.LastParameter());
- if (NbIter == 0) // first time
+ if (NbIter == 0)
{
- if (nbsamplesOnC1 < 20)
- nbsamplesOnC1 = 20;
+ // Minimal number of points.
+ nbsamplesOnC1 = Max(nbsamplesOnC1, myMinPntNb);
+ nbsamplesOnC2 = Max(nbsamplesOnC2, myMinPntNb);
}
- else // NbIter > 0
+ else
{
- nbsamplesOnC1=(5*(nbsamplesOnC1*NbIter))/4;
+ // Increase number of samples in second and next iterations.
+ nbsamplesOnC1=(5 * (nbsamplesOnC1 * NbIter)) / 4;
+ nbsamplesOnC2=(5 * (nbsamplesOnC2 * NbIter)) / 4;
}
- /////////////////////////////////////////////
- nbsamplesOnC2 = TheCurveTool::NbSamples(C2,D2.FirstParameter(),D2.LastParameter());
-
- if (NbIter == 0) // first time
- {
- if (nbsamplesOnC2 < 20)
- nbsamplesOnC2 = 20;
- }
- else // NbIter > 0
+ NCollection_Handle<IntCurve_ThePolygon2d>
+ aPoly1 = new IntCurve_ThePolygon2d(C1,nbsamplesOnC1,D1,Tol),
+ aPoly2 = new IntCurve_ThePolygon2d(C2,nbsamplesOnC2,D2,Tol);
+
+ if( (aPoly1->DeflectionOverEstimation() > TolConf) &&
+ (aPoly2->DeflectionOverEstimation() > TolConf))
{
- nbsamplesOnC2=(5*(nbsamplesOnC2*NbIter))/4;
- }
- /////////////////////////////////////////////
+ const Standard_Real aDeflectionSum =
+ Max(aPoly1->DeflectionOverEstimation(), TolConf) +
+ Max(aPoly2->DeflectionOverEstimation(), TolConf);
-
- NCollection_Handle<IntCurve_ThePolygon2d> aPoly1 ,aPoly2;
- if(nbsamplesOnC2 > nbsamplesOnC1) {
- aPoly1 = new IntCurve_ThePolygon2d(C1,nbsamplesOnC1,D1,Tol);
- if(aPoly1->DeflectionOverEstimation() < TolConf) {
- aPoly2 = new IntCurve_ThePolygon2d(C2,nbsamplesOnC2,D2,Tol);
- }
- else {
- aPoly2 = new IntCurve_ThePolygon2d(C2,nbsamplesOnC2,D2,Tol,aPoly1->Bounding());
- aPoly1->SetDeflectionOverEstimation( aPoly2->DeflectionOverEstimation()
- + aPoly1->DeflectionOverEstimation());
- aPoly1->ComputeWithBox(C1,aPoly2->Bounding());
- }
- }
- else {
- aPoly2 = new IntCurve_ThePolygon2d(C2,nbsamplesOnC2,D2,Tol);
- if(aPoly2->DeflectionOverEstimation() < TolConf) {
- aPoly1 = new IntCurve_ThePolygon2d(C1,nbsamplesOnC1,D1,Tol);
+ if (nbsamplesOnC2 > nbsamplesOnC1)
+ {
+ aPoly2->ComputeWithBox(C2, aPoly1->Bounding());
+ aPoly1->SetDeflectionOverEstimation(aDeflectionSum);
+ aPoly1->ComputeWithBox(C1, aPoly2->Bounding());
}
- else {
- aPoly1 = new IntCurve_ThePolygon2d(C1,nbsamplesOnC1,D1,Tol,aPoly2->Bounding());
- aPoly2->SetDeflectionOverEstimation( aPoly2->DeflectionOverEstimation()
- + aPoly1->DeflectionOverEstimation());
- aPoly2->ComputeWithBox(C2,aPoly1->Bounding());
+ else
+ {
+ aPoly1->ComputeWithBox(C1, aPoly2->Bounding());
+ aPoly2->SetDeflectionOverEstimation(aDeflectionSum);
+ aPoly2->ComputeWithBox(C2, aPoly1->Bounding());
}
}
+
//----------------------------------------------------------------------
- //-- Si la deflection est inferieure a la Tolerance de Confusion
- //-- Alors la deflection du polygone est fixee a TolConf
- //-- (Detection des Zones de Tangence)
+ //-- if the deflection less then the Tolerance of Confusion
+ //-- Then the deflection of the polygon is set in TolConf
+ //-- (Detection of Tangency Zones)
//----------------------------------------------------------------------
if(aPoly1->DeflectionOverEstimation() < TolConf) {
if(aPoly2->DeflectionOverEstimation() < TolConf) {
aPoly2->SetDeflectionOverEstimation(TolConf);
}
- //for case when a few polygon points were replaced by line
- //if exact solution was not found
- //then search of precise solution will be repeat
- //for polygon conatins all initial points
- //secondary search will be performed only for case when initial points
- //were dropped
+ // for case when a few polygon points were replaced by line
+ // if exact solution was not found
+ // then search of precise solution will be repeated
+ // for polygon contains all initial points
+ // secondary search will be performed only for case when initial points
+ // were dropped
Standard_Boolean isFullRepresentation = ( aPoly1->NbSegments() == nbsamplesOnC1 &&
aPoly2->NbSegments() == nbsamplesOnC2 );
Standard_Boolean AnErrorOccurred = Standard_False;
done = Standard_True; // To prevent exception in nbp=NbPoints();
//----------------------------------------------------------------------
- //-- Traitement des SectionPoint
+ //-- Processing of SectionPoint
//----------------------------------------------------------------------
Standard_Integer Nbsp = InterPP.NbSectionPoints();
for(Standard_Integer sp=1; sp <= Nbsp; sp++) {
}
//--------------------------------------------------------------------
- //-- On verifie que le point trouve est bien une racine
+ //-- It is checked if the found point is really a root
//--------------------------------------------------------------------
EIP.Roots(U,V);
Dist = P1.Distance(P2);
}
//-----------------------------------------------------------------
- //-- On verifie que le point (u,v) n existe pas deja
+ //-- It is checked if the point (u,v) does not exist already
//--
Standard_Integer nbp=NbPoints();
Standard_Real EpsX1 = 10.0*TheCurveTool::EpsX(C1);
}
}
- if(Dist <= TolConf) { //-- Ou le point est deja present
+ if(Dist <= TolConf) { //-- Or the point is already present
IntRes2d_Position Pos1 = IntRes2d_Middle;
IntRes2d_Position Pos2 = IntRes2d_Middle;
IntRes2d_Transition Trans1,Trans2;
//-----------------------------------------------------------------
- //-- Calcul des Positions des Points sur la courbe
+ //-- Calculate the Positions of Points on the curve
//--
if(P1.Distance(DomainOnCurve1.FirstPoint())<=DomainOnCurve1.FirstTolerance())
Pos1 = IntRes2d_Head;
else if(P2.Distance(DomainOnCurve2.LastPoint())<=DomainOnCurve2.LastTolerance())
Pos2 = IntRes2d_End;
//-----------------------------------------------------------------
- //-- Calcul des Transitions (Voir IntImpParGen.cxx)
+ //-- Calculate the Transitions (see IntImpParGen.cxx)
//--
if(IntImpParGen::DetermineTransition (Pos1, Tan1, Trans1, Pos2, Tan2, Trans2, TolConf) == Standard_False) {
TheCurveTool::D2(C1,U,P1,Tan1,Norm1);
}
//----------------------------------------------------------------------
- //-- Traitement des TangentZone
+ //-- Processing of TangentZone
//----------------------------------------------------------------------
Standard_Integer Nbtz = InterPP.NbTangentZones();
for(Standard_Integer tz=1; tz <= Nbtz; tz++) {
Standard_Integer NbPnts = InterPP.ZoneValue(tz).NumberOfPoints();
//====================================================================
- //== Recherche du premier et du dernier point dans la zone de tg.
+ //== Find the first and the last point in the tangency zone.
//====================================================================
Standard_Real ParamSupOnCurve2,ParamInfOnCurve2;
Standard_Real ParamSupOnCurve1,ParamInfOnCurve1;
for(Standard_Integer qq=1;qq<=NbPnts;qq++) {
const Intf_SectionPoint& SPnt1 = InterPP.ZoneValue(tz).GetPoint(qq);
//====================================================================
- //== On discretise sur les zones de tangence
- //== Test d arret :
- //== Compteur
- //== Deflection < Tolerance
- //== OU Echantillon < EpsX (normalement la premiere condition est
- //== plus severe)
+ //== The zones of tangency are discretized
+ //== Test of stop : Check if
+ //== (Deflection < Tolerance)
+ //== Or (Sample < EpsX) (normally the first condition is
+ //== more strict)
//====================================================================
// Standard_Real _PolyUInf,_PolyUSup,_PolyVInf,_PolyVSup;
Standard_Real _PolyUInf,_PolyVInf;
,ParamInfOnCurve2,TolConf
,TheCurveTool::Value(C2,ParamSupOnCurve2)
,ParamSupOnCurve2,TolConf);
- //-- On ne delete pas thePoly1(2) ,
- //-- ils sont detruits enfin de fct.
- //-- !! Pas de return intempestif !!
+ //-- thePoly1(2) are not deleted,
+ //-- finally they are destroyed.
+ //-- !! No untimely return !!
Perform(C1,RecursD1,C2,RecursD2,Tol,TolConf,NbIter+1,DeltaU,DeltaV);
}
else {
//-----------------------------------------------------------------
- //-- Calcul des Positions des Points sur la courbe et des
- //-- Transitions sur chaque borne du segment
+ //-- Calculate Positions of Points on the curve and
+ //-- Transitions on each limit of the segment
IntRes2d_Position Pos1 = IntRes2d_Middle;
IntRes2d_Position Pos2 = IntRes2d_Middle;
}
}
+
+//=======================================================================
+//function : GetMinNbPoints
+//purpose :
+//=======================================================================
+Standard_Integer IntCurve_IntPolyPolyGen::GetMinNbSamples() const
+{
+ return myMinPntNb;
+}
+
+//=======================================================================
+//function : SetMinNbPoints
+//purpose :
+//=======================================================================
+void IntCurve_IntPolyPolyGen::SetMinNbSamples(const Standard_Integer theMinNbSamples)
+{
+ myMinPntNb = theMinNbSamples;
+}
projects / occt.git / blobdiff