-
Notifications
You must be signed in to change notification settings - Fork 384
/
Copy pathShapeAnalysis_Curve.cxx
1359 lines (1250 loc) · 45.9 KB
/
ShapeAnalysis_Curve.cxx
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
// pdn 04.12.98 Add method using Adaptor_Curve
//: j8 abv 10.12.98 TR10 r0501_db.stp #9423
// pdn 25.12.98 private method ProjectAct
// szv#4 S4163
//: s5 abv 22.04.99 Adding debug printouts in catch {} blocks
// abv 14.05.99 S4174: Adding method for exact computing of the boundary box
// gka 21.06.99 S4208: adding method NextProject(Adaptor_Curve)
// msv 30.05.00 correct IsPlanar for a conic curve
#include <Adaptor3d_Curve.hxx>
#include <Bnd_Box2d.hxx>
#include <ElCLib.hxx>
#include <Extrema_ExtPC.hxx>
#include <Extrema_LocateExtPC.hxx>
#include <Geom2d_BezierCurve.hxx>
#include <Geom2d_BoundedCurve.hxx>
#include <Geom2d_BSplineCurve.hxx>
#include <Geom2d_Conic.hxx>
#include <Geom2d_Curve.hxx>
#include <Geom2d_Line.hxx>
#include <Geom2d_OffsetCurve.hxx>
#include <Geom2d_TrimmedCurve.hxx>
#include <Geom2dAdaptor_Curve.hxx>
#include <Geom2dInt_Geom2dCurveTool.hxx>
#include <Geom_BezierCurve.hxx>
#include <Geom_BoundedCurve.hxx>
#include <Geom_BSplineCurve.hxx>
#include <Geom_Circle.hxx>
#include <Geom_Conic.hxx>
#include <Geom_Curve.hxx>
#include <Geom_Line.hxx>
#include <Geom_OffsetCurve.hxx>
#include <Geom_TrimmedCurve.hxx>
#include <GeomAdaptor_Curve.hxx>
#include <gp_Pnt.hxx>
#include <gp_XYZ.hxx>
#include <Precision.hxx>
#include <ShapeAnalysis.hxx>
#include <ShapeAnalysis_Curve.hxx>
#include <ShapeExtend_ComplexCurve.hxx>
#include <Standard_ErrorHandler.hxx>
#include <Standard_Failure.hxx>
#include <TColgp_SequenceOfPnt.hxx>
//=================================================================================================
static void ProjectOnSegments(const Adaptor3d_Curve& AC,
const gp_Pnt& P3D,
const Standard_Integer nbseg,
Standard_Real& uMin,
Standard_Real& uMax,
Standard_Real& distmin,
gp_Pnt& proj,
Standard_Real& param)
{
// On considere <nbseg> points sur [uMin,uMax]
// Quel est le plus proche. Et quel est le nouvel intervalle
// (il ne peut pas deborder l ancien)
Standard_Real u, dist2,
delta = (nbseg == 0) ? 0 : (uMax - uMin) / nbseg; // szv#4:S4163:12Mar99 anti-exception
Standard_Real distmin2 = distmin * distmin;
Standard_Boolean aHasChanged = Standard_False;
for (Standard_Integer i = 0; i <= nbseg; i++)
{
u = uMin + (delta * i);
gp_Pnt PU = AC.Value(u);
dist2 = PU.SquareDistance(P3D);
if (dist2 < distmin2)
{
distmin2 = dist2;
proj = PU;
param = u;
aHasChanged = Standard_True;
}
}
if (aHasChanged)
distmin = Sqrt(distmin2);
#ifdef OCCT_DEBUG
std::cout << "ShapeAnalysis_Geom:Project, param=" << param << " -> distmin=" << distmin
<< std::endl;
#endif
uMax = Min(uMax, param + delta);
uMin = Max(uMin, param - delta);
}
//=================================================================================================
Standard_Real ShapeAnalysis_Curve::Project(const Handle(Geom_Curve)& C3D,
const gp_Pnt& P3D,
const Standard_Real preci,
gp_Pnt& proj,
Standard_Real& param,
const Standard_Boolean AdjustToEnds) const
{
Standard_Real uMin = C3D->FirstParameter();
Standard_Real uMax = C3D->LastParameter();
if (uMin < uMax)
return Project(C3D, P3D, preci, proj, param, uMin, uMax, AdjustToEnds);
else
return Project(C3D, P3D, preci, proj, param, uMax, uMin, AdjustToEnds);
}
//=================================================================================================
Standard_Real ShapeAnalysis_Curve::Project(const Handle(Geom_Curve)& C3D,
const gp_Pnt& P3D,
const Standard_Real preci,
gp_Pnt& proj,
Standard_Real& param,
const Standard_Real cf,
const Standard_Real cl,
const Standard_Boolean AdjustToEnds) const
{
Standard_Real distmin;
Standard_Real uMin = (cf < cl ? cf : cl);
Standard_Real uMax = (cf < cl ? cl : cf);
GeomAdaptor_Curve GAC(C3D, uMin, uMax);
if (C3D->IsKind(STANDARD_TYPE(Geom_BoundedCurve)))
{
// clang-format off
Standard_Real prec = ( AdjustToEnds ? preci : Precision::Confusion() ); //:j8 abv 10 Dec 98: tr10_r0501_db.stp #9423: protection against densing of points near one end
// clang-format on
gp_Pnt LowBound = GAC.Value(uMin);
gp_Pnt HigBound = GAC.Value(uMax);
distmin = LowBound.Distance(P3D);
if (distmin <= prec)
{
param = uMin;
proj = LowBound;
return distmin;
}
distmin = HigBound.Distance(P3D);
if (distmin <= prec)
{
param = uMax;
proj = HigBound;
return distmin;
}
}
if (!C3D->IsClosed())
{
// modified by rln on 16/12/97 after CSR# PRO11641 entity 20767
// the VIso was not closed (according to C3D->IsClosed()) while it "almost"
// was (the distance between ends of the curve was a little bit more than
// Precision::Confusion())
// in that case value 0.1 was too much and this method returned not correct parameter
// uMin = uMin - 0.1;
// uMax = uMax + 0.1;
// modified by pdn on 01.07.98 after BUC60195 entity 1952 (Min() added)
Standard_Real delta = Min(GAC.Resolution(preci), (uMax - uMin) * 0.1);
uMin -= delta;
uMax += delta;
GAC.Load(C3D, uMin, uMax);
}
return ProjectAct(GAC, P3D, preci, proj, param);
}
//=================================================================================================
Standard_Real ShapeAnalysis_Curve::Project(const Adaptor3d_Curve& C3D,
const gp_Pnt& P3D,
const Standard_Real preci,
gp_Pnt& proj,
Standard_Real& param,
const Standard_Boolean AdjustToEnds) const
{
Standard_Real uMin = C3D.FirstParameter();
Standard_Real uMax = C3D.LastParameter();
if (Precision::IsInfinite(uMin) && Precision::IsInfinite(uMax))
return ProjectAct(C3D, P3D, preci, proj, param);
Standard_Real distmin_L = Precision::Infinite(), distmin_H = Precision::Infinite();
// clang-format off
Standard_Real prec = ( AdjustToEnds ? preci : Precision::Confusion() ); //:j8 abv 10 Dec 98: tr10_r0501_db.stp #9423: protection against densing of points near one end
// clang-format on
gp_Pnt LowBound = C3D.Value(uMin);
gp_Pnt HigBound = C3D.Value(uMax);
distmin_L = LowBound.Distance(P3D);
distmin_H = HigBound.Distance(P3D);
if (distmin_L <= prec)
{
param = uMin;
proj = LowBound;
return distmin_L;
}
if (distmin_H <= prec)
{
param = uMax;
proj = HigBound;
return distmin_H;
}
Standard_Real distProj = ProjectAct(C3D, P3D, preci, proj, param);
if (distProj < distmin_L + Precision::Confusion()
&& distProj < distmin_H + Precision::Confusion())
return distProj;
if (distmin_L < distmin_H)
{
param = uMin;
proj = LowBound;
return distmin_L;
}
param = uMax;
proj = HigBound;
return distmin_H;
}
//=================================================================================================
Standard_Real ShapeAnalysis_Curve::ProjectAct(const Adaptor3d_Curve& C3D,
const gp_Pnt& P3D,
const Standard_Real preci,
gp_Pnt& proj,
Standard_Real& param) const
{
Standard_Boolean OK = Standard_False;
param = 0.;
try
{
OCC_CATCH_SIGNALS
Extrema_ExtPC myExtPC(P3D, C3D);
Standard_Real dist2Min = RealLast(), dist2;
Standard_Integer index = 0;
if (myExtPC.IsDone() && (myExtPC.NbExt() > 0))
{
for (Standard_Integer i = 1; i <= myExtPC.NbExt(); i++)
{
if (!myExtPC.IsMin(i))
continue;
dist2 = myExtPC.SquareDistance(i);
if (dist2 < dist2Min)
{
dist2Min = dist2;
index = i;
}
}
if (index != 0)
{
param = (myExtPC.Point(index)).Parameter();
proj = (myExtPC.Point(index)).Value();
OK = Standard_True;
}
}
}
catch (Standard_Failure const& anException)
{
#ifdef OCCT_DEBUG
//: s5
std::cout << "\nWarning: ShapeAnalysis_Curve::ProjectAct(): Exception in Extrema_ExtPC: ";
anException.Print(std::cout);
std::cout << std::endl;
#endif
(void)anException;
OK = Standard_False;
}
// szv#4:S4163:12Mar99 moved
Standard_Real uMin = C3D.FirstParameter(), uMax = C3D.LastParameter();
Standard_Boolean closed = Standard_False; // si on franchit les bornes ...
Standard_Real distmin = Precision::Infinite(), valclosed = 0.;
Standard_Real aModParam = param;
Standard_Real aModMin = distmin;
// PTV 29.05.2002 remember the old solution, cause it could be better
Standard_Real anOldParam = 0.;
Standard_Boolean IsHaveOldSol = Standard_False;
gp_Pnt anOldProj;
if (OK)
{
IsHaveOldSol = Standard_True;
anOldProj = proj;
anOldParam = param;
distmin = proj.Distance(P3D);
aModMin = distmin;
if (distmin > preci)
OK = Standard_False;
// Cas TrimmedCurve a cheval. Voir la courbe de base.
// Si fermee, passer une periode
if (C3D.IsClosed())
{
closed = Standard_True;
valclosed = uMax - uMin; // szv#4:S4163:12Mar99 optimized
}
}
if (!OK)
{
// BUG NICOLAS - Si le point est sur la courbe 0 Solutions
// Cela fonctionne avec ElCLib
// D une facon generale, on essaie de TOUJOURS retourner un resultat
// MEME PAS BIEN BON. L appelant pourra decider alors quoi faire
param = 0.;
switch (C3D.GetType())
{
case GeomAbs_Circle: {
const gp_Circ& aCirc = C3D.Circle();
proj = aCirc.Position().Location();
if (aCirc.Radius() <= gp::Resolution() || P3D.SquareDistance(proj) <= gp::Resolution())
{
param = C3D.FirstParameter();
proj = proj.XYZ() + aCirc.XAxis().Direction().XYZ() * aCirc.Radius();
}
else
{
param = ElCLib::Parameter(aCirc, P3D);
proj = ElCLib::Value(param, aCirc);
}
closed = Standard_True;
valclosed = 2. * M_PI;
}
break;
case GeomAbs_Hyperbola: {
param = ElCLib::Parameter(C3D.Hyperbola(), P3D);
proj = ElCLib::Value(param, C3D.Hyperbola());
}
break;
case GeomAbs_Parabola: {
param = ElCLib::Parameter(C3D.Parabola(), P3D);
proj = ElCLib::Value(param, C3D.Parabola());
}
break;
case GeomAbs_Line: {
param = ElCLib::Parameter(C3D.Line(), P3D);
proj = ElCLib::Value(param, C3D.Line());
}
break;
case GeomAbs_Ellipse: {
param = ElCLib::Parameter(C3D.Ellipse(), P3D);
proj = ElCLib::Value(param, C3D.Ellipse());
closed = Standard_True;
valclosed = 2. * M_PI;
}
break;
default: {
// on ne va quand meme pas se laisser abattre ... ???
// on tente ceci : 21 points sur la courbe, quel est le plus proche
distmin = Precision::Infinite();
ProjectOnSegments(C3D, P3D, 25, uMin, uMax, distmin, proj, param);
if (distmin <= preci)
return distmin;
Extrema_LocateExtPC aProjector(P3D, C3D, param /*U0*/, uMin, uMax, preci /*TolU*/);
if (aProjector.IsDone())
{
param = aProjector.Point().Parameter();
proj = aProjector.Point().Value();
Standard_Real aDistNewton = P3D.Distance(proj);
if (aDistNewton < aModMin)
return aDistNewton;
}
// std::cout <<"newton failed"<<std::endl;
ProjectOnSegments(C3D, P3D, 40, uMin, uMax, distmin, proj, param);
if (distmin <= preci)
return distmin;
ProjectOnSegments(C3D, P3D, 20, uMin, uMax, distmin, proj, param);
if (distmin <= preci)
return distmin;
ProjectOnSegments(C3D, P3D, 25, uMin, uMax, distmin, proj, param);
if (distmin <= preci)
return distmin;
ProjectOnSegments(C3D, P3D, 40, uMin, uMax, distmin, proj, param);
if (distmin <= preci)
return distmin;
// soyons raisonnable ...
if (distmin > aModMin)
{
distmin = aModMin;
param = aModParam;
}
return distmin;
}
}
}
// p = PPOC.LowerDistanceParameter(); cf try
if (closed && (param < uMin || param > uMax))
param += ShapeAnalysis::AdjustByPeriod(param, 0.5 * (uMin + uMax), valclosed);
if (IsHaveOldSol)
{
// PTV 29.05.2002 Compare old solution and new;
Standard_Real adist1, adist2;
adist1 = anOldProj.SquareDistance(P3D);
adist2 = proj.SquareDistance(P3D);
if (adist1 < adist2)
{
proj = anOldProj;
param = anOldParam;
}
}
return proj.Distance(P3D);
}
//=======================================================================
// function : NextProject
// purpose : Newton algo for projecting point on curve (S4030)
//=======================================================================
Standard_Real ShapeAnalysis_Curve::NextProject(const Standard_Real paramPrev,
const Handle(Geom_Curve)& C3D,
const gp_Pnt& P3D,
const Standard_Real preci,
gp_Pnt& proj,
Standard_Real& param,
const Standard_Real cf,
const Standard_Real cl,
const Standard_Boolean AdjustToEnds) const
{
Standard_Real uMin = (cf < cl ? cf : cl);
Standard_Real uMax = (cf < cl ? cl : cf);
Standard_Real distmin = Precision::Infinite();
GeomAdaptor_Curve GAC(C3D, uMin, uMax);
if (C3D->IsKind(STANDARD_TYPE(Geom_BoundedCurve)))
{
// clang-format off
Standard_Real prec = ( AdjustToEnds ? preci : Precision::Confusion() ); //:j8 abv 10 Dec 98: tr10_r0501_db.stp #9423: protection against densing of points near one end
// clang-format on
gp_Pnt LowBound = GAC.Value(uMin);
gp_Pnt HigBound = GAC.Value(uMax);
distmin = LowBound.Distance(P3D);
if (distmin <= prec)
{
param = uMin;
proj = LowBound;
return distmin;
}
distmin = HigBound.Distance(P3D);
if (distmin <= prec)
{
param = uMax;
proj = HigBound;
return distmin;
}
}
if (!C3D->IsClosed())
{
// modified by rln on 16/12/97 after CSR# PRO11641 entity 20767
// the VIso was not closed (according to C3D->IsClosed()) while it "almost"
// was (the distance between ends of the curve was a little bit more than
// Precision::Confusion())
// in that case value 0.1 was too much and this method returned not correct parameter
// uMin = uMin - 0.1;
// uMax = uMax + 0.1;
// modified by pdn on 01.07.98 after BUC60195 entity 1952 (Min() added)
Standard_Real delta = Min(GAC.Resolution(preci), (uMax - uMin) * 0.1);
uMin -= delta;
uMax += delta;
GAC.Load(C3D, uMin, uMax);
}
return NextProject(paramPrev, GAC, P3D, preci, proj, param);
}
//=================================================================================================
Standard_Real ShapeAnalysis_Curve::NextProject(const Standard_Real paramPrev,
const Adaptor3d_Curve& C3D,
const gp_Pnt& P3D,
const Standard_Real preci,
gp_Pnt& proj,
Standard_Real& param) const
{
Standard_Real uMin = C3D.FirstParameter();
Standard_Real uMax = C3D.LastParameter();
Extrema_LocateExtPC aProjector(P3D, C3D, paramPrev /*U0*/, uMin, uMax, preci /*TolU*/);
if (aProjector.IsDone())
{
param = aProjector.Point().Parameter();
proj = aProjector.Point().Value();
return P3D.Distance(proj);
}
return Project(C3D, P3D, preci, proj, param, Standard_False);
}
//=======================================================================
// function : AdjustParameters
// purpose : Copied from StepToTopoDS_GeometricTuul::UpdateParam3d (Aug 2001)
//=======================================================================
Standard_Boolean ShapeAnalysis_Curve::ValidateRange(const Handle(Geom_Curve)& theCurve,
Standard_Real& First,
Standard_Real& Last,
const Standard_Real preci) const
{
// First et/ou Last peuvent etre en dehors des bornes naturelles de la courbe.
// On donnera alors la valeur en bout a First et/ou Last
Standard_Real cf = theCurve->FirstParameter();
Standard_Real cl = theCurve->LastParameter();
// Standard_Real preci = BRepAPI::Precision();
if (theCurve->IsKind(STANDARD_TYPE(Geom_BoundedCurve)) && !theCurve->IsClosed())
{
if (First < cf)
{
#ifdef OCCT_DEBUG
std::cout << "Update Edge First Parameter to Curve First Parameter" << std::endl;
#endif
First = cf;
}
else if (First > cl)
{
#ifdef OCCT_DEBUG
std::cout << "Update Edge First Parameter to Curve Last Parameter" << std::endl;
#endif
First = cl;
}
if (Last < cf)
{
#ifdef OCCT_DEBUG
std::cout << "Update Edge Last Parameter to Curve First Parameter" << std::endl;
#endif
Last = cf;
}
else if (Last > cl)
{
#ifdef OCCT_DEBUG
std::cout << "Update Edge Last Parameter to Curve Last Parameter" << std::endl;
#endif
Last = cl;
}
}
// 15.11.2002 PTV OCC966
if (ShapeAnalysis_Curve::IsPeriodic(theCurve))
{
// clang-format off
ElCLib::AdjustPeriodic(cf,cl,Precision::PConfusion(),First,Last); //:a7 abv 11 Feb 98: preci -> PConfusion()
// clang-format on
}
else if (First < Last)
{
// nothing to fix
}
else if (theCurve->IsClosed())
{
// l'un des points projecte se trouve sur l'origine du parametrage
// de la courbe 3D. L algo a donne cl +- preci au lieu de cf ou vice-versa
// DANGER precision 3d applique a une espace 1d
// Last = cf au lieu de Last = cl
if (Abs(Last - cf) < Precision::PConfusion() /*preci*/)
Last = cl;
// First = cl au lieu de First = cf
else if (Abs(First - cl) < Precision::PConfusion() /*preci*/)
First = cf;
// on se trouve dans un cas ou l origine est traversee
// illegal sur une courbe fermee non periodique
// on inverse quand meme les parametres !!!!!!
else
{
//: S4136 abv 20 Apr 99: r0701_ug.stp #6230: add check in 3d
if (theCurve->Value(First).Distance(theCurve->Value(cf)) < preci)
First = cf;
if (theCurve->Value(Last).Distance(theCurve->Value(cl)) < preci)
Last = cl;
if (First > Last)
{
#ifdef OCCT_DEBUG
std::cout << "Warning : parameter range of edge crossing non periodic curve origin"
<< std::endl;
#endif
Standard_Real tmp = First;
First = Last;
Last = tmp;
}
}
}
// The curve is closed within the 3D tolerance
else if (theCurve->IsKind(STANDARD_TYPE(Geom_BSplineCurve)))
{
Handle(Geom_BSplineCurve) aBSpline = Handle(Geom_BSplineCurve)::DownCast(theCurve);
if (aBSpline->StartPoint().Distance(aBSpline->EndPoint()) <= preci)
{
//: S4136 <= BRepAPI::Precision()) {
// l'un des points projecte se trouve sur l'origine du parametrage
// de la courbe 3D. L algo a donne cl +- preci au lieu de cf ou vice-versa
// DANGER precision 3d applique a une espace 1d
// Last = cf au lieu de Last = cl
if (Abs(Last - cf) < Precision::PConfusion() /*preci*/)
Last = cl;
// First = cl au lieu de First = cf
else if (Abs(First - cl) < Precision::PConfusion() /*preci*/)
First = cf;
// on se trouve dans un cas ou l origine est traversee
// illegal sur une courbe fermee non periodique
// on inverse quand meme les parametres !!!!!!
else
{
#ifdef OCCT_DEBUG
std::cout << "Warning : parameter range of edge crossing non periodic curve origin"
<< std::endl;
#endif
Standard_Real tmp = First;
First = Last;
Last = tmp;
}
}
// abv 15.03.00 #72 bm1_pe_t4 protection of exceptions in draw
else if (First > Last)
{
#ifdef OCCT_DEBUG
std::cout << "Warning: parameter range is bad; curve reversed" << std::endl;
#endif
First = theCurve->ReversedParameter(First);
Last = theCurve->ReversedParameter(Last);
theCurve->Reverse();
}
//: j9 abv 11 Dec 98: PRO7747 #4875, after :j8: else
if (First == Last)
{ // gka 10.07.1998 file PRO7656 entity 33334
First = cf;
Last = cl;
return Standard_False;
}
}
else
{
#ifdef OCCT_DEBUG
std::cout << "UpdateParam3d Failed" << std::endl;
std::cout << " - Curve Type : " << theCurve->DynamicType() << std::endl;
std::cout << " - Param 1 : " << First << std::endl;
std::cout << " - Param 2 : " << Last << std::endl;
#endif
// abv 15.03.00 #72 bm1_pe_t4 protection of exceptions in draw
if (First > Last)
{
#ifdef OCCT_DEBUG
std::cout << "Warning: parameter range is bad; curve reversed" << std::endl;
#endif
First = theCurve->ReversedParameter(First);
Last = theCurve->ReversedParameter(Last);
theCurve->Reverse();
}
// pdn 11.01.99 #144 bm1_pe_t4 protection of exceptions in draw
if (First == Last)
{
First -= Precision::PConfusion();
Last += Precision::PConfusion();
}
return Standard_False;
}
return Standard_True;
}
//=======================================================================
// function : FillBndBox
// purpose : WORK-AROUND for methods brom BndLib which give not exact bounds
//=======================================================================
// search for extremum using Newton
static Standard_Integer SearchForExtremum(const Handle(Geom2d_Curve)& C2d,
const Standard_Real First,
const Standard_Real Last,
const gp_Vec2d& dir,
Standard_Real& par,
gp_Pnt2d& res)
{
Standard_Real prevpar;
Standard_Integer nbOut = 0;
for (Standard_Integer i = 0; i < 10; i++)
{
prevpar = par;
gp_Vec2d D1, D2;
C2d->D2(par, res, D1, D2);
Standard_Real Det = (D2 * dir);
if (Abs(Det) < 1e-10)
return Standard_True;
par -= (D1 * dir) / Det;
if (Abs(par - prevpar) < Precision::PConfusion())
return Standard_True;
if (par < First)
{
if (nbOut++ > 2 || prevpar == First)
return Standard_False;
par = First;
}
if (par > Last)
{
if (nbOut++ > 2 || prevpar == Last)
return Standard_False;
par = Last;
}
}
return Standard_True;
}
void ShapeAnalysis_Curve::FillBndBox(const Handle(Geom2d_Curve)& C2d,
const Standard_Real First,
const Standard_Real Last,
const Standard_Integer NPoints,
const Standard_Boolean Exact,
Bnd_Box2d& Box) const
{
if (!Exact)
{
Standard_Integer nseg = (NPoints < 2 ? 1 : NPoints - 1);
Standard_Real step = (Last - First) / nseg;
for (Standard_Integer i = 0; i <= nseg; i++)
{
Standard_Real par = First + i * step;
gp_Pnt2d pnt = C2d->Value(par);
Box.Add(pnt);
}
return;
}
// We should solve the task on intervals of C2 continuity.
Geom2dAdaptor_Curve anAC(C2d, First, Last);
Standard_Integer nbInt = anAC.NbIntervals(GeomAbs_C2);
// If we have only 1 interval then use input NPoints parameter to get samples.
Standard_Integer nbSamples = (nbInt < 2 ? NPoints - 1 : nbInt);
TColStd_Array1OfReal aParams(1, nbSamples + 1);
if (nbSamples == nbInt)
anAC.Intervals(aParams, GeomAbs_C2);
else
{
Standard_Real step = (Last - First) / nbSamples;
for (Standard_Integer i = 0; i <= nbSamples; i++)
aParams(i + 1) = First + i * step;
}
for (Standard_Integer i = 1; i <= nbSamples + 1; i++)
{
Standard_Real aPar1 = aParams(i);
gp_Pnt2d aPnt = C2d->Value(aPar1);
Box.Add(aPnt);
if (i <= nbSamples)
{
Standard_Real aPar2 = aParams(i + 1);
Standard_Real par = (aPar1 + aPar2) * 0.5;
gp_Pnt2d pextr;
Standard_Real parextr = par;
if (SearchForExtremum(C2d, aPar1, aPar2, gp_Vec2d(1, 0), parextr, pextr))
{
Box.Add(pextr);
}
parextr = par;
if (SearchForExtremum(C2d, aPar1, aPar2, gp_Vec2d(0, 1), parextr, pextr))
{
Box.Add(pextr);
}
}
}
}
//=================================================================================================
Standard_Integer ShapeAnalysis_Curve::SelectForwardSeam(const Handle(Geom2d_Curve)& C1,
const Handle(Geom2d_Curve)& C2) const
{
// SelectForward est destine a devenir un outil distinct
// Il est sans doute optimisable !
Standard_Integer theCurveIndice = 0;
Handle(Geom2d_Line) L1 = Handle(Geom2d_Line)::DownCast(C1);
if (L1.IsNull())
{
// if we have BoundedCurve, create a line from C1
Handle(Geom2d_BoundedCurve) BC1 = Handle(Geom2d_BoundedCurve)::DownCast(C1);
if (BC1.IsNull())
return theCurveIndice;
gp_Pnt2d StartBC1 = BC1->StartPoint();
gp_Pnt2d EndBC1 = BC1->EndPoint();
gp_Vec2d VecBC1(StartBC1, EndBC1);
if (VecBC1.SquareMagnitude() < gp::Resolution())
return theCurveIndice;
L1 = new Geom2d_Line(StartBC1, VecBC1);
}
Handle(Geom2d_Line) L2 = Handle(Geom2d_Line)::DownCast(C2);
if (L2.IsNull())
{
// if we have BoundedCurve, creates a line from C2
Handle(Geom2d_BoundedCurve) BC2 = Handle(Geom2d_BoundedCurve)::DownCast(C2);
if (BC2.IsNull())
return theCurveIndice;
gp_Pnt2d StartBC2 = BC2->StartPoint();
gp_Pnt2d EndBC2 = BC2->EndPoint();
gp_Vec2d VecBC2(StartBC2, EndBC2);
if (VecBC2.SquareMagnitude() < gp::Resolution())
return theCurveIndice;
L2 = new Geom2d_Line(StartBC2, VecBC2);
}
Standard_Boolean UdirPos, UdirNeg, VdirPos, VdirNeg;
UdirPos = UdirNeg = VdirPos = VdirNeg = Standard_False;
gp_Dir2d theDir = L1->Direction();
gp_Pnt2d theLoc1 = L1->Location();
gp_Pnt2d theLoc2 = L2->Location();
if (theDir.X() > 0.)
{
UdirPos = Standard_True; // szv#4:S4163:12Mar99 Udir unused
}
else if (theDir.X() < 0.)
{
UdirNeg = Standard_True; // szv#4:S4163:12Mar99 Udir unused
}
else if (theDir.Y() > 0.)
{
VdirPos = Standard_True; // szv#4:S4163:12Mar99 Vdir unused
}
else if (theDir.Y() < 0.)
{
VdirNeg = Standard_True; // szv#4:S4163:12Mar99 Vdir unused
}
if (VdirPos)
{
// max of Loc1.X() Loc2.X()
if (theLoc1.X() > theLoc2.X())
theCurveIndice = 1;
else
theCurveIndice = 2;
}
else if (VdirNeg)
{
if (theLoc1.X() > theLoc2.X())
theCurveIndice = 2;
else
theCurveIndice = 1;
}
else if (UdirPos)
{
// min of Loc1.X() Loc2.X()
if (theLoc1.Y() < theLoc2.Y())
theCurveIndice = 1;
else
theCurveIndice = 2;
}
else if (UdirNeg)
{
if (theLoc1.Y() < theLoc2.Y())
theCurveIndice = 2;
else
theCurveIndice = 1;
}
return theCurveIndice;
}
//%11 pdn 12.01.98
//=============================================================================
// Static methods for IsPlanar
// IsPlanar
//=============================================================================
static gp_XYZ GetAnyNormal(const gp_XYZ& orig)
{
gp_XYZ Norm;
if (Abs(orig.Z()) < Precision::Confusion())
Norm.SetCoord(0, 0, 1);
else
{
Norm.SetCoord(orig.Z(), 0, -orig.X());
Standard_Real nrm = Norm.Modulus();
if (nrm < Precision::Confusion())
Norm.SetCoord(0, 0, 1);
else
Norm = Norm / nrm;
}
return Norm;
}
//=================================================================================================
static void AppendControlPoles(TColgp_SequenceOfPnt& seq, const Handle(Geom_Curve)& curve)
{
if (curve->IsKind(STANDARD_TYPE(Geom_Line)))
{
seq.Append(curve->Value(0));
seq.Append(curve->Value(1));
}
else if (curve->IsKind(STANDARD_TYPE(Geom_Conic)))
{
seq.Append(curve->Value(0));
seq.Append(curve->Value(M_PI / 2));
seq.Append(curve->Value(M_PI));
}
else if (curve->IsKind(STANDARD_TYPE(Geom_TrimmedCurve)))
{
// DeclareAndCast(Geom_TrimmedCurve, Trimmed, curve);
Handle(Geom_TrimmedCurve) Trimmed = Handle(Geom_TrimmedCurve)::DownCast(curve);
// AppendControlPoles(seq,Trimmed->BasisCurve());
Handle(Geom_Curve) aBaseCrv = Trimmed->BasisCurve();
Standard_Boolean done = Standard_False;
if (aBaseCrv->IsKind(STANDARD_TYPE(Geom_BSplineCurve)))
{
try
{
OCC_CATCH_SIGNALS
Handle(Geom_Geometry) Ctmp = aBaseCrv->Copy();
Handle(Geom_BSplineCurve) bslp = Handle(Geom_BSplineCurve)::DownCast(Ctmp);
bslp->Segment(curve->FirstParameter(), curve->LastParameter());
AppendControlPoles(seq, bslp);
done = Standard_True;
}
catch (Standard_Failure const&)
{
}
}
else if (aBaseCrv->IsKind(STANDARD_TYPE(Geom_BezierCurve)))
{
try
{
OCC_CATCH_SIGNALS
Handle(Geom_Geometry) Ctmp = aBaseCrv->Copy();
Handle(Geom_BezierCurve) bz = Handle(Geom_BezierCurve)::DownCast(Ctmp);
bz->Segment(curve->FirstParameter(), curve->LastParameter());
AppendControlPoles(seq, bz);
done = Standard_True;
}
catch (Standard_Failure const&)
{
}
}
if (!done)
{
seq.Append(curve->Value(curve->FirstParameter()));
seq.Append(curve->Value((curve->FirstParameter() + curve->LastParameter()) / 2.));
seq.Append(curve->Value(curve->LastParameter()));
}
}
else if (curve->IsKind(STANDARD_TYPE(Geom_OffsetCurve)))
{
// DeclareAndCast(Geom_OffsetCurve, OffsetC, curve);
Handle(Geom_OffsetCurve) OffsetC = Handle(Geom_OffsetCurve)::DownCast(curve);
// AppendControlPoles(seq,OffsetC->BasisCurve());
seq.Append(curve->Value(curve->FirstParameter()));
seq.Append(curve->Value((curve->FirstParameter() + curve->LastParameter()) / 2.));
seq.Append(curve->Value(curve->LastParameter()));
}
else if (curve->IsKind(STANDARD_TYPE(Geom_BSplineCurve)))
{
// DeclareAndCast(Geom_BSplineCurve, BSpline, curve);
Handle(Geom_BSplineCurve) BSpline = Handle(Geom_BSplineCurve)::DownCast(curve);
TColgp_Array1OfPnt Poles(1, BSpline->NbPoles());
BSpline->Poles(Poles);
for (Standard_Integer i = 1; i <= BSpline->NbPoles(); i++)
seq.Append(Poles(i));
}
else if (curve->IsKind(STANDARD_TYPE(Geom_BezierCurve)))
{
// DeclareAndCast(Geom_BezierCurve, Bezier, curve);
// Handle(Geom_BezierCurve) Bezier = Handle(Geom_BezierCurve)::DownCast(curve);
Handle(Geom_BezierCurve) Bezier = Handle(Geom_BezierCurve)::DownCast(curve);
TColgp_Array1OfPnt Poles(1, Bezier->NbPoles());
Bezier->Poles(Poles);
for (Standard_Integer i = 1; i <= Bezier->NbPoles(); i++)
seq.Append(Poles(i));
}
}
//%11 pdn 12.01.98
// szv modified
//=======================================================================
// function : IsPlanar
// purpose : Detects if points lie in some plane and returns normal
//=======================================================================
Standard_Boolean ShapeAnalysis_Curve::IsPlanar(const TColgp_Array1OfPnt& pnts,
gp_XYZ& Normal,
const Standard_Real preci)