1 // Created on: 1993-02-02
2 // Created by: Laurent BUCHARD
3 // Copyright (c) 1993-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.
17 // modified by Edward AGAPOV (eap) Tue Jan 22 12:29:55 2002
18 // modified by Oleg FEDYAED (ofv) Fri Nov 29 16:08:02 2002
20 #include <Adaptor3d_Surface.hxx>
21 #include <Adaptor3d_TopolTool.hxx>
24 #include <Intf_PIType.hxx>
25 #include <Intf_SectionLine.hxx>
26 #include <Intf_SectionPoint.hxx>
27 #include <Intf_TangentZone.hxx>
28 #include <IntPatch_InterferencePolyhedron.hxx>
29 #include <IntPatch_Line.hxx>
30 #include <IntPatch_Polyhedron.hxx>
31 #include <IntPatch_PrmPrmIntersection.hxx>
32 #include <IntPatch_PrmPrmIntersection_T3Bits.hxx>
33 #include <IntPatch_RstInt.hxx>
34 #include <IntPatch_WLine.hxx>
35 #include <IntPolyh_Intersection.hxx>
36 #include <IntSurf_LineOn2S.hxx>
37 #include <IntSurf_ListIteratorOfListOfPntOn2S.hxx>
38 #include <IntSurf_PntOn2S.hxx>
39 #include <IntWalk_PWalking.hxx>
40 #include <Standard_OutOfRange.hxx>
41 #include <StdFail_NotDone.hxx>
42 #include <TColStd_Array1OfReal.hxx>
43 #include <TColStd_HArray1OfReal.hxx>
44 #include <TColStd_SequenceOfInteger.hxx>
46 static void SectionPointToParameters(const Intf_SectionPoint& Sp,
47 const IntPatch_Polyhedron& Surf1,
48 const IntPatch_Polyhedron& Surf2,
56 void AdjustOnPeriodic(const Handle(Adaptor3d_Surface)& Surf1,
57 const Handle(Adaptor3d_Surface)& Surf2,
58 IntPatch_SequenceOfLine& aSLin);
61 IntSurf_PntOn2S MakeNewPoint(const IntSurf_PntOn2S& replacePnt,
62 const IntSurf_PntOn2S& oldPnt,
63 const Standard_Real* Periods);
65 static Standard_Boolean IsPointOnLine(const IntSurf_PntOn2S &thePOn2S,
66 const Handle(IntPatch_WLine) &theWLine,
67 const Standard_Real Deflection);
69 static void AddWLine(IntPatch_SequenceOfLine &theLines,
70 const Handle(IntPatch_WLine) &theWLine,
71 const Standard_Real Deflection);
73 static void SeveralWlinesProcessing(const Handle(Adaptor3d_Surface)& theSurf1,
74 const Handle(Adaptor3d_Surface)& theSurf2,
75 const IntPatch_SequenceOfLine& theSLin,
76 const Standard_Real* const thePeriodsArr,
77 const IntSurf_TypeTrans theTrans1,
78 const IntSurf_TypeTrans theTrans2,
79 const Standard_Real theTol,
80 const Standard_Real theMaxStepS1,
81 const Standard_Real theMaxStepS2,
82 Handle(IntPatch_WLine)& theWLline)
84 if(theSLin.Length() == 0)
87 Standard_Real aU1 = 0.0, aV1 = 0.0, aU2 = 0.0, aV2 = 0.0;
89 Standard_Integer cnbV = theWLline->NbVertex();
91 for( ciV = 1; ciV <= cnbV; ciV++ )
93 Standard_Real pntDMin = 1.e+100;
94 Standard_Integer VDMin = 0;
95 Standard_Integer WLDMin = 0;
96 gp_Pnt cPV = theWLline->Vertex(ciV).Value();
97 theWLline->Vertex(ciV).Parameters(aU1, aV1, aU2, aV2);
98 const gp_Pnt2d aPCS1(aU1, aV1), aPCS2(aU2, aV2);
100 for( iL = 1; iL <= theSLin.Length(); iL++)
102 const Handle(IntPatch_Line)& aSLine = theSLin.Value(iL);
103 IntPatch_IType aType = aSLine->ArcType();
104 if( aType != IntPatch_Walking)
106 const Handle(IntPatch_WLine) aWLine = Handle(IntPatch_WLine)::DownCast(aSLine);
107 Standard_Integer tnbV = aWLine->NbVertex();
108 Standard_Integer tiV;
109 for( tiV = 1; tiV <= tnbV; tiV++ )
111 gp_Pnt tPV = aWLine->Vertex(tiV).Value();
113 aWLine->Vertex(tiV).Parameters(aU1, aV1, aU2, aV2);
114 const gp_Pnt2d aPTS1(aU1, aV1), aPTS2(aU2, aV2);
116 Standard_Real tDistance = cPV.Distance(tPV);
117 Standard_Real uRs1 = theSurf1->UResolution(tDistance);
118 Standard_Real vRs1 = theSurf1->VResolution(tDistance);
119 Standard_Real uRs2 = theSurf2->UResolution(tDistance);
120 Standard_Real vRs2 = theSurf2->VResolution(tDistance);
121 Standard_Real RmaxS1 = Max(uRs1,vRs1);
122 Standard_Real RmaxS2 = Max(uRs2,vRs2);
124 if(RmaxS1 < theMaxStepS1 && RmaxS2 < theMaxStepS2)
126 if( pntDMin > tDistance && tDistance > Precision::PConfusion())
128 const Standard_Real aSqDist1 = aPCS1.SquareDistance(aPTS1),
129 aSqDist2 = aPCS2.SquareDistance(aPTS2);
130 if((aSqDist1 < RmaxS1*RmaxS1) && (aSqDist2 < RmaxS2*RmaxS2))
143 const Handle(IntPatch_Line)& aSLine = theSLin.Value(WLDMin);
144 const Handle(IntPatch_WLine) aWLine = Handle(IntPatch_WLine)::DownCast(aSLine);
145 Standard_Integer tiVpar = (Standard_Integer)aWLine->Vertex(VDMin).ParameterOnLine();
146 Standard_Integer ciVpar = (Standard_Integer)theWLline->Vertex(ciV).ParameterOnLine();
147 Standard_Real u11 = 0., u12 = 0., v11 = 0., v12 = 0.;
148 Standard_Real u21 = 0., u22 = 0., v21 = 0., v22 = 0.;
149 theWLline->Point(ciVpar).Parameters(u11,v11,u12,v12);
150 aWLine->Point(tiVpar).Parameters(u21,v21,u22,v22);
152 Handle(IntSurf_LineOn2S) newL2s = new IntSurf_LineOn2S();
153 IntSurf_PntOn2S replacePnt = aWLine->Point(tiVpar);
154 Standard_Integer cNbP = theWLline->NbPnts();
156 TColStd_SequenceOfInteger VPold;
157 Standard_Integer iPo;
158 for( iPo = 1; iPo <= cnbV; iPo++ )
160 Standard_Real Po = theWLline->Vertex(iPo).ParameterOnLine();
161 Standard_Integer IPo = (Standard_Integer) Po;
165 Standard_Boolean removeNext = Standard_False;
166 Standard_Boolean removePrev = Standard_False;
169 Standard_Integer dPar = Abs( VPold.Value(ciV) - VPold.Value(ciV+1));
172 removeNext = Standard_True;
173 for( iPo = (ciV+1); iPo <= cnbV; iPo++ )
174 VPold.SetValue(iPo, VPold.Value(iPo) - 1 );
177 else if( ciV == cnbV)
179 Standard_Integer dPar = Abs( VPold.Value(ciV) - VPold.Value(ciV-1));
182 removePrev = Standard_True;
183 VPold.SetValue(ciV, VPold.Value(ciV) - 1 );
188 Standard_Integer dParMi = Abs( VPold.Value(ciV) - VPold.Value(ciV-1));
189 Standard_Integer dParMa = Abs( VPold.Value(ciV) - VPold.Value(ciV+1));
192 removePrev = Standard_True;
193 VPold.SetValue(ciV, VPold.Value(ciV) - 1 );
198 removeNext = Standard_True;
199 for( iPo = (ciV+1); iPo <= cnbV; iPo++ )
202 VPold.SetValue(iPo, VPold.Value(iPo) - 2 );
204 VPold.SetValue(iPo, VPold.Value(iPo) - 1 );
210 for( iPo = (ciV+1); iPo <= cnbV; iPo++ )
211 VPold.SetValue(iPo, VPold.Value(iPo) - 1 );
215 Standard_Integer pI = ciVpar;
218 for( iP = 1; iP <= cNbP; iP++)
222 IntSurf_PntOn2S newPnt = MakeNewPoint(replacePnt, theWLline->Point(iP), thePeriodsArr);
225 else if(removeNext && iP == (pI + 1))
227 else if(removePrev && iP == (pI - 1))
230 newL2s->Add(theWLline->Point(iP));
233 IntPatch_Point newVtx;
234 gp_Pnt Pnt3dV = aWLine->Vertex(VDMin).Value();
235 newVtx.SetValue(Pnt3dV,theTol,Standard_False);
236 newVtx.SetParameters(u21,v21,u22,v22);
237 newVtx.SetParameter(VPold.Value(ciV));
239 Handle(IntPatch_WLine) NWLine = new IntPatch_WLine(newL2s,Standard_False,theTrans1,theTrans2);
240 NWLine->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
243 for( iV = 1; iV <= cnbV; iV++ )
246 NWLine->AddVertex(newVtx);
249 IntPatch_Point theVtx = theWLline->Vertex(iV);
250 theVtx.SetParameter(VPold.Value(iV));
251 NWLine->AddVertex(theVtx);
257 }//for( ciV = 1; ciV <= cnbV; ciV++ )
260 //=======================================================================
261 //function : DublicateOfLinesProcessing
262 //purpose : Decides, if rejecting current line is necessary
263 //=======================================================================
264 static void DublicateOfLinesProcessing( const IntWalk_PWalking& thePW,
265 const Standard_Integer theWLID,
266 IntPatch_SequenceOfLine& theLines,
267 Standard_Boolean& theIsRejectReq)
269 const Handle(IntPatch_WLine)& anExistWL =
270 *((Handle(IntPatch_WLine)*)&theLines.Value(theWLID));
271 const Standard_Integer aNbPrevPoints = anExistWL->NbPnts();
272 const Standard_Integer aNbCurrPoints = thePW.NbPoints();
274 if(aNbPrevPoints < aNbCurrPoints)
275 {//Remove preview line
276 theLines.Remove(theWLID);
277 theIsRejectReq = Standard_False;
279 else if(aNbPrevPoints == aNbCurrPoints)
281 Standard_Real aLPrev = 0.0, aLCurr = 0.0;
282 for(Standard_Integer aNbPP = 1; aNbPP < aNbPrevPoints; aNbPP++)
284 const gp_Pnt aP1prev(anExistWL->Point(aNbPP).Value()),
285 aP2prev(anExistWL->Point(aNbPP+1).Value());
286 const gp_Pnt aP1curr(thePW.Value(aNbPP).Value()),
287 aP2curr(thePW.Value(aNbPP+1).Value());
289 aLPrev += aP1prev.Distance(aP2prev);
290 aLCurr += aP1curr.Distance(aP2curr);
294 {//Remove preview line
295 theLines.Remove(theWLID);
296 theIsRejectReq = Standard_False;
301 //==================================================================================
304 //==================================================================================
305 IntPatch_PrmPrmIntersection::IntPatch_PrmPrmIntersection()
306 : done(Standard_False),
311 //==================================================================================
312 // function : Perform
314 //==================================================================================
315 void IntPatch_PrmPrmIntersection::Perform (const Handle(Adaptor3d_Surface)& Surf1,
316 const Handle(Adaptor3d_TopolTool)& D1,
317 const Standard_Real TolTangency,
318 const Standard_Real Epsilon,
319 const Standard_Real Deflection,
320 const Standard_Real Increment)
322 IntPatch_Polyhedron Poly1( Surf1, D1->NbSamplesU(), D1->NbSamplesV() );
323 Perform( Surf1, Poly1, D1, TolTangency, Epsilon, Deflection, Increment );
326 //==================================================================================
327 // function : Perform
329 //==================================================================================
330 void IntPatch_PrmPrmIntersection::Perform (const Handle(Adaptor3d_Surface)& Surf1,
331 const IntPatch_Polyhedron& Poly1,
332 const Handle(Adaptor3d_TopolTool)& D1,
333 const Handle(Adaptor3d_Surface)& Surf2,
334 const Handle(Adaptor3d_TopolTool)& D2,
335 const Standard_Real TolTangency,
336 const Standard_Real Epsilon,
337 const Standard_Real Deflection,
338 const Standard_Real Increment)
340 IntPatch_Polyhedron Poly2( Surf2 );
341 Perform( Surf1, Poly1, D1, Surf2, Poly2, D2, TolTangency, Epsilon, Deflection, Increment);
344 //==================================================================================
345 // function : Perform
347 //==================================================================================
348 void IntPatch_PrmPrmIntersection::Perform (const Handle(Adaptor3d_Surface)& Surf1,
349 const Handle(Adaptor3d_TopolTool)& D1,
350 const Handle(Adaptor3d_Surface)& Surf2,
351 const IntPatch_Polyhedron& Poly2,
352 const Handle(Adaptor3d_TopolTool)& D2,
353 const Standard_Real TolTangency,
354 const Standard_Real Epsilon,
355 const Standard_Real Deflection,
356 const Standard_Real Increment)
358 IntPatch_Polyhedron Poly1( Surf1 );
359 Perform( Surf1, Poly1, D1, Surf2, Poly2, D2, TolTangency, Epsilon, Deflection, Increment );
362 //==================================================================================
363 // function : Perform
365 //==================================================================================
366 void IntPatch_PrmPrmIntersection::Perform (const Handle(Adaptor3d_Surface)& Surf1,
367 const IntPatch_Polyhedron& Poly1,
368 const Handle(Adaptor3d_TopolTool)& D1,
369 const Handle(Adaptor3d_Surface)& Surf2,
370 const IntPatch_Polyhedron& Poly2,
371 const Handle(Adaptor3d_TopolTool)& D2,
372 const Standard_Real TolTangency,
373 const Standard_Real Epsilon,
374 const Standard_Real Deflection,
375 const Standard_Real Increment)
377 IntPatch_InterferencePolyhedron Interference(Poly1,Poly2);
378 empt = Standard_True;
379 done = Standard_True;
382 Standard_Integer nbLigSec = Interference.NbSectionLines();
383 Standard_Integer nbTanZon = Interference.NbTangentZones();
385 Standard_Integer NbLigCalculee = 0;
387 Standard_Real U1,U2,V1,V2;
388 Standard_Real pu1,pu2,pv1,pv2;
390 TColStd_Array1OfReal StartParams(1,4);
392 IntWalk_PWalking PW( Surf1, Surf2, TolTangency, Epsilon, Deflection, Increment );
394 Standard_Real SeuildPointLigne = 15.0 * Increment * Increment; //-- 10 est insuffisant
395 Standard_Real incidence;
396 Standard_Real dminiPointLigne;
398 Standard_Boolean HasStartPoint,RejetLigne;
400 IntSurf_PntOn2S StartPOn2S;
402 Standard_Integer ver;
404 gp_Pnt Point3dDebut,Point3dFin;
406 if( nbLigSec >= 1 ) {
407 Standard_Integer *TabL = new Standard_Integer [nbLigSec+1];
409 for( ls = 1; ls <= nbLigSec; ls++ )
412 Standard_Boolean triok;
415 for(Standard_Integer b=2; b<=nbLigSec; b++) {
416 Standard_Integer nb_B = Interference.LineValue(TabL[b]).NumberOfPoints();
417 Standard_Integer nb_A = Interference.LineValue(TabL[b-1]).NumberOfPoints();
419 Standard_Integer tyu=TabL[b];
422 triok=Standard_False;
425 } while( triok==Standard_False );
427 for( ls = 1; ls <= nbLigSec; ls++) {
428 const Intf_SectionLine& LineSec=Interference.LineValue(TabL[ls]);
429 Standard_Integer nbp = LineSec.NumberOfPoints();
431 Standard_Integer *TabPtDep = new Standard_Integer [nbp+1];
432 Standard_Integer ilig;
433 for( ilig = 1; ilig <= nbp; ilig++)
436 Standard_Real UminLig1,VminLig1,UmaxLig1,VmaxLig1;
437 Standard_Real UminLig2,VminLig2,UmaxLig2,VmaxLig2;
439 SectionPointToParameters(LineSec.GetPoint(1),Poly1,Poly2,UminLig1,VminLig1,UminLig2,VminLig2);
446 for( ilig = 2; ilig <= nbp; ilig++ ) {
447 SectionPointToParameters(LineSec.GetPoint(ilig),Poly1,Poly2,U1,V1,U2,V2);
449 if(U1>UmaxLig1) UmaxLig1=U1;
450 if(V1>VmaxLig1) VmaxLig1=V1;
451 if(U2>UmaxLig2) UmaxLig2=U2;
452 if(V2>VmaxLig2) VmaxLig2=V2;
454 if(U1<UminLig1) UminLig1=U1;
455 if(V1<VminLig1) VminLig1=V1;
456 if(U2<UminLig2) UminLig2=U2;
457 if(V2<VminLig2) VminLig2=V2;
460 Standard_Integer nbps2 = (nbp>3)? (nbp/2) : 1;
461 Standard_Integer NombreDePointsDeDepartDuCheminement = 0;
462 Standard_Integer IndicePointdeDepart1 = 0,IndicePointdeDepart2 = 0;
463 Standard_Boolean lignetrouvee=Standard_False;
466 NombreDePointsDeDepartDuCheminement++;
467 if(NombreDePointsDeDepartDuCheminement == 1) {
469 Standard_Integer nbp1_4=nbp/4;
470 Standard_Integer nbp3_4=nbp-nbp1_4;
472 Standard_Integer nsp;
473 for(nsp=nbp/2; nsp<nbp3_4; nsp++) {
474 Standard_Real CurrentIncidence = LineSec.GetPoint(nsp).Incidence();
475 if(CurrentIncidence < incidence) {
477 incidence = 0.9*CurrentIncidence;
481 for(nsp=nbp/2; nsp>nbp1_4; nsp--) {
482 Standard_Real CurrentIncidence = LineSec.GetPoint(nsp).Incidence();
483 if(CurrentIncidence < incidence) {
485 incidence = 0.9*CurrentIncidence;
490 NombreDePointsDeDepartDuCheminement=3;
492 IndicePointdeDepart1 = nbps2;
494 else if(NombreDePointsDeDepartDuCheminement == 2) {
495 if(IndicePointdeDepart1 == 1) {
497 IndicePointdeDepart2 = nbps2;
501 IndicePointdeDepart2 = 1;
504 else if(NombreDePointsDeDepartDuCheminement == 3) {
505 if(IndicePointdeDepart1 == nbp)
506 nbps2 = (IndicePointdeDepart1+IndicePointdeDepart2)/2;
511 nbps2 = NombreDePointsDeDepartDuCheminement-3;
512 NombreDePointsDeDepartDuCheminement++;
515 if(TabPtDep[nbps2]==0) {
517 SectionPointToParameters(LineSec.GetPoint(nbps2),Poly1,Poly2,U1,V1,U2,V2);
524 HasStartPoint = PW.PerformFirstPoint(StartParams,StartPOn2S);
525 dminiPointLigne = SeuildPointLigne + SeuildPointLigne;
528 StartPOn2S.Parameters(pu1,pv1,pu2,pv2);
529 NbLigCalculee = SLin.Length();
531 for( l=1; (l <= NbLigCalculee) && (dminiPointLigne >= SeuildPointLigne); l++) {
532 const Handle(IntPatch_WLine)& testwline = *((Handle(IntPatch_WLine)*)&SLin.Value(l));
534 if (IsPointOnLine(StartPOn2S, testwline, Deflection)) {
535 dminiPointLigne = 0.0;
539 if(dminiPointLigne > SeuildPointLigne) {
540 PW.Perform(StartParams,UminLig1,VminLig1,UminLig2,VminLig2,UmaxLig1,VmaxLig1,UmaxLig2,VmaxLig2);
542 if(PW.NbPoints()>2) {
543 RejetLigne = Standard_False;
544 Point3dDebut = PW.Value(1).Value();
545 const IntSurf_PntOn2S& PointFin = PW.Value(PW.NbPoints());
546 Point3dFin = PointFin.Value();
547 for( ver = 1 ; ver<= NbLigCalculee ; ver++) {
548 const Handle(IntPatch_WLine)& verwline = *((Handle(IntPatch_WLine)*)&SLin.Value(ver));
550 // Check end point if it is on existing line.
551 // Start point is checked before.
552 if (IsPointOnLine(PointFin, verwline, Deflection)) {
553 RejetLigne = Standard_True;
557 const IntSurf_PntOn2S& verPointDebut = verwline->Point(1);
558 const IntSurf_PntOn2S& verPointFin = verwline->Point(verwline->NbPnts());
559 if( (Point3dDebut.Distance(verPointDebut.Value()) <= TolTangency) &&
560 (Point3dFin.Distance(verPointFin.Value()) <= TolTangency))
562 RejetLigne = Standard_True;
569 DublicateOfLinesProcessing(PW, ver, SLin, RejetLigne);
573 // Calculation transition
574 IntSurf_TypeTrans trans1,trans2;
575 Standard_Real locu,locv;
576 gp_Vec norm1,norm2,d1u,d1v;
578 Standard_Integer indextg;
579 gp_Vec tgline(PW.TangentAtLine(indextg));
580 PW.Line()->Value(indextg).ParametersOnS1(locu,locv);
581 Surf1->D1(locu,locv,ptbid,d1u,d1v);
582 norm1 = d1u.Crossed(d1v);
583 PW.Line()->Value(indextg).ParametersOnS2(locu,locv);
584 Surf2->D1(locu,locv,ptbid,d1u,d1v);
585 norm2 = d1u.Crossed(d1v);
586 if(tgline.DotCross(norm2,norm1)>0.) {
587 trans1 = IntSurf_Out;
592 trans2 = IntSurf_Out;
595 Standard_Real TolTang = TolTangency;
596 Handle(IntPatch_WLine) wline = new IntPatch_WLine(PW.Line(),Standard_False,trans1,trans2);
597 wline->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
599 //the method PutVertexOnLine can reduce the number of points in <wline>
600 IntPatch_RstInt::PutVertexOnLine(wline,Surf1,D1,Surf2,Standard_True,TolTang);
601 if (wline->NbPnts() < 2)
603 IntPatch_RstInt::PutVertexOnLine(wline,Surf2,D2,Surf1,Standard_False,TolTang);
604 if (wline->NbPnts() < 2)
607 if(wline->NbVertex() == 0) {
609 IntSurf_PntOn2S POn2S = PW.Line()->Value(1);
610 POn2S.Parameters(pu1,pv1,pu2,pv2);
611 vtx.SetValue(Point3dDebut,TolTang,Standard_False);
612 vtx.SetParameters(pu1,pv1,pu2,pv2);
614 wline->AddVertex(vtx);
616 POn2S = PW.Line()->Value(wline->NbPnts());
617 POn2S.Parameters(pu1,pv1,pu2,pv2);
618 vtx.SetValue(Point3dFin,TolTang,Standard_False);
619 vtx.SetParameters(pu1,pv1,pu2,pv2);
620 vtx.SetParameter(wline->NbPnts());
621 wline->AddVertex(vtx);
624 lignetrouvee = Standard_True;
625 AddWLine(SLin, wline, Deflection);
626 empt = Standard_False;
630 }// dminiPointLigne > SeuildPointLigne
632 }// TabPtDep[nbps2]==0
633 } while( nbp>5 && ( !( ( (NombreDePointsDeDepartDuCheminement >= 3) && lignetrouvee ) ||
634 ( (NombreDePointsDeDepartDuCheminement-3>=nbp) && !lignetrouvee ) ) ) );
642 Standard_Real UminLig1,VminLig1,UmaxLig1,VmaxLig1;
643 Standard_Real UminLig2,VminLig2,UmaxLig2,VmaxLig2;
645 UminLig1=VminLig1=UminLig2=VminLig2=RealLast();
646 UmaxLig1=VmaxLig1=UmaxLig2=VmaxLig2=-UminLig1;
649 for(z=1; z <= nbTanZon; z++) {
650 const Intf_TangentZone& TangentZone=Interference.ZoneValue(z);
651 for(Standard_Integer pz=1; pz<=TangentZone.NumberOfPoints(); pz++) {
652 SectionPointToParameters(TangentZone.GetPoint(pz),Poly1,Poly2,U1,V1,U2,V2);
654 if(U1>UmaxLig1) UmaxLig1=U1;
655 if(V1>VmaxLig1) VmaxLig1=V1;
656 if(U2>UmaxLig2) UmaxLig2=U2;
657 if(V2>VmaxLig2) VmaxLig2=V2;
659 if(U1<UminLig1) UminLig1=U1;
660 if(V1<VminLig1) VminLig1=V1;
661 if(U2<UminLig2) UminLig2=U2;
662 if(V2<VminLig2) VminLig2=V2;
666 for(z=1; z <= nbTanZon; z++) {
667 const Intf_TangentZone& TangentZone=Interference.ZoneValue(z);
669 for( pz=1; pz<=TangentZone.NumberOfPoints(); pz++) {
670 SectionPointToParameters(TangentZone.GetPoint(pz),Poly1,Poly2,U1,V1,U2,V2);
677 HasStartPoint = PW.PerformFirstPoint(StartParams,StartPOn2S);
679 StartPOn2S.Parameters(pu1,pv1,pu2,pv2);
680 NbLigCalculee = SLin.Length();
681 dminiPointLigne = SeuildPointLigne + SeuildPointLigne;
683 for( l = 1; (l <= NbLigCalculee) && (dminiPointLigne >= SeuildPointLigne); l++) {
684 const Handle(IntPatch_WLine)& testwline = *((Handle(IntPatch_WLine)*)&SLin.Value(l));
686 if (IsPointOnLine(StartPOn2S, testwline, Deflection)) {
687 dminiPointLigne = 0.0;
691 if(dminiPointLigne > SeuildPointLigne) {
692 PW.Perform(StartParams,UminLig1,VminLig1,UminLig2,VminLig2,UmaxLig1,VmaxLig1,UmaxLig2,VmaxLig2);
694 if(PW.NbPoints()>2) {
695 RejetLigne = Standard_False;
696 Point3dDebut = PW.Value(1).Value();
697 const IntSurf_PntOn2S& PointFin = PW.Value(PW.NbPoints());
698 Point3dFin = PointFin.Value();
699 for(ver=1 ; ver<= NbLigCalculee ; ver++) {
700 const Handle(IntPatch_WLine)& verwline = *((Handle(IntPatch_WLine)*)&SLin.Value(ver));
702 // Check end point if it is on existing line.
703 // Start point is checked before.
704 if (IsPointOnLine(PointFin, verwline, Deflection)) {
705 RejetLigne = Standard_True;
709 const IntSurf_PntOn2S& verPointDebut = verwline->Point(1);
710 const IntSurf_PntOn2S& verPointFin = verwline->Point(verwline->NbPnts());
711 if( (Point3dDebut.Distance(verPointDebut.Value()) < TolTangency) ||
712 (Point3dFin.Distance(verPointFin.Value()) < TolTangency))
714 RejetLigne = Standard_True;
721 DublicateOfLinesProcessing(PW, ver, SLin, RejetLigne);
725 IntSurf_TypeTrans trans1,trans2;
726 Standard_Real locu,locv;
727 gp_Vec norm1,norm2,d1u,d1v;
729 Standard_Integer indextg;
730 gp_Vec tgline(PW.TangentAtLine(indextg));
731 PW.Line()->Value(indextg).ParametersOnS1(locu,locv);
732 Surf1->D1(locu,locv,ptbid,d1u,d1v);
733 norm1 = d1u.Crossed(d1v);
734 PW.Line()->Value(indextg).ParametersOnS2(locu,locv);
735 Surf2->D1(locu,locv,ptbid,d1u,d1v);
736 norm2 = d1u.Crossed(d1v);
737 if(tgline.DotCross(norm2,norm1)>0.) {
738 trans1 = IntSurf_Out;
743 trans2 = IntSurf_Out;
746 Standard_Real TolTang = TolTangency;
747 Handle(IntPatch_WLine) wline = new IntPatch_WLine(PW.Line(),Standard_False,trans1,trans2);
748 wline->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
750 //the method PutVertexOnLine can reduce the number of points in <wline>
751 IntPatch_RstInt::PutVertexOnLine(wline,Surf1,D1,Surf2,Standard_True,TolTang);
752 if (wline->NbPnts() < 2)
754 IntPatch_RstInt::PutVertexOnLine(wline,Surf2,D2,Surf1,Standard_False,TolTang);
755 if (wline->NbPnts() < 2)
758 if(wline->NbVertex() == 0) {
760 IntSurf_PntOn2S POn2S = PW.Line()->Value(1);
761 POn2S.Parameters(pu1,pv1,pu2,pv2);
762 vtx.SetValue(Point3dDebut,TolTang,Standard_False);
763 vtx.SetParameters(pu1,pv1,pu2,pv2);
765 wline->AddVertex(vtx);
767 POn2S = PW.Line()->Value(wline->NbPnts());
768 POn2S.Parameters(pu1,pv1,pu2,pv2);
769 vtx.SetValue(Point3dFin,TolTang,Standard_False);
770 vtx.SetParameters(pu1,pv1,pu2,pv2);
771 vtx.SetParameter(wline->NbPnts());
772 wline->AddVertex(vtx);
775 AddWLine(SLin, wline, Deflection);
776 empt = Standard_False;
780 }// dminiPointLigne > SeuildPointLigne
786 //==================================================================================
787 // function : Perform
789 //==================================================================================
790 void IntPatch_PrmPrmIntersection::Perform (const Handle(Adaptor3d_Surface)& Surf1,
791 const IntPatch_Polyhedron& Poly1,
792 const Handle(Adaptor3d_TopolTool)& D1,
793 const Standard_Real TolTangency,
794 const Standard_Real Epsilon,
795 const Standard_Real Deflection,
796 const Standard_Real Increment)
798 IntPatch_InterferencePolyhedron Interference(Poly1);
799 empt = Standard_True;
800 done = Standard_True;
803 Standard_Integer nbLigSec = Interference.NbSectionLines();
804 Standard_Integer nbTanZon = Interference.NbTangentZones();
806 Standard_Integer NbPntOn2SOnLine;
807 Standard_Integer NbLigCalculee = 0;
809 Standard_Real U1,U2,V1,V2;
810 Standard_Real pu1,pu2,pv1,pv2;
812 TColStd_Array1OfReal StartParams(1,4);
813 IntWalk_PWalking PW(Surf1,Surf1,TolTangency,Epsilon,Deflection,Increment);
815 Standard_Real SeuildPointLigne = 15.0 * Increment * Increment; //-- 10 est insuffisant
816 Standard_Real incidence;
817 Standard_Real dminiPointLigne;
819 Standard_Boolean HasStartPoint,RejetLigne;
821 IntSurf_PntOn2S StartPOn2S;
823 Standard_Integer ver;
825 gp_Pnt Point3dDebut,Point3dFin;
829 for( ls = 1; ls <= nbLigSec; ls++) {
830 const Intf_SectionLine& LineSec=Interference.LineValue(ls);
831 Standard_Integer nbp = LineSec.NumberOfPoints();
832 Standard_Integer nbps2 = (nbp>3)? (nbp/2) : 1;
833 Standard_Integer NombreDePointsDeDepartDuCheminement = 0;
834 Standard_Integer IndicePointdeDepart1 = 0, IndicePointdeDepart2 = 0;
836 NombreDePointsDeDepartDuCheminement++;
837 if(NombreDePointsDeDepartDuCheminement == 1) {
839 Standard_Integer nsp1;
840 for( nsp1= nbp/2; nsp1 >= 1; nsp1--) {
841 SectionPointToParameters(LineSec.GetPoint(nsp1),Poly1,Poly1,U1,V1,U2,V2);
842 Standard_Real CurrentIncidence = Abs(U1-U2)+Abs(V1-V2);
843 if(CurrentIncidence > incidence) {
845 incidence = CurrentIncidence;
848 for( nsp1 = nbp/2; nsp1 <= nbp; nsp1++) {
849 SectionPointToParameters(LineSec.GetPoint(nsp1),Poly1,Poly1,U1,V1,U2,V2);
850 Standard_Real CurrentIncidence = Abs(U1-U2)+Abs(V1-V2);
851 if(CurrentIncidence > incidence) {
853 incidence = CurrentIncidence;
858 NombreDePointsDeDepartDuCheminement=3;
860 IndicePointdeDepart1 = nbps2;
862 else if(NombreDePointsDeDepartDuCheminement == 2) {
863 if(IndicePointdeDepart1 == 1) {
865 IndicePointdeDepart2 = nbps2;
869 IndicePointdeDepart2 = 1;
873 if(IndicePointdeDepart1 == nbp)
874 nbps2 = (IndicePointdeDepart1+IndicePointdeDepart2)/2;
879 SectionPointToParameters(LineSec.GetPoint(nbps2),Poly1,Poly1,U1,V1,U2,V2);
886 HasStartPoint = PW.PerformFirstPoint(StartParams,StartPOn2S);
887 dminiPointLigne = SeuildPointLigne + SeuildPointLigne;
889 StartPOn2S.Parameters(pu1,pv1,pu2,pv2);
890 if(Abs(pu1-pu2)>1e-7 || Abs(pv1-pv2)>1e-7) {
891 NbLigCalculee = SLin.Length();
893 for( l = 1; (l <= NbLigCalculee) && (dminiPointLigne >= SeuildPointLigne); l++) {
894 const Handle(IntPatch_WLine)& testwline = *((Handle(IntPatch_WLine)*)&SLin.Value(l));
895 if( (testwline->IsOutSurf1Box(gp_Pnt2d(pu1,pv1))==Standard_False) &&
896 (testwline->IsOutSurf2Box(gp_Pnt2d(pu2,pv2))==Standard_False) &&
897 (testwline->IsOutBox(StartPOn2S.Value())==Standard_False) ) {
898 NbPntOn2SOnLine = testwline->NbPnts();
900 for( ll=1; (ll < NbPntOn2SOnLine) && (dminiPointLigne >= SeuildPointLigne); ll++) {
901 Standard_Real t,Au1,Av1,Au2,Av2,Bu1,Bv1,Bu2,Bv2;
902 testwline->Point(ll).Parameters(Au1,Av1,Au2,Av2);
903 testwline->Point(ll+1).Parameters(Bu1,Bv1,Bu2,Bv2);
919 if((pu1>=Au1) && (pu1<=Bu1) && (pv1>=Av1) && (pv1<=Bv1))
920 dminiPointLigne = 0.0;
922 if((pu2>=Au1) && (pu2<=Bu1) && (pv2>=Av1) && (pv2<=Bv1))
923 dminiPointLigne = 0.0;
929 if(dminiPointLigne > SeuildPointLigne) {
930 PW.Perform(StartParams);
932 if(PW.NbPoints()>2) {
933 RejetLigne = Standard_False;
934 Point3dDebut = PW.Value(1).Value();
935 Point3dFin = PW.Value(PW.NbPoints()).Value();
936 for(ver=1 ; ver<= NbLigCalculee ; ver++) {
937 const Handle(IntPatch_WLine)& verwline = *((Handle(IntPatch_WLine)*)&SLin.Value(ver));
938 const IntSurf_PntOn2S& verPointDebut = verwline->Point(1);
939 const IntSurf_PntOn2S& verPointFin = verwline->Point(verwline->NbPnts());
940 if( (Point3dDebut.Distance(verPointDebut.Value()) < TolTangency) ||
941 (Point3dFin.Distance(verPointFin.Value()) < TolTangency))
943 RejetLigne = Standard_True;
950 DublicateOfLinesProcessing(PW, ver, SLin, RejetLigne);
954 IntSurf_TypeTrans trans1,trans2;
955 Standard_Real locu,locv;
956 gp_Vec norm1,norm2,d1u,d1v;
958 Standard_Integer indextg;
959 gp_Vec tgline(PW.TangentAtLine(indextg));
960 PW.Line()->Value(indextg).ParametersOnS1(locu,locv);
961 Surf1->D1(locu,locv,ptbid,d1u,d1v);
962 norm1 = d1u.Crossed(d1v);
963 PW.Line()->Value(indextg).ParametersOnS2(locu,locv);
964 Surf1->D1(locu,locv,ptbid,d1u,d1v);
965 norm2 = d1u.Crossed(d1v);
966 if (tgline.DotCross(norm2,norm1)>0.) {
967 trans1 = IntSurf_Out;
972 trans2 = IntSurf_Out;
975 IntSurf_LineOn2S LineOn2S;
976 Standard_Integer nbpw,imin,imax,i;
977 nbpw = PW.Line()->NbPoints();
978 Standard_Real u1,v1,u2,v2;
983 const IntSurf_PntOn2S& Pi = PW.Line()->Value(i);
984 Pi.Parameters(u1,v1,u2,v2);
985 } while((i<nbpw)&&(Abs(u1-u2)<=1e-6 && Abs(v1-v2)<=1e-6));
994 const IntSurf_PntOn2S& Pi = PW.Line()->Value(i);
995 Pi.Parameters(u1,v1,u2,v2);
996 } while((i>2)&&(Abs(u1-u2)<=1e-6 && Abs(v1-v2)<=1e-6));
1002 Handle(IntSurf_LineOn2S) PWLine = new IntSurf_LineOn2S();
1003 for(i=imin;i<=imax;i++)
1004 PWLine->Add(PW.Line()->Value(i));
1006 Standard_Real TolTang = TolTangency;
1007 Handle(IntPatch_WLine) wline = new IntPatch_WLine(PWLine,Standard_False,trans1,trans2);
1008 wline->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
1010 const IntSurf_PntOn2S& POn2SDeb = wline->Point(1);
1011 const IntSurf_PntOn2S& POn2SFin = wline->Point(wline->NbPnts());
1012 if((POn2SDeb.Value()).Distance(POn2SFin.Value()) <= TolTangency) {
1013 Standard_Real u1t,v1t,u2t,v2t;
1014 POn2SDeb.Parameters(u1t,v1t,u2t,v2t);
1016 vtx.SetValue(POn2SDeb.Value(),TolTang,Standard_False);
1017 vtx.SetParameters(u2t,v2t,u1t,v1t);
1018 vtx.SetParameter(wline->NbPnts());
1019 wline->SetPoint(wline->NbPnts(),vtx);
1021 //the method PutVertexOnLine can reduce the number of points in <wline>
1022 IntPatch_RstInt::PutVertexOnLine(wline,Surf1,D1,Surf1,Standard_True,TolTang);
1023 if (wline->NbPnts() < 2)
1025 if(wline->NbVertex() == 0) {
1027 IntSurf_PntOn2S POn2S = PW.Line()->Value(1);
1028 POn2S.Parameters(pu1,pv1,pu2,pv2);
1029 vtx.SetValue(Point3dDebut,TolTang,Standard_False);
1030 vtx.SetParameters(pu1,pv1,pu2,pv2);
1031 vtx.SetParameter(1);
1032 wline->AddVertex(vtx);
1034 POn2S = PW.Line()->Value(wline->NbPnts());
1035 POn2S.Parameters(pu1,pv1,pu2,pv2);
1036 vtx.SetValue(Point3dFin,TolTang,Standard_False);
1037 vtx.SetParameters(pu1,pv1,pu2,pv2);
1038 vtx.SetParameter(wline->NbPnts());
1039 wline->AddVertex(vtx);
1042 empt = Standard_False;
1047 }// dminiPointLigne > SeuildPointLigne
1050 } while(nbp>5 && NombreDePointsDeDepartDuCheminement<3);
1055 for( z = 1; z <= nbTanZon; z++) {
1056 const Intf_TangentZone& TangentZone=Interference.ZoneValue(z);
1057 for(Standard_Integer pz=1; pz<=TangentZone.NumberOfPoints(); pz++) {
1058 SectionPointToParameters(TangentZone.GetPoint(pz),Poly1,Poly1,U1,V1,U2,V2);
1060 StartParams(1) = U1;
1061 StartParams(2) = V1;
1062 StartParams(3) = U2;
1063 StartParams(4) = V2;
1065 HasStartPoint = PW.PerformFirstPoint(StartParams,StartPOn2S);
1067 StartPOn2S.Parameters(pu1,pv1,pu2,pv2);
1068 if(Abs(pu1-pu2)>1e-7 || Abs(pv1-pv2)>1e-7) {
1069 NbLigCalculee = SLin.Length();
1070 dminiPointLigne = SeuildPointLigne + SeuildPointLigne;
1072 for( l = 1; (l <= NbLigCalculee) && (dminiPointLigne >= SeuildPointLigne); l++) {
1073 const Handle(IntPatch_WLine)& testwline = *((Handle(IntPatch_WLine)*)&SLin.Value(l));
1074 if( (testwline->IsOutSurf1Box(gp_Pnt2d(pu1,pv1))==Standard_False) &&
1075 (testwline->IsOutSurf2Box(gp_Pnt2d(pu2,pv2))==Standard_False) &&
1076 (testwline->IsOutBox(StartPOn2S.Value())==Standard_False) ) {
1077 NbPntOn2SOnLine = testwline->NbPnts();
1078 Standard_Integer ll;
1079 for( ll = 1; (ll < NbPntOn2SOnLine) && (dminiPointLigne >= SeuildPointLigne); ll++) {
1080 Standard_Real t,Au1,Av1,Au2,Av2,Bu1,Bv1,Bu2,Bv2;
1081 testwline->Point(ll).Parameters(Au1,Av1,Au2,Av2);
1082 testwline->Point(ll+1).Parameters(Bu1,Bv1,Bu2,Bv2);
1097 if((pu1>=Au1) && (pu1<=Bu1) && (pv1>=Av1) && (pv1<=Bv1))
1098 dminiPointLigne = 0.0;
1100 if((pu2>=Au1) && (pu2<=Bu1) && (pv2>=Av1) && (pv2<=Bv1))
1101 dminiPointLigne = 0.0;
1107 if(dminiPointLigne > SeuildPointLigne) {
1108 PW.Perform(StartParams);
1110 if(PW.NbPoints()>2) {
1111 RejetLigne = Standard_False;
1112 Point3dDebut = PW.Value(1).Value();
1113 Point3dFin = PW.Value(PW.NbPoints()).Value();
1114 for( ver = 1 ; ver<= NbLigCalculee ; ver++) {
1115 const Handle(IntPatch_WLine)& verwline = *((Handle(IntPatch_WLine)*)&SLin.Value(ver));
1116 const IntSurf_PntOn2S& verPointDebut = verwline->Point(1);
1117 const IntSurf_PntOn2S& verPointFin = verwline->Point(verwline->NbPnts());
1118 if( (Point3dDebut.Distance(verPointDebut.Value()) < TolTangency) ||
1119 (Point3dFin.Distance(verPointFin.Value()) < TolTangency))
1121 RejetLigne = Standard_True;
1128 DublicateOfLinesProcessing(PW, ver, SLin, RejetLigne);
1132 IntSurf_TypeTrans trans1,trans2;
1133 Standard_Real locu,locv;
1134 gp_Vec norm1,norm2,d1u,d1v;
1136 Standard_Integer indextg;
1137 gp_Vec tgline(PW.TangentAtLine(indextg));
1138 PW.Line()->Value(indextg).ParametersOnS1(locu,locv);
1139 Surf1->D1(locu,locv,ptbid,d1u,d1v);
1140 norm1 = d1u.Crossed(d1v);
1141 PW.Line()->Value(indextg).ParametersOnS2(locu,locv);
1142 Surf1->D1(locu,locv,ptbid,d1u,d1v);
1143 norm2 = d1u.Crossed(d1v);
1144 if(tgline.DotCross(norm2,norm1)>0.) {
1145 trans1 = IntSurf_Out;
1146 trans2 = IntSurf_In;
1149 trans1 = IntSurf_In;
1150 trans2 = IntSurf_Out;
1153 IntSurf_LineOn2S LineOn2S;
1154 Standard_Integer nbp,imin,imax,i;
1155 nbp = PW.Line()->NbPoints();
1156 Standard_Real u1,v1,u2,v2;
1161 const IntSurf_PntOn2S& Pi = PW.Line()->Value(i);
1162 Pi.Parameters(u1,v1,u2,v2);
1163 } while((i<nbp)&&(Abs(u1-u2)<=1e-6 && Abs(v1-v2)<=1e-6));
1172 const IntSurf_PntOn2S& Pi = PW.Line()->Value(i);
1173 Pi.Parameters(u1,v1,u2,v2);
1174 } while((i>2)&&(Abs(u1-u2)<=1e-6 && Abs(v1-v2)<=1e-6));
1180 Handle(IntSurf_LineOn2S) PWLine = new IntSurf_LineOn2S();
1181 for(i=imin;i<=imax;i++)
1182 PWLine->Add(PW.Line()->Value(i));
1184 Standard_Real TolTang = TolTangency;
1185 Handle(IntPatch_WLine) wline = new IntPatch_WLine(PWLine,Standard_False,trans1,trans2);
1186 wline->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
1188 const IntSurf_PntOn2S& POn2SDeb = wline->Point(1);
1189 const IntSurf_PntOn2S& POn2SFin = wline->Point(wline->NbPnts());
1190 if((POn2SDeb.Value()).Distance(POn2SFin.Value()) <= TolTangency) {
1191 Standard_Real u1t,v1t,u2t,v2t;
1192 POn2SDeb.Parameters(u1t,v1t,u2t,v2t);
1194 vtx.SetValue(POn2SDeb.Value(),TolTang,Standard_False);
1195 vtx.SetParameters(u2t,v2t,u1t,v1t);
1196 vtx.SetParameter(wline->NbPnts());
1197 wline->SetPoint(wline->NbPnts(),vtx);
1200 //the method PutVertexOnLine can reduce the number of points in <wline>
1201 IntPatch_RstInt::PutVertexOnLine(wline,Surf1,D1,Surf1,Standard_True,TolTang);
1202 if (wline->NbPnts() < 2)
1205 if(wline->NbVertex() == 0) {
1207 IntSurf_PntOn2S POn2S = PW.Line()->Value(1);
1208 POn2S.Parameters(pu1,pv1,pu2,pv2);
1209 vtx.SetValue(Point3dDebut,TolTang,Standard_False);
1210 vtx.SetParameters(pu1,pv1,pu2,pv2);
1211 vtx.SetParameter(1);
1212 wline->AddVertex(vtx);
1214 POn2S = PW.Line()->Value(wline->NbPnts());
1215 POn2S.Parameters(pu1,pv1,pu2,pv2);
1216 vtx.SetValue(Point3dFin,TolTang,Standard_False);
1217 vtx.SetParameters(pu1,pv1,pu2,pv2);
1218 vtx.SetParameter(wline->NbPnts());
1219 wline->AddVertex(vtx);
1223 empt = Standard_False;
1228 }// dminiPointLigne > SeuildPointLigne
1235 //==================================================================================
1236 // function : NewLine
1238 //==================================================================================
1239 Handle(IntPatch_Line) IntPatch_PrmPrmIntersection::NewLine (const Handle(Adaptor3d_Surface)& Surf1,
1240 const Handle(Adaptor3d_Surface)& Surf2,
1241 const Standard_Integer NumLine,
1242 const Standard_Integer Low,
1243 const Standard_Integer High,
1244 const Standard_Integer NbPntsToInsert) const
1246 Standard_Integer NbPnts = NbPntsToInsert + High - Low;
1247 if(NumLine>NbLines() || NumLine<1 || Low>=High )
1248 throw Standard_OutOfRange(" IntPatch_PrmPrmIntersection NewLine ");
1249 //------------------------------------------------------------------
1250 //-- Indice : Low Low+1 I I+1 High --
1252 //-- Abs.Curv. : S(Low) S(I) S(I+1) S(High) --
1254 //-- On echantillonne a abcisse curviligne --
1256 //-- L abcisse est calculee sur les params U1,V1 --
1257 //------------------------------------------------------------------
1258 TColStd_Array1OfReal U1(Low,High);
1259 TColStd_Array1OfReal V1(Low,High);
1260 TColStd_Array1OfReal U2(Low,High);
1261 TColStd_Array1OfReal V2(Low,High);
1262 TColStd_Array1OfReal AC(Low,High);
1265 Handle(IntPatch_WLine) TheLine = Handle(IntPatch_WLine)::DownCast(Line(NumLine));
1266 const IntSurf_PntOn2S& Point=TheLine->Point(Low);
1267 Standard_Real u1,v1,u2,v2;
1268 Point.Parameters(u1,v1,u2,v2);
1275 IntWalk_PWalking PW(Surf1,Surf2,0.000001,0.000001,0.001,0.001);
1278 for(i=Low+1; i<=High; i++)
1280 const IntSurf_PntOn2S& Pointi=TheLine->Point(i);
1281 Pointi.Parameters(u1,v1,u2,v2);
1287 Standard_Real du1=u1-U1(i-1);
1288 Standard_Real dv1=v1-V1(i-1);
1290 AC(i) = AC(i-1) + Sqrt((du1*du1)+(dv1*dv1));
1293 Handle(IntSurf_LineOn2S) ResultPntOn2SLine = new IntSurf_LineOn2S();
1295 IntSurf_PntOn2S StartPOn2S;
1296 TColStd_Array1OfReal StartParams(1,4);
1298 ResultPntOn2SLine->Add(TheLine->Point(Low));
1300 ds = AC(High) / (NbPnts-1);
1301 Standard_Integer Indice = Low;
1303 Standard_Real dsmin = ds*0.3;
1304 Standard_Real smax = AC(High);
1306 for(i=2,s=ds; (i<NbPnts)&&(s<smax); i++,s+=ds)
1308 while(AC(Indice+1) <= s)
1310 ResultPntOn2SLine->Add(TheLine->Point(Indice));
1313 Standard_Real a = s - AC(Indice);
1314 Standard_Real b = AC(Indice+1) - s;
1315 Standard_Real nab = 1.0/(a+b);
1316 //----------------------------------------------------------
1317 //-- Verification : Si Dist au prochain point < dsmin --
1318 //-- Si Dist au precedent point < dsmin --
1320 //----------------------------------------------------------
1321 if((nab > ds)&&(a>dsmin)&&(b>dsmin))
1323 StartParams(1) = (U1(Indice) * b + U1(Indice+1) * a) * nab;
1324 StartParams(2) = (V1(Indice) * b + V1(Indice+1) * a) * nab;
1325 StartParams(3) = (U2(Indice) * b + U2(Indice+1) * a) * nab;
1326 StartParams(4) = (V2(Indice) * b + V2(Indice+1) * a) * nab;
1328 Standard_Boolean HasStartPoint = PW.PerformFirstPoint(StartParams,StartPOn2S);
1330 ResultPntOn2SLine->Add(StartPOn2S);
1336 ResultPntOn2SLine->Add(TheLine->Point(High));
1338 Handle(IntPatch_WLine) aRWL = new IntPatch_WLine(ResultPntOn2SLine, Standard_False);
1339 aRWL->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
1344 //==================================================================================
1345 // function : SectionPointToParameters
1347 //==================================================================================
1348 void SectionPointToParameters(const Intf_SectionPoint& Sp,
1349 const IntPatch_Polyhedron& Poly1,
1350 const IntPatch_Polyhedron& Poly2,
1357 Standard_Integer Adr1,Adr2;
1358 Standard_Real Param,u,v;
1361 Standard_Integer Pt1,Pt2,Pt3;
1363 Sp.InfoFirst(typ,Adr1,Adr2,Param);
1365 case Intf_VERTEX: //-- Adr1 est le numero du vertex
1367 Poly1.Parameters(Adr1,u1,v1);
1372 Poly1.Parameters(Adr1,u1,v1);
1373 Poly1.Parameters(Adr2,u,v);
1374 u1+= Param * (u-u1);
1375 v1+= Param * (v-v1);
1380 Standard_Real ua,va,ub,vb,uc,vc,ca,cb,cc,cabc;
1381 Poly1.Triangle(Adr1,Pt1,Pt2,Pt3);
1382 gp_Pnt PA(Poly1.Point(Pt1));
1383 gp_Pnt PB(Poly1.Point(Pt2));
1384 gp_Pnt PC(Poly1.Point(Pt3));
1385 Poly1.Parameters(Pt1,ua,va);
1386 Poly1.Parameters(Pt2,ub,vb);
1387 Poly1.Parameters(Pt3,uc,vc);
1388 gp_Vec Normale(gp_Vec(PA,PB).Crossed(gp_Vec(PA,PC)));
1389 cc = (gp_Vec(PA,PB).Crossed(gp_Vec(PA,P))).Dot(Normale);
1390 ca = (gp_Vec(PB,PC).Crossed(gp_Vec(PB,P))).Dot(Normale);
1391 cb = (gp_Vec(PC,PA).Crossed(gp_Vec(PC,P))).Dot(Normale);
1392 cabc = ca + cb + cc;
1394 ca/=cabc; cb/=cabc; cc/=cabc;
1396 u1 = ca * ua + cb * ub + cc * uc;
1397 v1 = ca * va + cb * vb + cc * vc;
1402 //-- std::cout<<" Default dans SectionPointToParameters "<<std::endl;
1408 Sp.InfoSecond(typ,Adr1,Adr2,Param);
1410 case Intf_VERTEX: //-- Adr1 est le numero du vertex
1412 Poly2.Parameters(Adr1,u2,v2);
1417 Poly2.Parameters(Adr1,u2,v2);
1418 Poly2.Parameters(Adr2,u,v);
1419 u2+= Param * (u-u2);
1420 v2+= Param * (v-v2);
1425 Standard_Real ua,va,ub,vb,uc,vc,ca,cb,cc,cabc;
1426 Poly2.Triangle(Adr1,Pt1,Pt2,Pt3);
1427 gp_Pnt PA(Poly2.Point(Pt1));
1428 gp_Pnt PB(Poly2.Point(Pt2));
1429 gp_Pnt PC(Poly2.Point(Pt3));
1430 Poly2.Parameters(Pt1,ua,va);
1431 Poly2.Parameters(Pt2,ub,vb);
1432 Poly2.Parameters(Pt3,uc,vc);
1433 gp_Vec Normale(gp_Vec(PA,PB).Crossed(gp_Vec(PA,PC)));
1434 cc = (gp_Vec(PA,PB).Crossed(gp_Vec(PA,P))).Dot(Normale);
1435 ca = (gp_Vec(PB,PC).Crossed(gp_Vec(PB,P))).Dot(Normale);
1436 cb = (gp_Vec(PC,PA).Crossed(gp_Vec(PC,P))).Dot(Normale);
1437 cabc = ca + cb + cc;
1439 ca/=cabc; cb/=cabc; cc/=cabc;
1441 u2 = ca * ua + cb * ub + cc * uc;
1442 v2 = ca * va + cb * vb + cc * vc;
1447 //-- std::cout<<" Default dans SectionPointToParameters "<<std::endl;
1453 //==================================================================================
1454 // function : RemplitLin
1456 //==================================================================================
1457 void IntPatch_PrmPrmIntersection::RemplitLin(const Standard_Integer x1,
1458 const Standard_Integer y1,
1459 const Standard_Integer z1,
1460 const Standard_Integer x2,
1461 const Standard_Integer y2,
1462 const Standard_Integer z2,
1463 IntPatch_PrmPrmIntersection_T3Bits& Map) const
1466 xg=x1-x2; if(xg<0) xg=-xg;
1467 yg=y1-y2; if(yg<0) yg=-yg;
1468 zg=z1-z2; if(zg<0) zg=-zg;
1469 if(DansGrille(x1) && DansGrille(y1) && DansGrille(z1)) {
1470 Standard_Integer t = GrilleInteger(x1,y1,z1);
1473 if(xg<=1 && yg<=1 && zg<=1) return;
1477 RemplitLin(x1,y1,z1,xg,yg,zg,Map);
1478 RemplitLin(x2,y2,z2,xg,yg,zg,Map);
1481 //==================================================================================
1482 // function : RemplitTri
1484 //==================================================================================
1485 void IntPatch_PrmPrmIntersection::RemplitTri(const Standard_Integer x1,
1486 const Standard_Integer y1,
1487 const Standard_Integer z1,
1488 const Standard_Integer x2,
1489 const Standard_Integer y2,
1490 const Standard_Integer z2,
1491 const Standard_Integer x3,
1492 const Standard_Integer y3,
1493 const Standard_Integer z3,
1494 IntPatch_PrmPrmIntersection_T3Bits& Map) const
1496 if(x1==x2 && x1==x3 && y1==y2 && y1==y3 && z1==z2 && z1==z3) {
1497 if(DansGrille(x1) && DansGrille(y1) && DansGrille(z1)) {
1498 Standard_Integer t = GrilleInteger(x1,y1,z1);
1504 Standard_Integer xg=(x1+x2+x3)/3;
1505 Standard_Integer yg=(y1+y2+y3)/3;
1506 Standard_Integer zg=(z1+z2+z3)/3;
1507 if(xg==x1 && yg==y1 && zg==z1) {
1508 RemplitLin(x1,y1,z1,x2,y2,z2,Map);
1509 RemplitLin(x1,y1,z1,x3,y3,z3,Map);
1512 if(xg==x2 && yg==y2 && zg==z2) {
1513 RemplitLin(x2,y2,z2,x1,y1,z1,Map);
1514 RemplitLin(x2,y2,z2,x3,y3,z3,Map);
1517 if(xg==x3 && yg==y3 && zg==z3) {
1518 RemplitLin(x3,y3,z3,x2,y2,z2,Map);
1519 RemplitLin(x3,y3,z3,x1,y1,z1,Map);
1522 if(DansGrille(xg) && DansGrille(yg) && DansGrille(zg)) {
1523 Standard_Integer t = GrilleInteger(xg,yg,zg);
1526 if(xg!=x3 || yg!=y3 || zg!=z3) RemplitTri(x1,y1,z1, x2,y2,z2, xg,yg,zg, Map);
1527 if(xg!=x1 || yg!=y1 || zg!=z1) RemplitTri(xg,yg,zg, x2,y2,z2, x3,y3,z3, Map);
1528 if(xg!=x2 || yg!=y2 || zg!=z2) RemplitTri(x1,y1,z1, xg,yg,zg, x3,y3,z3, Map);
1532 //==================================================================================
1533 // function : Remplit
1535 //==================================================================================
1536 void IntPatch_PrmPrmIntersection::Remplit(const Standard_Integer a,
1537 const Standard_Integer b,
1538 const Standard_Integer c,
1539 IntPatch_PrmPrmIntersection_T3Bits& Map) const
1541 int iax,iay,iaz,ibx,iby,ibz,icx,icy,icz;
1542 if(a!=-1) Map.Add(a);
1543 if(b!=-1) Map.Add(b);
1544 if(c!=-1) Map.Add(c);
1546 if(a!=-1 && b!=-1 && c!=-1 ) {
1547 IntegerGrille(a,iax,iay,iaz);
1548 IntegerGrille(b,ibx,iby,ibz);
1549 IntegerGrille(c,icx,icy,icz);
1550 RemplitTri(iax,iay,iaz,ibx,iby,ibz,icx,icy,icz,Map);
1556 //=======================================================================
1557 //function : Perform
1559 //=======================================================================
1560 void IntPatch_PrmPrmIntersection::Perform (const Handle(Adaptor3d_Surface)& Surf1,
1561 const Handle(Adaptor3d_TopolTool)& D1,
1562 const Handle(Adaptor3d_Surface)& Surf2,
1563 const Handle(Adaptor3d_TopolTool)& D2,
1564 const Standard_Real TolTangency,
1565 const Standard_Real Epsilon,
1566 const Standard_Real Deflection,
1567 const Standard_Real Increment,
1568 IntSurf_ListOfPntOn2S& LOfPnts)
1570 if (LOfPnts.IsEmpty()){
1571 done = Standard_True;
1575 empt = Standard_True;
1578 Standard_Real UminLig1,VminLig1,UmaxLig1,VmaxLig1;
1579 Standard_Real UminLig2,VminLig2,UmaxLig2,VmaxLig2;
1580 Standard_Real U1,U2,V1,V2;
1582 UminLig1 = Surf1->FirstUParameter();
1583 VminLig1 = Surf1->FirstVParameter();
1584 UmaxLig1 = Surf1->LastUParameter();
1585 VmaxLig1 = Surf1->LastVParameter();
1586 UminLig2 = Surf2->FirstUParameter();
1587 VminLig2 = Surf2->FirstVParameter();
1588 UmaxLig2 = Surf2->LastUParameter();
1589 VmaxLig2 = Surf2->LastVParameter();
1591 Standard_Real Periods [4];
1592 Periods[0] = (Surf1->IsUPeriodic())? Surf1->UPeriod() : 0.;
1593 Periods[1] = (Surf1->IsVPeriodic())? Surf1->VPeriod() : 0.;
1594 Periods[2] = (Surf2->IsUPeriodic())? Surf2->UPeriod() : 0.;
1595 Periods[3] = (Surf2->IsVPeriodic())? Surf2->VPeriod() : 0.;
1597 IntSurf_ListIteratorOfListOfPntOn2S IterLOP1(LOfPnts);
1598 if (Surf1->IsUClosed() || Surf1->IsVClosed() ||
1599 Surf2->IsUClosed() || Surf2->IsVClosed())
1601 Standard_Real TolPar = Precision::PConfusion();
1602 IntSurf_ListOfPntOn2S AdditionalPnts;
1603 Standard_Real NewU1, NewV1, NewU2, NewV2;
1604 for(; IterLOP1.More(); IterLOP1.Next())
1606 IntSurf_PntOn2S Pnt = IterLOP1.Value();
1607 Pnt.Parameters(U1, V1, U2, V2);
1608 IntSurf_PntOn2S NewPnt;
1609 if (Surf1->IsUClosed())
1611 if (Abs(U1 - Surf1->FirstUParameter()) <= TolPar)
1613 NewU1 = Surf1->LastUParameter();
1614 NewPnt.SetValue( NewU1, V1, U2, V2 );
1615 AdditionalPnts.Append(NewPnt);
1617 else if (Abs(U1 - Surf1->LastUParameter()) <= TolPar)
1619 NewU1 = Surf1->FirstUParameter();
1620 NewPnt.SetValue( NewU1, V1, U2, V2 );
1621 AdditionalPnts.Append(NewPnt);
1624 if (Surf1->IsVClosed())
1626 if (Abs(V1 - Surf1->FirstVParameter()) <= TolPar)
1628 NewV1 = Surf1->LastVParameter();
1629 NewPnt.SetValue( U1, NewV1, U2, V2 );
1630 AdditionalPnts.Append(NewPnt);
1632 else if (Abs(V1 - Surf1->LastVParameter()) <= TolPar)
1634 NewV1 = Surf1->FirstVParameter();
1635 NewPnt.SetValue( U1, NewV1, U2, V2 );
1636 AdditionalPnts.Append(NewPnt);
1639 if (Surf2->IsUClosed())
1641 if (Abs(U2 - Surf2->FirstUParameter()) <= TolPar)
1643 NewU2 = Surf2->LastUParameter();
1644 NewPnt.SetValue( U1, V1, NewU2, V2);
1645 AdditionalPnts.Append(NewPnt);
1647 else if (Abs(U2 - Surf2->LastUParameter()) <= TolPar)
1649 NewU2 = Surf2->FirstUParameter();
1650 NewPnt.SetValue( U1, V1, NewU2, V2);
1651 AdditionalPnts.Append(NewPnt);
1654 if (Surf2->IsVClosed())
1656 if (Abs(V2 - Surf2->FirstVParameter()) <= TolPar)
1658 NewV2 = Surf2->LastVParameter();
1659 NewPnt.SetValue( U1, V1, U2, NewV2 );
1660 AdditionalPnts.Append(NewPnt);
1662 else if (Abs(V2 - Surf2->LastVParameter()) <= TolPar)
1664 NewV2 = Surf2->FirstVParameter();
1665 NewPnt.SetValue( U1, V1, U2, NewV2 );
1666 AdditionalPnts.Append(NewPnt);
1670 //Cut repeated points
1671 for (IterLOP1.Initialize(LOfPnts); IterLOP1.More(); IterLOP1.Next())
1673 IntSurf_PntOn2S aPnt = IterLOP1.Value();
1674 aPnt.Parameters(U1, V1, U2, V2);
1675 IntSurf_ListIteratorOfListOfPntOn2S iter2(AdditionalPnts);
1676 while (iter2.More())
1678 IntSurf_PntOn2S aNewPnt = iter2.Value();
1679 aNewPnt.Parameters(NewU1, NewV1, NewU2, NewV2);
1680 if (Abs(U1 - NewU1) <= TolPar &&
1681 Abs(V1 - NewV1) <= TolPar &&
1682 Abs(U2 - NewU2) <= TolPar &&
1683 Abs(V2 - NewV2) <= TolPar)
1684 AdditionalPnts.Remove(iter2);
1690 LOfPnts.Append(AdditionalPnts);
1693 for(IterLOP1.Initialize(LOfPnts); IterLOP1.More(); IterLOP1.Next()){
1694 IntSurf_PntOn2S Pnt = IterLOP1.Value();
1695 Pnt.Parameters(U1, V1, U2, V2);
1696 if(U1>UmaxLig1) UmaxLig1=U1;
1697 if(V1>VmaxLig1) VmaxLig1=V1;
1698 if(U2>UmaxLig2) UmaxLig2=U2;
1699 if(V2>VmaxLig2) VmaxLig2=V2;
1701 if(U1<UminLig1) UminLig1=U1;
1702 if(V1<VminLig1) VminLig1=V1;
1703 if(U2<UminLig2) UminLig2=U2;
1704 if(V2<VminLig2) VminLig2=V2;
1707 Standard_Real SeuildPointLigne = 15.0 * Increment * Increment;
1709 Standard_Integer NbLigCalculee = 0, ver;
1710 Standard_Real pu1,pu2,pv1,pv2, dminiPointLigne;
1711 Standard_Boolean HasStartPoint,RejetLigne;
1712 IntSurf_PntOn2S StartPOn2S;
1713 gp_Pnt Point3dDebut,Point3dFin;
1715 TColStd_Array1OfReal StartParams(1,4);
1716 IntWalk_PWalking PW(Surf1,Surf2,TolTangency,Epsilon,Deflection,Increment);
1718 IntSurf_ListIteratorOfListOfPntOn2S IterLOP2(LOfPnts);
1719 for(; IterLOP2.More(); IterLOP2.Next() ){
1721 IntSurf_PntOn2S cPnt = IterLOP2.Value();
1722 cPnt.Parameters(U1, V1, U2, V2);
1724 StartParams(1) = U1;
1725 StartParams(2) = V1;
1726 StartParams(3) = U2;
1727 StartParams(4) = V2;
1729 HasStartPoint = PW.PerformFirstPoint(StartParams,StartPOn2S);
1730 dminiPointLigne = SeuildPointLigne + SeuildPointLigne;
1732 StartPOn2S.Parameters(pu1,pv1,pu2,pv2);
1733 NbLigCalculee = SLin.Length();
1735 for( l = 1; (l <= NbLigCalculee) && (dminiPointLigne >= SeuildPointLigne); l++) {
1736 const Handle(IntPatch_WLine)& testwline = *((Handle(IntPatch_WLine)*)&SLin.Value(l));
1738 if (IsPointOnLine(StartPOn2S, testwline, Deflection)) {
1739 dminiPointLigne = 0.0;
1743 if(dminiPointLigne > SeuildPointLigne) {
1744 PW.Perform(StartParams,UminLig1,VminLig1,UminLig2,VminLig2,UmaxLig1,VmaxLig1,UmaxLig2,VmaxLig2);
1748 //Try to extend the intersection line to boundary, if it is possible.
1749 PW.PutToBoundary(Surf1, Surf2);
1751 RejetLigne = Standard_False;
1752 Point3dDebut = PW.Value(1).Value();
1753 const IntSurf_PntOn2S& PointFin = PW.Value(PW.NbPoints());
1754 Point3dFin = PointFin.Value();
1755 for( ver = 1 ; ver<= NbLigCalculee ; ver++) {
1756 const Handle(IntPatch_WLine)& verwline = *((Handle(IntPatch_WLine)*)&SLin.Value(ver));
1758 // Check end point if it is on existing line.
1759 // Start point is checked before.
1760 if (IsPointOnLine(PointFin, verwline, Deflection)) {
1761 RejetLigne = Standard_True;
1765 const IntSurf_PntOn2S& verPointDebut = verwline->Point(1);
1766 const IntSurf_PntOn2S& verPointFin = verwline->Point(verwline->NbPnts());
1767 if( (Point3dDebut.Distance(verPointDebut.Value()) <= TolTangency) &&
1768 (Point3dFin.Distance(verPointFin.Value()) <= TolTangency))
1770 RejetLigne = Standard_True;
1777 DublicateOfLinesProcessing(PW, ver, SLin, RejetLigne);
1781 IntSurf_TypeTrans trans1,trans2;
1782 Standard_Real locu,locv;
1783 gp_Vec norm1,norm2,d1u,d1v;
1785 Standard_Integer indextg;
1786 gp_Vec tgline(PW.TangentAtLine(indextg));
1787 PW.Line()->Value(indextg).ParametersOnS1(locu,locv);
1788 Surf1->D1(locu,locv,ptbid,d1u,d1v);
1789 norm1 = d1u.Crossed(d1v);
1790 PW.Line()->Value(indextg).ParametersOnS2(locu,locv);
1791 Surf2->D1(locu,locv,ptbid,d1u,d1v);
1792 norm2 = d1u.Crossed(d1v);
1793 if( tgline.DotCross(norm2,norm1) >= 0. ) {
1794 trans1 = IntSurf_Out;
1795 trans2 = IntSurf_In;
1798 trans1 = IntSurf_In;
1799 trans2 = IntSurf_Out;
1802 Standard_Real TolTang = TolTangency;
1803 Handle(IntPatch_WLine) wline = new IntPatch_WLine(PW.Line(),Standard_False,trans1,trans2);
1804 wline->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
1806 //the method PutVertexOnLine can reduce the number of points in <wline>
1807 IntPatch_RstInt::PutVertexOnLine(wline, Surf1, D1, Surf2, Standard_True, TolTang);
1808 if (wline->NbPnts() < 2)
1810 IntPatch_RstInt::PutVertexOnLine(wline, Surf2, D2, Surf1, Standard_False, TolTang);
1811 if (wline->NbPnts() < 2)
1814 if(wline->NbVertex() == 0) {
1816 IntSurf_PntOn2S POn2S = PW.Line()->Value(1);
1817 POn2S.Parameters(pu1,pv1,pu2,pv2);
1818 vtx.SetValue(Point3dDebut,TolTang,Standard_False);
1819 vtx.SetParameters(pu1,pv1,pu2,pv2);
1820 vtx.SetParameter(1);
1821 wline->AddVertex(vtx);
1823 POn2S = PW.Line()->Value(wline->NbPnts());
1824 POn2S.Parameters(pu1,pv1,pu2,pv2);
1825 vtx.SetValue(Point3dFin,TolTang,Standard_False);
1826 vtx.SetParameters(pu1,pv1,pu2,pv2);
1827 vtx.SetParameter(wline->NbPnts());
1828 wline->AddVertex(vtx);
1831 SeveralWlinesProcessing(Surf1, Surf2, SLin, Periods, trans1, trans2,
1832 TolTang, Max(PW.MaxStep(0), PW.MaxStep(1)),
1833 Max(PW.MaxStep(2), PW.MaxStep(3)), wline);
1835 AddWLine(SLin, wline, Deflection);
1836 empt = Standard_False;
1840 }// dminiPointLigne > SeuildPointLigne
1842 }// for( IterLOP ...
1843 done = Standard_True;
1846 //=======================================================================
1847 //function : Perform
1849 //=======================================================================
1850 void IntPatch_PrmPrmIntersection::Perform(const Handle(Adaptor3d_Surface)& Surf1,
1851 const Handle(Adaptor3d_TopolTool)& D1,
1852 const Handle(Adaptor3d_Surface)& Surf2,
1853 const Handle(Adaptor3d_TopolTool)& D2,
1854 const Standard_Real U1Depart,
1855 const Standard_Real V1Depart,
1856 const Standard_Real U2Depart,
1857 const Standard_Real V2Depart,
1858 const Standard_Real TolTangency,
1859 const Standard_Real Epsilon,
1860 const Standard_Real Deflection,
1861 const Standard_Real Increment)
1863 // Standard_Integer NbU1 = D1->NbSamplesU();
1864 // Standard_Integer NbV1 = D1->NbSamplesV();
1865 // Standard_Integer NbU2 = D2->NbSamplesU();
1866 // Standard_Integer NbV2 = D2->NbSamplesV();
1868 //-- Traitement des Lignes de sections
1869 empt = Standard_True;
1870 done = Standard_True;
1873 //------------------------------------------------------------
1875 Standard_Real pu1,pu2,pv1,pv2;
1877 TColStd_Array1OfReal StartParams(1,4);
1879 // Standard_Integer MaxOscill = NbU1;
1880 // if(MaxOscill < NbU2) MaxOscill=NbU2;
1881 // if(MaxOscill < NbV1) MaxOscill=NbV1;
1882 // if(MaxOscill < NbV2) MaxOscill=NbV2;
1884 // Standard_Real nIncrement=Increment;
1885 // if(MaxOscill>10) {
1886 // #ifdef OCCT_DEBUG
1887 // std::cout<<"\n IntPatch_PrmPrmIntersection.gxx : Increment:"<<Increment<<" -> "<<Increment/(0.5*MaxOscill)<<std::endl;
1889 // nIncrement/=0.5*MaxOscill;
1892 IntWalk_PWalking PW(Surf1,Surf2,
1896 Increment); //nIncrement);
1899 //Standard_Real SeuildPointLigne = 15.0 * Increment * Increment; //-- 10 est insuffisant
1900 //Standard_Real incidence;
1901 //Standard_Real dminiPointLigne;
1903 Standard_Boolean HasStartPoint;//,RejetLigne;
1905 IntSurf_PntOn2S StartPOn2S;
1907 //Standard_Integer ver;
1909 gp_Pnt Point3dDebut,Point3dFin;
1911 //------------------------------------------------------------
1913 StartParams(1) = U1Depart;
1914 StartParams(2) = V1Depart;
1915 StartParams(3) = U2Depart;
1916 StartParams(4) = V2Depart;
1918 //-----------------------------------------------------------------------
1919 //-- Calcul du premier point de cheminement a partir du point approche --
1920 //-----------------------------------------------------------------------
1921 HasStartPoint = PW.PerformFirstPoint(StartParams,StartPOn2S);
1923 //-------------------------------------------------
1924 //-- Un point a ete trouve --
1925 //-- On verifie qu il n appartient pas --
1926 //-- a une ligne de cheminement deja calculee. --
1927 //-------------------------------------------------
1929 PW.Perform(StartParams);
1931 if(PW.NbPoints()>2) {
1932 Point3dDebut = PW.Value(1).Value();
1933 Point3dFin = PW.Value(PW.NbPoints()).Value();
1935 IntSurf_TypeTrans trans1,trans2;
1936 Standard_Real locu,locv;
1937 gp_Vec norm1,norm2,d1u,d1v;
1939 Standard_Integer indextg;
1940 gp_Vec tgline(PW.TangentAtLine(indextg));
1941 PW.Line()->Value(indextg).ParametersOnS1(locu,locv);
1942 Surf1->D1(locu,locv,ptbid,d1u,d1v);
1943 norm1 = d1u.Crossed(d1v);
1944 PW.Line()->Value(indextg).ParametersOnS2(locu,locv);
1945 Surf2->D1(locu,locv,ptbid,d1u,d1v);
1946 norm2 = d1u.Crossed(d1v);
1947 if (tgline.DotCross(norm2,norm1)>0.) {
1948 trans1 = IntSurf_Out;
1949 trans2 = IntSurf_In;
1952 trans1 = IntSurf_In;
1953 trans2 = IntSurf_Out;
1956 Standard_Real TolTang = TolTangency;
1957 Handle(IntPatch_WLine) wline = new IntPatch_WLine(PW.Line(),Standard_False,trans1,trans2);
1958 wline->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
1960 //the method PutVertexOnLine can reduce the number of points in <wline>
1961 IntPatch_RstInt::PutVertexOnLine(wline,Surf1,D1,Surf2,Standard_True,TolTang);
1962 if (wline->NbPnts() < 2)
1964 IntPatch_RstInt::PutVertexOnLine(wline,Surf2,D2,Surf1,Standard_False,TolTang);
1965 if (wline->NbPnts() < 2)
1969 if(wline->NbVertex() == 0) {
1971 IntSurf_PntOn2S POn2S = PW.Line()->Value(1);
1972 POn2S.Parameters(pu1,pv1,pu2,pv2);
1973 vtx.SetValue(Point3dDebut,TolTang,Standard_False);
1974 vtx.SetParameters(pu1,pv1,pu2,pv2);
1975 vtx.SetParameter(1);
1976 wline->AddVertex(vtx);
1978 POn2S = PW.Line()->Value(wline->NbPnts());
1979 POn2S.Parameters(pu1,pv1,pu2,pv2);
1980 vtx.SetValue(Point3dFin,TolTang,Standard_False);
1981 vtx.SetParameters(pu1,pv1,pu2,pv2);
1982 vtx.SetParameter(wline->NbPnts());
1983 wline->AddVertex(vtx);
1988 empt = Standard_False;
1989 } //if(PW.NbPoints()>2)
1991 } //if(HasStartPoint)
1993 //==================================================================================
1994 // function : AdjustOnPeriodic
1996 //==================================================================================
1997 void AdjustOnPeriodic(const Handle(Adaptor3d_Surface)& Surf1,
1998 const Handle(Adaptor3d_Surface)& Surf2,
1999 IntPatch_SequenceOfLine& aSLin)
2001 Standard_Boolean bIsPeriodic[4], bModified, bIsNull, bIsPeriod;
2002 Standard_Integer i, j, k, aNbLines, aNbPx, aIndx, aIndq;
2003 Standard_Real aPeriod[4], dPeriod[4], ux[4], uq[4], aEps, du;
2005 aEps=Precision::Confusion();
2007 for (k=0; k<4; ++k) {
2011 bIsPeriodic[0]=Surf1->IsUPeriodic();
2012 bIsPeriodic[1]=Surf1->IsVPeriodic();
2013 bIsPeriodic[2]=Surf2->IsUPeriodic();
2014 bIsPeriodic[3]=Surf2->IsVPeriodic();
2016 if (bIsPeriodic[0]){
2017 aPeriod[0]=Surf1->UPeriod();
2019 if (bIsPeriodic[1]){
2020 aPeriod[1]=Surf1->VPeriod();
2022 if (bIsPeriodic[2]){
2023 aPeriod[2]=Surf2->UPeriod();
2025 if (bIsPeriodic[3]){
2026 aPeriod[3]=Surf2->VPeriod();
2029 for (k=0; k<4; ++k) {
2030 dPeriod[k]=0.25*aPeriod[k];
2033 aNbLines=aSLin.Length();
2034 for (i=1; i<=aNbLines; ++i) {
2035 Handle(IntPatch_WLine) aIL=Handle(IntPatch_WLine)::DownCast(aSLin.Value(i));
2036 Handle(IntSurf_LineOn2S) aL=aIL->Curve();
2038 aNbPx=aL->NbPoints();
2043 for (j=0; j<2; ++j) {
2044 bModified=Standard_False;
2052 const IntSurf_PntOn2S& aPSx=aL->Value(aIndx);
2053 const IntSurf_PntOn2S& aPSq=aL->Value(aIndq);
2055 aPSx.Parameters(ux[0], ux[1], ux[2], ux[3]);
2056 aPSq.Parameters(uq[0], uq[1], uq[2], uq[3]);
2058 for (k=0; k<4; ++k) {
2059 bIsNull=Standard_False;
2060 bIsPeriod=Standard_False;
2062 if (!bIsPeriodic[k]) {
2066 if (fabs(ux[k])<aEps) {
2067 bModified=Standard_True;
2068 bIsNull=Standard_True;
2071 else if (fabs(ux[k]-aPeriod[k])<aEps) {
2072 bModified=Standard_True;
2073 bIsPeriod=Standard_True;
2077 du=fabs(ux[k]-uq[k]);
2078 if (du > dPeriod[k]) {
2087 }//for (k=0; k<4; ++k)
2089 IntSurf_PntOn2S aPntOn2S;
2092 aPntOn2S.SetValue(ux[0], ux[1], ux[2], ux[3]);
2093 aL->Value(aIndx, aPntOn2S);
2095 }//for (j=0; j<1; ++j) {
2096 }//for (i=1; i<=aNbLines; ++i)
2099 //==================================================================================
2100 // function : MakeNewPoint
2102 //==================================================================================
2103 IntSurf_PntOn2S MakeNewPoint(const IntSurf_PntOn2S& replacePnt,
2104 const IntSurf_PntOn2S& oldPnt,
2105 const Standard_Real* Periods)
2107 IntSurf_PntOn2S NewPoint;
2108 NewPoint.SetValue(replacePnt.Value());
2110 Standard_Real OldParams[4], NewParams[4];
2111 oldPnt.Parameters(OldParams[0], OldParams[1], OldParams[2], OldParams[3]);
2112 replacePnt.Parameters(NewParams[0], NewParams[1], NewParams[2], NewParams[3]);
2115 for (i = 0; i < 4; i++)
2117 if (Periods[i] != 0.)
2119 if (Abs(NewParams[i] - OldParams[i]) >= 0.5*Periods[i])
2121 if (NewParams[i] < OldParams[i])
2122 NewParams[i] += Periods[i];
2124 NewParams[i] -= Periods[i];
2129 NewPoint.SetValue(NewParams[0], NewParams[1], NewParams[2], NewParams[3]);
2133 //==================================================================================
2134 // function : Perform
2135 // purpose : base SS Int. function
2136 //==================================================================================
2137 void IntPatch_PrmPrmIntersection::Perform (const Handle(Adaptor3d_Surface)& Surf1,
2138 const Handle(Adaptor3d_TopolTool)& D1,
2139 const Handle(Adaptor3d_Surface)& Surf2,
2140 const Handle(Adaptor3d_TopolTool)& D2,
2141 const Standard_Real TolTangency,
2142 const Standard_Real Epsilon,
2143 const Standard_Real Deflection,
2144 const Standard_Real Increment,
2145 const Standard_Boolean ClearFlag)
2147 Standard_Integer Limit = 2500;
2148 Standard_Integer NbU1 = 10, NbV1 = 10, NbU2 = 10, NbV2 = 10;
2150 D1->SamplePnts(Deflection, NbU1, NbV1);
2151 D2->SamplePnts(Deflection, NbU2, NbV2);
2153 NbU1 = D1->NbSamplesU();
2154 NbV1 = D1->NbSamplesV();
2155 NbU2 = D2->NbSamplesU();
2156 NbV2 = D2->NbSamplesV();
2158 TColStd_Array1OfReal anUpars1(1, NbU1), aVpars1(1, NbV1);
2159 TColStd_Array1OfReal anUpars2(1, NbU2), aVpars2(1, NbV2);
2161 D1->UParameters(anUpars1);
2162 D1->VParameters(aVpars1);
2163 D2->UParameters(anUpars2);
2164 D2->VParameters(aVpars2);
2166 Standard_Real Periods [4];
2167 Periods[0] = (Surf1->IsUPeriodic())? Surf1->UPeriod() : 0.;
2168 Periods[1] = (Surf1->IsVPeriodic())? Surf1->VPeriod() : 0.;
2169 Periods[2] = (Surf2->IsUPeriodic())? Surf2->UPeriod() : 0.;
2170 Periods[3] = (Surf2->IsVPeriodic())? Surf2->VPeriod() : 0.;
2172 //---------------------------------------------
2173 if((NbU1*NbV1<=Limit && NbV2*NbU2<=Limit))
2175 empt = Standard_True;
2181 IntPolyh_Intersection* pInterference = NULL;
2183 if ( D1->IsUniformSampling() || D2->IsUniformSampling() )
2185 pInterference = new IntPolyh_Intersection(Surf1,NbU1,NbV1,Surf2,NbU2,NbV2);
2189 pInterference = new IntPolyh_Intersection(Surf1, anUpars1, aVpars1,
2190 Surf2, anUpars2, aVpars2 );
2193 if ( !pInterference )
2195 done = Standard_False;
2199 IntPolyh_Intersection& Interference = *pInterference;
2201 done = Interference.IsDone();
2206 delete pInterference;
2207 pInterference = NULL;
2213 Standard_Integer nbLigSec = Interference.NbSectionLines();
2214 Standard_Integer nbTanZon = Interference.NbTangentZones();
2215 Standard_Real SeuildPointLigne = 15.0 * Increment * Increment;
2217 Standard_Integer NbLigCalculee = 0, ver;
2218 Standard_Real pu1,pu2,pv1,pv2, incidence, dminiPointLigne;
2219 Standard_Boolean HasStartPoint = Standard_False, RejectLine = Standard_False;
2220 IntSurf_PntOn2S StartPOn2S;
2221 gp_Pnt Point3dDebut,Point3dFin;
2223 TColStd_Array1OfReal StartParams(1,4);
2224 IntWalk_PWalking PW(Surf1,Surf2,TolTangency,Epsilon,Deflection,Increment);
2228 Standard_Integer *TabL = new Standard_Integer [nbLigSec+1];
2229 for(Standard_Integer ls=1; ls<=nbLigSec; ++ls)
2233 //----------------------------------------1.1
2235 Standard_Boolean triok;
2236 Standard_Integer nb_A, nb_B, tyu;
2239 triok=Standard_True;
2240 for(Standard_Integer b = 2; b <= nbLigSec; ++b )
2242 nb_B = Interference.NbPointsInLine(TabL[b]);
2243 nb_A = Interference.NbPointsInLine(TabL[b-1]);
2250 triok=Standard_False;
2254 while(triok==Standard_False);
2257 //----------------------------------------
2258 // 1.2 For the line "ls" get 2D-bounds U,V for surfaces 1,2
2260 for(Standard_Integer ls = 1; ls <= nbLigSec; ++ls)
2262 Standard_Integer nbp = Interference.NbPointsInLine(TabL[ls]);
2268 Standard_Integer *TabPtDep = new Standard_Integer [nbp+1];
2269 for(Standard_Integer ilig = 1; ilig <= nbp; ++ilig )
2274 Standard_Real UminLig1,VminLig1,UmaxLig1,VmaxLig1;
2275 Standard_Real UminLig2,VminLig2,UmaxLig2,VmaxLig2;
2276 Standard_Real _x,_y,_z;
2278 Interference.GetLinePoint(TabL[ls], 1, _x, _y, _z,
2279 UminLig1, VminLig1, UminLig2, VminLig2,
2287 for(Standard_Integer ilig = 2; ilig <= nbp; ilig++ )
2289 Standard_Real U1, U2, V1, V2;
2290 Interference.GetLinePoint(TabL[ls],ilig,_x,_y,_z,U1,V1,U2,V2,incidence);
2292 if(U1>UmaxLig1) UmaxLig1=U1;
2293 if(V1>VmaxLig1) VmaxLig1=V1;
2294 if(U2>UmaxLig2) UmaxLig2=U2;
2295 if(V2>VmaxLig2) VmaxLig2=V2;
2297 if(U1<UminLig1) UminLig1=U1;
2298 if(V1<VminLig1) VminLig1=V1;
2299 if(U2<UminLig2) UminLig2=U2;
2300 if(V2<VminLig2) VminLig2=V2;
2301 }//for( ilig = 2; ilig <= nbp; ilig++ ) {
2303 //----------------------------------------
2305 Standard_Integer nbps2 = (nbp>3)? (nbp/2) : 1;
2306 Standard_Integer NombreDePointsDeDepartDuCheminement = 0;
2307 Standard_Boolean lignetrouvee=Standard_False;
2308 const Standard_Integer NbDePointsDeDepartDuChmLimit = 5;
2312 NombreDePointsDeDepartDuCheminement++;
2313 switch (NombreDePointsDeDepartDuCheminement)
2316 nbps2 = (nbp > 1) ? nbp/2 : 1;
2318 NombreDePointsDeDepartDuCheminement = NbDePointsDeDepartDuChmLimit;
2329 nbps2 = 3 * nbp / 4;
2336 nbps2 = NombreDePointsDeDepartDuCheminement-3;
2337 NombreDePointsDeDepartDuCheminement++;
2341 if(TabPtDep[nbps2] == 0)
2343 Standard_Real U1, U2, V1, V2;
2345 TabPtDep[nbps2] = 1;
2346 Interference.GetLinePoint(TabL[ls],nbps2,_x,_y,_z,U1,V1,U2,V2,incidence);
2348 StartParams(1) = U1;
2349 StartParams(2) = V1;
2350 StartParams(3) = U2;
2351 StartParams(4) = V2;
2353 HasStartPoint = PW.PerformFirstPoint(StartParams,StartPOn2S);
2354 dminiPointLigne = SeuildPointLigne + SeuildPointLigne;
2357 StartPOn2S.Parameters(pu1,pv1,pu2,pv2);
2358 NbLigCalculee = SLin.Length();
2360 for( l = 1; (l <= NbLigCalculee) && (dminiPointLigne >= SeuildPointLigne); l++)
2362 const Handle(IntPatch_WLine)& testwline = *((Handle(IntPatch_WLine)*)&SLin.Value(l));
2364 if (IsPointOnLine(StartPOn2S, testwline, Deflection))
2366 dminiPointLigne = 0.0;
2370 if(dminiPointLigne > SeuildPointLigne)
2372 PW.Perform(StartParams, UminLig1, VminLig1, UminLig2, VminLig2,
2373 UmaxLig1, VmaxLig1, UmaxLig2, VmaxLig2);
2376 Standard_Boolean bPWIsDone;
2377 Standard_Real aD11, aD12, aD21, aD22, aDx;
2379 bPWIsDone=PW.IsDone();
2383 Standard_Boolean hasBeenAdded = Standard_False;
2384 if(PW.NbPoints() > 2 )
2386 //Try to extend the intersection line to the boundary,
2388 PW.PutToBoundary(Surf1, Surf2);
2390 const Standard_Integer aMinNbPoints = 40;
2391 if(PW.NbPoints() < aMinNbPoints)
2393 hasBeenAdded = PW.SeekAdditionalPoints(Surf1, Surf2, aMinNbPoints);
2396 Standard_Integer iPWNbPoints = PW.NbPoints(), aNbPointsVer = 0;
2397 RejectLine = Standard_False;
2398 Point3dDebut = PW.Value(1).Value();
2399 Point3dFin = PW.Value(iPWNbPoints).Value();
2400 for( ver = 1; (!RejectLine) && (ver<= NbLigCalculee); ++ver)
2402 const Handle(IntPatch_WLine)& verwline = *((Handle(IntPatch_WLine)*)&SLin.Value(ver));
2404 aNbPointsVer=verwline->NbPnts();
2410 const IntSurf_PntOn2S& verPointDebut = verwline->Point(1);
2411 const IntSurf_PntOn2S& verPointFin = verwline->Point(verwline->NbPnts());
2413 const gp_Pnt& aP21=verPointDebut.Value();
2414 const gp_Pnt& aP22=verPointFin.Value();
2416 aD11=Point3dDebut.Distance(aP21);
2417 aD12=Point3dDebut.Distance(aP22);
2418 aD21=Point3dFin.Distance(aP21);
2419 aD22=Point3dFin.Distance(aP22);
2421 if((aD11<=TolTangency && aD22<=TolTangency) ||
2422 (aD12<=TolTangency && aD21<=TolTangency))
2424 Standard_Integer m, mx;
2432 const gp_Pnt& aPx=verwline->Point(mx).Value();
2433 for(m=1; m<iPWNbPoints; ++m)
2435 const gp_Pnt& aP1=PW.Value(m).Value();
2436 const gp_Pnt& aP2=PW.Value(m+1).Value();
2437 gp_Vec aVec12(aP1, aP2);
2438 if (aVec12.SquareMagnitude()<1.e-20)
2444 gp_Dir aDir12(aVec12);
2445 gp_Lin aLin12(aP1, aDir12);
2446 aDx=aLin12.Distance(aPx);
2448 //modified by NIZNHY-PKV Tue May 10 11:08:07 2011f
2449 if (aDx<=2.*Epsilon)
2451 //if (aDx<=TolTangency) {
2452 //modified by NIZNHY-PKV Tue May 10 11:08:13 2011t
2454 RejectLine = Standard_True;
2458 }//for(m=1; m<iPWNbPoints; ++m){
2459 }//if((aD11<=TolTangency && aD22<=TolTangency) ||...
2460 }// for( ver = 1 ; (!RejetLigne) && (ver<= NbLigCalculee) ; ver++) {
2465 DublicateOfLinesProcessing(PW, ver, SLin, RejectLine);
2470 IntSurf_TypeTrans trans1,trans2;
2471 Standard_Real locu,locv;
2472 gp_Vec norm1,norm2,d1u,d1v;
2474 Standard_Integer indextg;
2475 gp_Vec tgline(PW.TangentAtLine(indextg));
2476 PW.Line()->Value(indextg).ParametersOnS1(locu,locv);
2477 Surf1->D1(locu,locv,ptbid,d1u,d1v);
2478 norm1 = d1u.Crossed(d1v);
2479 PW.Line()->Value(indextg).ParametersOnS2(locu,locv);
2480 Surf2->D1(locu,locv,ptbid,d1u,d1v);
2481 norm2 = d1u.Crossed(d1v);
2482 if( tgline.DotCross(norm2,norm1) >= 0. )
2484 trans1 = IntSurf_Out;
2485 trans2 = IntSurf_In;
2489 trans1 = IntSurf_In;
2490 trans2 = IntSurf_Out;
2493 Standard_Real TolTang = TolTangency;
2494 Handle(IntPatch_WLine) wline = new IntPatch_WLine(PW.Line(),Standard_False,trans1,trans2);
2495 wline->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
2496 wline->EnablePurging(!hasBeenAdded);
2497 //the method PutVertexOnLine can reduce the number of points in <wline>
2498 IntPatch_RstInt::PutVertexOnLine(wline,Surf1,D1,Surf2,Standard_True,TolTang);
2499 if (wline->NbPnts() < 2)
2501 IntPatch_RstInt::PutVertexOnLine(wline,Surf2,D2,Surf1,Standard_False,TolTang);
2502 if (wline->NbPnts() < 2)
2504 if(wline->NbVertex() == 0)
2507 IntSurf_PntOn2S POn2S = PW.Line()->Value(1);
2508 POn2S.Parameters(pu1,pv1,pu2,pv2);
2509 vtx.SetValue(Point3dDebut,TolTang,Standard_False);
2510 vtx.SetParameters(pu1,pv1,pu2,pv2);
2511 vtx.SetParameter(1);
2512 wline->AddVertex(vtx);
2514 POn2S = PW.Line()->Value(wline->NbPnts());
2515 POn2S.Parameters(pu1,pv1,pu2,pv2);
2516 vtx.SetValue(Point3dFin,TolTang,Standard_False);
2517 vtx.SetParameters(pu1,pv1,pu2,pv2);
2518 vtx.SetParameter(wline->NbPnts());
2519 wline->AddVertex(vtx);
2522 lignetrouvee = Standard_True;
2524 SeveralWlinesProcessing(Surf1, Surf2, SLin, Periods, trans1, trans2,
2525 TolTang, Max(PW.MaxStep(0), PW.MaxStep(1)),
2526 Max(PW.MaxStep(2), PW.MaxStep(3)), wline);
2528 AddWLine(SLin, wline, Deflection);
2529 empt = Standard_False;
2533 }// dminiPointLigne > SeuildPointLigne
2535 }// if TabPtDep[nbps2] == 0
2536 } while(nbp>5 && !( (NombreDePointsDeDepartDuCheminement >= NbDePointsDeDepartDuChmLimit && lignetrouvee) ||
2537 (NombreDePointsDeDepartDuCheminement-3 >= nbp && (!lignetrouvee))));
2543 }// if nbLigSec >= 1
2545 AdjustOnPeriodic(Surf1, Surf2, SLin);
2548 //--------------------------------------------------------------------
2549 //-- Calcul des parametres approches a partir des Zones De Tangence --
2550 //--------------------------------------------------------------------
2551 Standard_Real UminLig1,VminLig1,UmaxLig1,VmaxLig1;
2552 Standard_Real UminLig2,VminLig2,UmaxLig2,VmaxLig2;
2554 UminLig1=VminLig1=UminLig2=VminLig2=RealLast();
2555 UmaxLig1=VmaxLig1=UmaxLig2=VmaxLig2=-UminLig1;
2557 // NbPointsInTangentZone always == 1 (eap)
2560 for( z=1; z <= nbTanZon; z++)
2562 //Standard_Integer NbPointsInTangentZone=Interference.NbPointsInTangentZone(z);
2563 //for(Standard_Integer pz=1; pz<=NbPointsInTangentZone; pz++) {
2564 Standard_Integer pz=1;
2565 Standard_Real _x,_y,_z;
2566 Standard_Real U1, U2, V1, V2;
2567 Interference.GetTangentZonePoint(z,pz,_x,_y,_z,U1,V1,U2,V2);
2569 if(U1>UmaxLig1) UmaxLig1=U1;
2570 if(V1>VmaxLig1) VmaxLig1=V1;
2571 if(U2>UmaxLig2) UmaxLig2=U2;
2572 if(V2>VmaxLig2) VmaxLig2=V2;
2574 if(U1<UminLig1) UminLig1=U1;
2575 if(V1<VminLig1) VminLig1=V1;
2576 if(U2<UminLig2) UminLig2=U2;
2577 if(V2<VminLig2) VminLig2=V2;
2581 for(z=1; z <= nbTanZon; z++)
2583 //Standard_Integer NbPointsInTangentZone=Interference.NbPointsInTangentZone(z);
2584 //for(Standard_Integer pz=1; pz<=NbPointsInTangentZone; pz++) {
2585 Standard_Integer pz=1;
2586 Standard_Real _x,_y,_z;
2587 Standard_Real U1, U2, V1, V2;
2588 Interference.GetTangentZonePoint(z,pz,_x,_y,_z,U1,V1,U2,V2);
2590 StartParams(1) = U1;
2591 StartParams(2) = V1;
2592 StartParams(3) = U2;
2593 StartParams(4) = V2;
2595 //-----------------------------------------------------------------------
2596 //-- Calcul du premier point de cheminement a partir du point approche --
2597 //-----------------------------------------------------------------------
2598 HasStartPoint = PW.PerformFirstPoint(StartParams,StartPOn2S);
2601 //-------------------------------------------------
2602 //-- Un point a ete trouve --
2603 //-- On verifie qu il n appartient pas --
2604 //-- a une ligne de cheminement deja calculee. --
2605 //-------------------------------------------------
2606 StartPOn2S.Parameters(pu1,pv1,pu2,pv2);
2608 NbLigCalculee = SLin.Length();
2609 dminiPointLigne = SeuildPointLigne + SeuildPointLigne;
2611 for(Standard_Integer l=1;
2612 (l <= NbLigCalculee) && (dminiPointLigne >= SeuildPointLigne);
2615 const Handle(IntPatch_WLine)& testwline = *((Handle(IntPatch_WLine)*)&SLin.Value(l));
2617 if (IsPointOnLine(StartPOn2S, testwline, Deflection))
2619 dminiPointLigne = 0.0;
2623 //-- Fin d exploration des lignes
2624 if(dminiPointLigne > SeuildPointLigne)
2626 //---------------------------------------------------
2627 //-- Le point de depart du nouveau cheminement --
2628 //-- n est present dans aucune ligne deja calculee.--
2629 //---------------------------------------------------
2630 PW.Perform(StartParams,UminLig1,VminLig1,UminLig2,VminLig2,
2631 UmaxLig1,VmaxLig1,UmaxLig2,VmaxLig2);
2635 Standard_Boolean hasBeenAdded = Standard_False;
2638 const Standard_Integer aMinNbPoints = 40;
2639 if(PW.NbPoints() < aMinNbPoints)
2641 hasBeenAdded = PW.SeekAdditionalPoints(Surf1, Surf2, aMinNbPoints);
2644 //-----------------------------------------------
2645 //-- Verification a posteriori :
2646 //-- On teste si le point de depart et de fin de
2647 //-- la ligne de cheminement est present dans une
2649 //-----------------------------------------------
2650 RejectLine = Standard_False;
2651 Point3dDebut = PW.Value(1).Value();
2652 const IntSurf_PntOn2S& PointFin = PW.Value(PW.NbPoints());
2653 Point3dFin = PointFin.Value();
2655 for(ver=1 ; (!RejectLine) && (ver<= NbLigCalculee) ; ver++)
2657 const Handle(IntPatch_WLine)& verwline = *((Handle(IntPatch_WLine)*)&SLin.Value(ver));
2658 //-- Handle(IntPatch_WLine) verwline=Handle(IntPatch_WLine)::DownCast(SLin.Value(ver));
2660 // Check end point if it is on existing line.
2661 // Start point is checked before.
2662 if (IsPointOnLine(PointFin, verwline, Deflection))
2664 RejectLine = Standard_True;
2668 const IntSurf_PntOn2S& verPointDebut = verwline->Point(1);
2669 const IntSurf_PntOn2S& verPointFin = verwline->Point(verwline->NbPnts());
2670 if(Point3dDebut.Distance(verPointDebut.Value()) < TolTangency)
2672 RejectLine = Standard_True;
2676 if(Point3dFin.Distance(verPointFin.Value()) < TolTangency)
2678 RejectLine = Standard_True;
2685 IntSurf_TypeTrans trans1,trans2;
2686 Standard_Real locu,locv;
2687 gp_Vec norm1,norm2,d1u,d1v;
2689 Standard_Integer indextg;
2690 gp_Vec tgline(PW.TangentAtLine(indextg));
2691 PW.Line()->Value(indextg).ParametersOnS1(locu,locv);
2692 Surf1->D1(locu,locv,ptbid,d1u,d1v);
2693 norm1 = d1u.Crossed(d1v);
2694 PW.Line()->Value(indextg).ParametersOnS2(locu,locv);
2695 Surf2->D1(locu,locv,ptbid,d1u,d1v);
2696 norm2 = d1u.Crossed(d1v);
2697 if (tgline.DotCross(norm2,norm1)>0.)
2699 trans1 = IntSurf_Out;
2700 trans2 = IntSurf_In;
2704 trans1 = IntSurf_In;
2705 trans2 = IntSurf_Out;
2708 Standard_Real TolTang = TolTangency;
2709 Handle(IntPatch_WLine) wline = new IntPatch_WLine(PW.Line(),Standard_False,trans1,trans2);
2710 wline->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
2711 wline->EnablePurging(!hasBeenAdded);
2712 //the method PutVertexOnLine can reduce the number of points in <wline>
2713 IntPatch_RstInt::PutVertexOnLine(wline,Surf1,D1,Surf2,Standard_True,TolTang);
2714 if (wline->NbPnts() < 2)
2716 IntPatch_RstInt::PutVertexOnLine(wline,Surf2,D2,Surf1,Standard_False,TolTang);
2717 if (wline->NbPnts() < 2)
2721 if(wline->NbVertex() == 0)
2724 IntSurf_PntOn2S POn2S = PW.Line()->Value(1);
2725 POn2S.Parameters(pu1,pv1,pu2,pv2);
2726 vtx.SetValue(Point3dDebut,TolTang,Standard_False);
2727 vtx.SetParameters(pu1,pv1,pu2,pv2);
2728 vtx.SetParameter(1);
2729 wline->AddVertex(vtx);
2731 POn2S = PW.Line()->Value(wline->NbPnts());
2732 POn2S.Parameters(pu1,pv1,pu2,pv2);
2733 vtx.SetValue(Point3dFin,TolTang,Standard_False);
2734 vtx.SetParameters(pu1,pv1,pu2,pv2);
2735 vtx.SetParameter(wline->NbPnts());
2736 wline->AddVertex(vtx);
2740 AddWLine(SLin, wline, Deflection);
2741 empt = Standard_False;
2745 //-- std::cout<<" ----- REJET DE LIGNE (POINT DE DEPART) ----- "<<std::endl;
2747 //------------------------------------------------------------
2749 } //-- le cheminement a reussi (done a True)
2750 } //-- le point approche ne renvoie pas sur une ligne existante
2751 } //-- Si HasStartPoint
2752 //} //-- Boucle Sur les Points de la Tangent Zone
2753 } //-- Boucle sur Les Tangent Zones
2755 if ( pInterference )
2757 delete pInterference;
2758 pInterference = NULL;
2762 }// if((NbU1*NbV1<=Limit && NbV2*NbU2<=Limit)) {
2764 Handle(IntSurf_LineOn2S) LOn2S = new IntSurf_LineOn2S();
2765 PointDepart( LOn2S, Surf1, NbU1, NbV1, Surf2, NbU2, NbV2 );
2766 empt = Standard_True;
2767 done = Standard_True;
2769 Standard_Integer NbLigCalculee = 0;
2770 Standard_Real U1,U2,V1,V2;
2771 Standard_Real pu1,pu2,pv1,pv2;
2773 TColStd_Array1OfReal StartParams(1,4);
2774 Standard_Integer MaxOscill = NbU1;
2775 if(MaxOscill < NbU2) MaxOscill=NbU2;
2776 if(MaxOscill < NbV1) MaxOscill=NbV1;
2777 if(MaxOscill < NbV2) MaxOscill=NbV2;
2779 Standard_Real nIncrement=Increment;
2781 //nIncrement/=0.5*MaxOscill;
2783 IntWalk_PWalking PW(Surf1,Surf2,TolTangency,Epsilon,Deflection,nIncrement);
2784 Standard_Real SeuildPointLigne = 15.0 * Increment * Increment; //-- 10 est insuffisant
2785 Standard_Real dminiPointLigne;
2786 Standard_Boolean HasStartPoint,RejetLigne;
2787 IntSurf_PntOn2S StartPOn2S;
2788 Standard_Integer ver;
2789 gp_Pnt Point3dDebut,Point3dFin;
2791 //------------------------------------------------------------
2792 //-- Calcul des parametres approches a partir des Zones De Tangence --
2793 //--------------------------------------------------------------------
2794 Standard_Integer nbTanZon = LOn2S->NbPoints();
2795 for(Standard_Integer z=1; z <= nbTanZon; z++) {
2796 const IntSurf_PntOn2S& POn2S = LOn2S->Value(z);
2797 POn2S.Parameters(U1,V1,U2,V2);
2798 StartParams(1) = U1;
2799 StartParams(2) = V1;
2800 StartParams(3) = U2;
2801 StartParams(4) = V2;
2803 //-----------------------------------------------------------------------
2804 //-- Calcul du premier point de cheminement a partir du point approche --
2805 //-----------------------------------------------------------------------
2806 HasStartPoint = PW.PerformFirstPoint(StartParams,StartPOn2S);
2809 //-------------------------------------------------
2810 //-- Un point a ete trouve --
2811 //-- On verifie qu il n appartient pas --
2812 //-- a une ligne de cheminement deja calculee. --
2813 //-------------------------------------------------
2814 StartPOn2S.Parameters(pu1,pv1,pu2,pv2);
2816 NbLigCalculee = SLin.Length();
2817 dminiPointLigne = SeuildPointLigne + SeuildPointLigne;
2819 for(Standard_Integer l=1;
2820 (l <= NbLigCalculee) && (dminiPointLigne >= SeuildPointLigne);
2823 const Handle(IntPatch_WLine)& testwline = *((Handle(IntPatch_WLine)*)&SLin.Value(l));
2825 if (IsPointOnLine(StartPOn2S, testwline, Deflection))
2827 dminiPointLigne = 0.0;
2831 //-- Fin d exploration des lignes
2832 if(dminiPointLigne > SeuildPointLigne)
2834 //---------------------------------------------------
2835 //-- Le point de depart du nouveau cheminement --
2836 //-- n est present dans aucune ligne deja calculee.--
2837 //---------------------------------------------------
2838 PW.Perform(StartParams);
2843 //-----------------------------------------------
2844 //-- Verification a posteriori :
2845 //-- On teste si le point de depart et de fin de
2846 //-- la ligne de cheminement est present dans une
2848 //-----------------------------------------------
2849 RejetLigne = Standard_False;
2850 Point3dDebut = PW.Value(1).Value();
2851 const IntSurf_PntOn2S& PointFin = PW.Value(PW.NbPoints());
2852 Point3dFin = PointFin.Value();
2854 for(ver=1 ; ver<= NbLigCalculee ; ver++)
2856 const Handle(IntPatch_WLine)& verwline = *((Handle(IntPatch_WLine)*)&SLin.Value(ver));
2857 //-- Handle(IntPatch_WLine) verwline=Handle(IntPatch_WLine)::DownCast(SLin.Value(ver));
2859 // Check end point if it is on existing line.
2860 // Start point is checked before.
2861 if (IsPointOnLine(PointFin, verwline, Deflection))
2863 RejetLigne = Standard_True;
2867 const IntSurf_PntOn2S& verPointDebut = verwline->Point(1);
2868 const IntSurf_PntOn2S& verPointFin = verwline->Point(verwline->NbPnts());
2869 if( (Point3dDebut.Distance(verPointDebut.Value()) < TolTangency) ||
2870 (Point3dFin.Distance(verPointFin.Value()) < TolTangency))
2872 RejetLigne = Standard_True;
2879 DublicateOfLinesProcessing(PW, ver, SLin, RejetLigne);
2884 IntSurf_TypeTrans trans1,trans2;
2885 Standard_Real locu,locv;
2886 gp_Vec norm1,norm2,d1u,d1v;
2888 Standard_Integer indextg;
2889 gp_Vec tgline(PW.TangentAtLine(indextg));
2890 PW.Line()->Value(indextg).ParametersOnS1(locu,locv);
2891 Surf1->D1(locu,locv,ptbid,d1u,d1v);
2892 norm1 = d1u.Crossed(d1v);
2893 PW.Line()->Value(indextg).ParametersOnS2(locu,locv);
2894 Surf2->D1(locu,locv,ptbid,d1u,d1v);
2895 norm2 = d1u.Crossed(d1v);
2896 if (tgline.DotCross(norm2,norm1)>0.)
2898 trans1 = IntSurf_Out;
2899 trans2 = IntSurf_In;
2902 trans1 = IntSurf_In;
2903 trans2 = IntSurf_Out;
2906 Standard_Real TolTang = TolTangency;
2907 Handle(IntPatch_WLine) wline = new IntPatch_WLine(PW.Line(),Standard_False,trans1,trans2);
2908 wline->SetCreatingWayInfo(IntPatch_WLine::IntPatch_WLPrmPrm);
2910 //the method PutVertexOnLine can reduce the number of points in <wline>
2911 IntPatch_RstInt::PutVertexOnLine(wline,Surf1,D1,Surf2,Standard_True,TolTang);
2912 if (wline->NbPnts() < 2)
2914 IntPatch_RstInt::PutVertexOnLine(wline,Surf2,D2,Surf1,Standard_False,TolTang);
2915 if (wline->NbPnts() < 2)
2919 if(wline->NbVertex() == 0)
2922 const IntSurf_PntOn2S& POn2Sf = PW.Line()->Value(1);
2923 POn2Sf.Parameters(pu1,pv1,pu2,pv2);
2924 vtx.SetValue(Point3dDebut,TolTang,Standard_False);
2925 vtx.SetParameters(pu1,pv1,pu2,pv2);
2926 vtx.SetParameter(1);
2927 wline->AddVertex(vtx);
2929 const IntSurf_PntOn2S& POn2Sl = PW.Line()->Value(wline->NbPnts());
2930 POn2Sl.Parameters(pu1,pv1,pu2,pv2);
2931 vtx.SetValue(Point3dFin,TolTang,Standard_False);
2932 vtx.SetParameters(pu1,pv1,pu2,pv2);
2933 vtx.SetParameter(wline->NbPnts());
2934 wline->AddVertex(vtx);
2938 AddWLine(SLin, wline, Deflection);
2939 empt = Standard_False;
2943 //-- std::cout<<" ----- REJET DE LIGNE (POINT DE DEPART) ----- "<<std::endl;
2945 //------------------------------------------------------------
2947 } //-- le cheminement a reussi (done a True)
2948 } //-- le point approche ne renvoie pas sur une ligne existante
2949 } //-- Si HasStartPoint
2950 } //-- Boucle sur Les Tangent Zones
2952 //modified by NIZNHY-PKV Wed May 25 09:39:07 2011f
2953 //=======================================================================
2954 //class : IntPatch_InfoPD
2956 //=======================================================================
2957 class IntPatch_InfoPD {
2959 //----------------------------------------C-tor
2960 IntPatch_InfoPD(const Standard_Integer aNBI) {
2961 Standard_Integer aNBI2, i, j;
2965 myP1DS2=new char[aNBI2];
2966 myP2DS1=new char[aNBI2];
2967 myIP1=new Standard_Integer[aNBI2];
2968 myIP2=new Standard_Integer[aNBI2];
2969 myP1=new gp_Pnt[aNBI2];
2970 myP2=new gp_Pnt[aNBI2];
2972 for (i=0; i<myNBI; ++i) {
2973 for (j=0; j<myNBI; ++j) {
2978 xP1(i, j).SetCoord(0., 0., 0.);
2979 xP2(i, j).SetCoord(0., 0., 0.);
2983 //---------------------------------------- D-tor
2984 ~IntPatch_InfoPD() {
2985 delete [] (char*) myP1DS2;
2986 delete [] (char*) myP2DS1;
2987 delete [] (Standard_Integer*) myIP1;
2988 delete [] (Standard_Integer*) myIP2;
2989 delete [] (gp_Pnt*)myP1;
2990 delete [] (gp_Pnt*)myP2;
2992 //---------------------------------------- Index
2993 Standard_Integer Index(const Standard_Integer i,
2994 const Standard_Integer j) const {
2997 //---------------------------------------- NBI
2998 Standard_Integer NBI() const {
3001 //----------------------------------------xP1DS2
3002 char& xP1DS2(const Standard_Integer i,
3003 const Standard_Integer j) {
3004 return myP1DS2[Index(i,j)];
3006 //----------------------------------------xP2DS1
3007 char& xP2DS1(const Standard_Integer i,
3008 const Standard_Integer j) {
3009 return myP2DS1[Index(i,j)];
3011 //----------------------------------------xIP1
3012 Standard_Integer& xIP1(const Standard_Integer i,
3013 const Standard_Integer j) {
3014 return myIP1[Index(i,j)];
3016 //----------------------------------------xIP2
3017 Standard_Integer& xIP2(const Standard_Integer i,
3018 const Standard_Integer j) {
3019 return myIP2[Index(i,j)];
3021 //----------------------------------------xP1
3022 gp_Pnt& xP1(const Standard_Integer i,
3023 const Standard_Integer j) {
3024 return myP1[Index(i,j)];
3026 //----------------------------------------xP1
3027 gp_Pnt& xP2(const Standard_Integer i,
3028 const Standard_Integer j) {
3029 return myP2[Index(i,j)];
3034 IntPatch_InfoPD (const IntPatch_InfoPD&);
3035 IntPatch_InfoPD& operator=(const IntPatch_InfoPD&);
3039 Standard_Integer myNBI;
3042 Standard_Integer *myIP1;
3043 Standard_Integer *myIP2;
3047 //modified by NIZNHY-PKV Tue May 24 11:38:55 2011t
3048 //==================================================================================
3049 // function : PointDepart
3051 //==================================================================================
3052 void IntPatch_PrmPrmIntersection::PointDepart(Handle(IntSurf_LineOn2S)& LineOn2S,
3053 const Handle(Adaptor3d_Surface)& S1,
3054 const Standard_Integer SU_1,
3055 const Standard_Integer SV_1,
3056 const Handle(Adaptor3d_Surface)& S2,
3057 const Standard_Integer SU_2,
3058 const Standard_Integer SV_2) const
3060 Standard_Integer i, j, xNBI;
3061 //modified by NIZNHY-PKV Tue May 24 11:37:38 2011f
3063 IntPatch_InfoPD aIPD(xNBI);
3064 //modified by NIZNHY-PKV Wed May 25 06:47:12 2011t
3065 Standard_Integer iC15, SU1, SV1, SU2, SV2;
3066 Standard_Real U0, U1, V0, V1, U, V;
3067 Standard_Real resu0,resv0;
3068 Standard_Real du1,du2,dv1,dv2, dmaxOn1, dmaxOn2;
3069 Standard_Real x0,y0,z0, x1,y1,z1,d;
3091 U0 = S1->FirstUParameter();
3092 U1 = S1->LastUParameter();
3093 V0 = S1->FirstVParameter();
3094 V1 = S1->LastVParameter();
3102 du1 = (U1-U0)/(SU1-1);
3103 dv1 = (V1-V0)/(SV1-1);
3104 for(U=U0,i=0; i<SU1; i++,U+=du1) {
3105 for(V=V0,j=0; j<SV1; V+=dv1,j++) {
3106 aIPD.xP1(i, j)= S1->Value(U,V);
3107 Box1.Add(aIPD.xP1(i, j));
3109 aIPD.xP1(i, j) .Coord(x0,y0,z0);
3110 aIPD.xP1(i-1, j-1).Coord(x1,y1,z1);
3112 d=Abs(x1-x0)+Abs(y1-y0)+Abs(z1-z0);
3119 Box1.Enlarge(1.e-8);
3121 U0 = S2->FirstUParameter();
3122 U1 = S2->LastUParameter();
3123 V0 = S2->FirstVParameter();
3124 V1 = S2->LastVParameter();
3126 du2 = (U1-U0)/(SU2-1);
3127 dv2 = (V1-V0)/(SV2-1);
3128 for(U=U0,i=0; i<SU2; i++,U+=du2) {
3129 for(V=V0,j=0; j<SV2; V+=dv2,j++) {
3130 aIPD.xP2(i, j) = S2->Value(U,V);
3131 Box2.Add(aIPD.xP2(i, j));
3133 aIPD.xP2(i, j) .Coord(x0,y0,z0);
3134 aIPD.xP2(i-1, j-1).Coord(x1,y1,z1);
3135 d = Abs(x1-x0)+Abs(y1-y0)+Abs(z1-z0);
3142 Box2.Enlarge(1.e-8);
3145 if(Box1.IsOut(Box2)) {
3150 Standard_Integer aNbPG;
3151 Standard_Real x10,y10,z10,x11,y11,z11;
3152 Standard_Real x20,y20,z20,x21,y21,z21;
3153 Standard_Real dx, dy, dz, dmax;
3154 Standard_Real dx2, dy2, dz2;
3156 Box1.Get(x10,y10,z10,x11,y11,z11);
3157 Box2.Get(x20,y20,z20,x21,y21,z21);
3159 x0 = (x10>x20)? x10 : x20;
3160 y0 = (y10>y20)? y10 : y20;
3161 z0 = (z10>z20)? z10 : z20;
3163 x1 = (x11<x21)? x11 : x21;
3164 y1 = (y11<y21)? y11 : y21;
3165 z1 = (z11<z21)? z11 : z21;
3167 if(dmaxOn2 > dmaxOn1) {
3179 x10-=dmaxOn1; y10-=dmaxOn1; z10-=dmaxOn1;
3180 x11+=dmaxOn1; y11+=dmaxOn1; z11+=dmaxOn1;
3182 x20-=dmaxOn1; y20-=dmaxOn1; z20-=dmaxOn1;
3183 x21+=dmaxOn1; y21+=dmaxOn1; z21+=dmaxOn1;
3185 aNbPG=NbPointsGrille();
3212 IntPatch_PrmPrmIntersection_T3Bits M1(_BASE);
3213 IntPatch_PrmPrmIntersection_T3Bits M2(_BASE);
3215 for(i=0;i<SU1;i++) {
3216 for(j=0;j<SV1;j++) {
3218 const gp_Pnt& P=aIPD.xP1(i, j);
3219 aIPD.xP1DS2(i, j) = (char)CodeReject(x20,y20,z20,x21,y21,z21,P.X(),P.Y(),P.Z());
3220 int ix = (int)((P.X()-x0 + dx2 )/dx);
3221 if(DansGrille(ix)) {
3222 int iy = (int)((P.Y()-y0 + dy2)/dy);
3223 if(DansGrille(iy)) {
3224 int iz = (int)((P.Z()-z0 + dz2)/dz);
3225 if(DansGrille(iz)) {
3226 aIPD.xIP1(i, j) = GrilleInteger(ix,iy,iz);
3232 //-- std::cout<<" Grille du 1 fini "<<std::endl;
3233 for(i=0;i<SU2;i++) {
3234 for(j=0;j<SV2;j++) {
3236 const gp_Pnt& P=aIPD.xP2(i, j);
3237 aIPD.xP2DS1(i, j) = (char)CodeReject(x10,y10,z10,x11,y11,z11,P.X(),P.Y(),P.Z());
3238 int ix = (int)((P.X()-x0 + dx2)/dx);
3239 if(DansGrille(ix)) {
3240 int iy = (int)((P.Y()-y0 + dy2)/dy);
3241 if(DansGrille(iy)) {
3242 int iz = (int)((P.Z()-z0 + dz2)/dz);
3243 if(DansGrille(iz)) {
3244 aIPD.xIP2(i, j) = GrilleInteger(ix,iy,iz);
3251 for(i=0;i<SU1-1;i+=1) {
3252 for(j=0;j<SV1-1;j+=1) {
3253 if(!((aIPD.xP1DS2(i, j) & aIPD.xP1DS2(i+1, j)) ||
3254 (aIPD.xP1DS2(i, j) & aIPD.xP1DS2(i+1, j+1)))){
3255 Remplit(aIPD.xIP1(i, j),
3257 aIPD.xIP1(i+1, j+1),
3260 if(!((aIPD.xP1DS2(i, j) & aIPD.xP1DS2(i, j+1)) ||
3261 (aIPD.xP1DS2(i, j) & aIPD.xP1DS2(i+1, j+1)))) {
3262 Remplit(aIPD.xIP1(i, j),
3264 aIPD.xIP1(i+1, j+1),
3270 for(i=0;i<SU2-1;i+=1) {
3271 for(j=0;j<SV2-1;j+=1) {
3272 if(!((aIPD.xP2DS1(i, j) & aIPD.xP2DS1(i+1, j)) ||
3273 (aIPD.xP2DS1(i, j) & aIPD.xP2DS1(i+1, j+1)))){
3274 Remplit(aIPD.xIP2(i, j),
3276 aIPD.xIP2(i+1, j+1),
3279 if(!((aIPD.xP2DS1(i, j) & aIPD.xP2DS1(i, j+1)) ||
3280 (aIPD.xP2DS1(i, j) & aIPD.xP2DS1(i+1, j+1)))){
3281 Remplit(aIPD.xIP2(i, j),
3283 aIPD.xIP2(i+1, j+1),
3293 long unsigned Compt=0;
3295 int indicepointtraite = 0;
3296 Standard_Integer k,nu,nv;
3299 indicepointtraite--;
3300 ok = M1.And(M2,newind);
3302 IntegerGrille(newind,i,j,k);
3305 if( DansGrille(i-1) && DansGrille(j-1) && DansGrille(k-1)
3306 && DansGrille(i+1) && DansGrille(j+1) && DansGrille(k+1)) {
3308 for(si=-1; si<= 1 && nb<LIM; si++) {
3309 for(sj=-1; sj<= 1 && nb<LIM; sj++) {
3310 for(sk=-1; sk<= 1 && nb<LIM; sk++) {
3311 long unsigned lu=GrilleInteger(i+si,j+sj,k+sk);
3312 if(M1.Val(lu) && M2.Val(lu)) {
3319 for(si=-1; si<= 1; si++) {
3320 for(sj=-1; sj<= 1; sj++) {
3321 for(sk=-1; sk<= 1; sk++) {
3322 if(si || sj || sk) {
3323 long unsigned lu=GrilleInteger(i+si,j+sj,k+sk);
3332 gp_Pnt P(dx*i + x0, dy*j + y0, dz*k+z0);
3334 Standard_Integer nu1=-1,nu2=-1;
3335 Standard_Integer nv1=0, nv2=0;
3337 for(nu=0;nu1<0 && nu<SU1;nu++) {
3338 for(nv=0;nu1<0 && nv<SV1;nv++) {
3339 if( aIPD.xIP1(nu, nv) ==(Standard_Integer) newind ) {
3341 aIPD.xIP1(nu, nv)=indicepointtraite;
3348 for(nu=0;nu2<0 && nu<SU2;nu++) {
3349 for(nv=0;nu2<0 && nv<SV2;nv++) {
3350 if( aIPD.xIP2(nu, nv)==(Standard_Integer) newind ) {
3352 aIPD.xIP2(nu, nv)=indicepointtraite;
3358 if(nu1>=0 && nu2>=0) {
3359 IntSurf_PntOn2S POn2S;
3361 S1->FirstUParameter()+nu1*du1,
3362 S1->FirstVParameter()+nv1*dv1,
3363 S2->FirstUParameter()+nu2*du2,
3364 S2->FirstVParameter()+nv2*dv2);
3365 LineOn2S->Add(POn2S);
3369 //-- aucun point du triangle n a ete trouve assez proche
3370 //-- on recherche les 3 points les plus proches de P
3371 //-- dans chacun des tableaux
3372 Standard_Real Dist3[3],u3[3] = { 0.0, 0.0, 0.0 },v3[3] = { 0.0, 0.0, 0.0 };
3373 Dist3[0]=Dist3[1]=Dist3[2]=RealLast();
3374 for(U=resu0,i=0; i<SU1; i++,U+=du1) {
3375 for(V=resv0,j=0; j<SV1; V+=dv1,j++) {
3376 //-- On place les 3 meilleures valeurs dans Dist1,Dist2,Dist3
3377 Standard_Real t = aIPD.xP1(i, j).SquareDistance(P);
3378 //-- On remplace la plus grande valeur ds Dist[.] par la val courante
3379 if(Dist3[0]<Dist3[1]) {
3381 z=Dist3[0]; Dist3[0]=Dist3[1]; Dist3[1]=z;
3382 z=u3[0]; u3[0]=u3[1]; u3[1]=z;
3383 z=v3[0]; v3[0]=v3[1]; v3[1]=z;
3385 if(Dist3[1]<Dist3[2]) {
3387 z=Dist3[1]; Dist3[1]=Dist3[2]; Dist3[2]=z;
3388 z=u3[1]; u3[1]=u3[2]; u3[2]=z;
3389 z=v3[1]; v3[1]=v3[2]; v3[2]=z;
3391 if(Dist3[0]<Dist3[1]) {
3393 z=Dist3[0]; Dist3[0]=Dist3[1]; Dist3[1]=z;
3394 z=u3[0]; u3[0]=u3[1]; u3[1]=z;
3395 z=v3[0]; v3[0]=v3[1]; v3[1]=z;
3397 //-- la plus grande valeur est dans Dist3[0]
3399 Dist3[0]=t; u3[0]=U; v3[0]=V;
3404 Standard_Real U1_3 = (u3[0]+u3[1]+u3[2])/3.0;
3405 Standard_Real V1_3 = (v3[0]+v3[1]+v3[2])/3.0;
3407 Dist3[0]=Dist3[1]=Dist3[2]=RealLast();
3408 for(U=U0,i=0; i<SU2; i++,U+=du2) {
3409 for(V=V0,j=0; j<SV2; V+=dv2,j++) {
3410 //-- On place les 3 meilleures valeurs dans Dist1,Dist2,Dist3
3411 Standard_Real t = aIPD.xP2(i, j).SquareDistance(P);
3412 //-- On remplace la plus grande valeur ds Dist3[.] par la val courante
3413 if(Dist3[0]<Dist3[1]) {
3415 z=Dist3[0]; Dist3[0]=Dist3[1]; Dist3[1]=z;
3416 z=u3[0]; u3[0]=u3[1]; u3[1]=z;
3417 z=v3[0]; v3[0]=v3[1]; v3[1]=z;
3419 if(Dist3[1]<Dist3[2]) {
3421 z=Dist3[1]; Dist3[1]=Dist3[2]; Dist3[2]=z;
3422 z=u3[1]; u3[1]=u3[2]; u3[2]=z;
3423 z=v3[1]; v3[1]=v3[2]; v3[2]=z;
3425 if(Dist3[0]<Dist3[1]) {
3427 z=Dist3[0]; Dist3[0]=Dist3[1]; Dist3[1]=z;
3428 z=u3[0]; u3[0]=u3[1]; u3[1]=z;
3429 z=v3[0]; v3[0]=v3[1]; v3[1]=z;
3431 //-- la plus grande valeur est dans Dist3[0]
3433 Dist3[0]=t; u3[0]=U; v3[0]=V;
3438 Standard_Real U2_3 = (u3[0]+u3[1]+u3[2])/3.0;
3439 Standard_Real V2_3 = (v3[0]+v3[1]+v3[2])/3.0;
3441 IntSurf_PntOn2S POn2S;
3442 POn2S.SetValue(P,U1_3,V1_3,U2_3,V2_3);
3443 LineOn2S->Add(POn2S);
3451 //==================================================================================
3452 // function : IsPointOnLine
3454 //==================================================================================
3456 Standard_Boolean IsPointOnLine(const IntSurf_PntOn2S &thePOn2S,
3457 const Handle(IntPatch_WLine) &theWLine,
3458 const Standard_Real Deflection)
3460 Standard_Boolean isOnLine = Standard_False;
3461 Standard_Real Deflection2 = Deflection*Deflection;
3462 Standard_Real pu1, pu2, pv1, pv2;
3464 thePOn2S.Parameters(pu1, pv1, pu2, pv2);
3466 if ((theWLine->IsOutSurf1Box(gp_Pnt2d(pu1, pv1)) == Standard_False) &&
3467 (theWLine->IsOutSurf2Box(gp_Pnt2d(pu2, pv2)) == Standard_False) &&
3468 (theWLine->IsOutBox(thePOn2S.Value()) == Standard_False)) {
3469 const Standard_Integer NbPntOn2SOnLine = theWLine->NbPnts();
3470 Standard_Integer ll;
3472 for (ll=1; ll < NbPntOn2SOnLine && !isOnLine; ll++) {
3473 const gp_Pnt &Pa = theWLine->Point(ll).Value();
3474 const gp_Pnt &Pb = theWLine->Point(ll+1).Value();
3475 const gp_Pnt &PStart = thePOn2S.Value();
3476 const gp_Vec AM(Pa, PStart);
3477 const gp_Vec MB(PStart,Pb);
3478 const Standard_Real AMMB = AM.Dot(MB);
3481 gp_Dir ABN(Pb.X() - Pa.X(), Pb.Y() - Pa.Y(), Pb.Z() - Pa.Z());
3482 Standard_Real lan = ABN.X()*AM.X() + ABN.Y()*AM.Y() + ABN.Z()*AM.Z();
3483 gp_Vec AH(lan*ABN.X(), lan*ABN.Y(), lan*ABN.Z());
3484 gp_Vec HM(AM.X() - AH.X(), AM.Y() - AH.Y(), AM.Z() - AH.Z());
3485 Standard_Real d = 0.0;
3487 if(HM.X() < Deflection) {
3490 if(HM.Y() < Deflection) {
3493 if(HM.Z() < Deflection) {
3505 if(d < Deflection2) {
3506 isOnLine = Standard_True;
3509 Standard_Real dab = Pa.SquareDistance(Pb);
3510 Standard_Real dap = Pa.SquareDistance(PStart);
3513 isOnLine = Standard_True;
3515 Standard_Real dbp = Pb.SquareDistance(PStart);
3518 isOnLine = Standard_True;
3528 //==================================================================================
3529 // function : AddWLine
3531 //==================================================================================
3533 void AddWLine(IntPatch_SequenceOfLine &theLines,
3534 const Handle(IntPatch_WLine) &theWLine,
3535 const Standard_Real Deflection)
3537 Standard_Integer i = 1;
3538 Standard_Integer aNbLines = theLines.Length();
3539 Standard_Boolean isToRemove;
3541 // Check each line of theLines if it is on theWLine.
3542 while (i <= aNbLines) {
3543 Handle(IntPatch_WLine) aWLine =
3544 Handle(IntPatch_WLine)::DownCast(theLines.Value(i));
3546 isToRemove = Standard_False;
3548 if (aWLine.IsNull() == Standard_False) {
3549 // Check the middle point.
3550 Standard_Integer aMidIndex = (aWLine->NbPnts() + 1)/2;
3552 if (aMidIndex > 0) {
3553 const IntSurf_PntOn2S &aPnt = aWLine->Point(aMidIndex);
3555 if (IsPointOnLine(aPnt, theWLine, Deflection)) {
3556 // Middle point is on theWLine. Check vertices.
3557 isToRemove = Standard_True;
3560 const Standard_Integer aNbVtx = aWLine->NbVertex();
3562 for (j = 1; j <= aNbVtx; j++) {
3563 const IntPatch_Point &aPoint = aWLine->Vertex(j);
3565 if (!IsPointOnLine(aPoint.PntOn2S(), theWLine, Deflection)) {
3566 isToRemove = Standard_False;
3582 // Add theWLine to the sequence of lines.
3583 theLines.Append(theWLine);