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
|
// This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to
// this header file considered to be the "object code" form of the original source.
#ifndef _Extrema_ExtPElC_HeaderFile
#define _Extrema_ExtPElC_HeaderFile
#ifndef _Standard_HeaderFile
#include <Standard.hxx>
#endif
#ifndef _Standard_Macro_HeaderFile
#include <Standard_Macro.hxx>
#endif
#ifndef _Standard_Boolean_HeaderFile
#include <Standard_Boolean.hxx>
#endif
#ifndef _Standard_Integer_HeaderFile
#include <Standard_Integer.hxx>
#endif
#ifndef _Standard_Real_HeaderFile
#include <Standard_Real.hxx>
#endif
#ifndef _Extrema_POnCurv_HeaderFile
#include <Extrema_POnCurv.hxx>
#endif
class StdFail_NotDone;
class Standard_OutOfRange;
class gp_Pnt;
class gp_Lin;
class gp_Circ;
class gp_Elips;
class gp_Hypr;
class gp_Parab;
class Extrema_POnCurv;
//! It calculates all the distances between a point <br>
//! and an elementary curve. <br>
//! These distances can be minimum or maximum. <br>
class Extrema_ExtPElC {
public:
void* operator new(size_t,void* anAddress)
{
return anAddress;
}
void* operator new(size_t size)
{
return Standard::Allocate(size);
}
void operator delete(void *anAddress)
{
if (anAddress) Standard::Free((Standard_Address&)anAddress);
}
Standard_EXPORT Extrema_ExtPElC();
//! Calculates the extremum distance between the <br>
//! point P and the segment [Uinf,Usup] of the line C. <br>
Standard_EXPORT Extrema_ExtPElC(const gp_Pnt& P,const gp_Lin& C,const Standard_Real Tol,const Standard_Real Uinf,const Standard_Real Usup);
Standard_EXPORT void Perform(const gp_Pnt& P,const gp_Lin& C,const Standard_Real Tol,const Standard_Real Uinf,const Standard_Real Usup) ;
//! Calculates the 2 extremum distances between the <br>
//! point P and the segment [Uinf,Usup] of the circle C. <br>
//! Tol is used to determine <br>
//! if P is on the axis of the circle or <br>
//! if an extremum is on an endpoint of the segment. <br>
//! If P is on the axis of the circle, <br>
//! there are infinite solution then IsDone(me)=False. <br>
//! The conditions on the Uinf and Usup are: <br>
//! 0. <= Uinf <= 2.*PI and Usup > Uinf. <br>
//! If Usup > Uinf + 2.*PI, then only the solutions in <br>
//! the range [Uinf,Uinf+2.*PI[ are computed. <br>
Standard_EXPORT Extrema_ExtPElC(const gp_Pnt& P,const gp_Circ& C,const Standard_Real Tol,const Standard_Real Uinf,const Standard_Real Usup);
Standard_EXPORT void Perform(const gp_Pnt& P,const gp_Circ& C,const Standard_Real Tol,const Standard_Real Uinf,const Standard_Real Usup) ;
//! Calculates the 4 extremum distances between the <br>
//! point P and the segment [Uinf,Usup] of the elipse C. <br>
//! Tol is used to determine <br>
//! if the point is on the axis of the elipse and <br>
//! if the major radius is equal to the minor radius or <br>
//! if an extremum is on an endpoint of the segment. <br>
//! If P is on the axis of the elipse, <br>
//! there are infinite solution then IsDone(me)=False. <br>
//! The conditions on the Uinf and Usup are: <br>
//! 0. <= Uinf <= 2.*PI and Usup > Uinf. <br>
//! If Usup > Uinf + 2.*PI, then only the solutions in <br>
//! the range [Uinf,Uinf+2.*PI[ are computed. <br>
Standard_EXPORT Extrema_ExtPElC(const gp_Pnt& P,const gp_Elips& C,const Standard_Real Tol,const Standard_Real Uinf,const Standard_Real Usup);
Standard_EXPORT void Perform(const gp_Pnt& P,const gp_Elips& C,const Standard_Real Tol,const Standard_Real Uinf,const Standard_Real Usup) ;
//! Calculates the extremum distances between the <br>
//! point P and the segment [Uinf,Usup] of the hyperbola <br>
//! C. <br>
//! Tol is used to determine if two solutions u and v <br>
//! are identical; the condition is: <br>
//! dist(C(u),C(v)) < Tol. <br>
Standard_EXPORT Extrema_ExtPElC(const gp_Pnt& P,const gp_Hypr& C,const Standard_Real Tol,const Standard_Real Uinf,const Standard_Real Usup);
Standard_EXPORT void Perform(const gp_Pnt& P,const gp_Hypr& C,const Standard_Real Tol,const Standard_Real Uinf,const Standard_Real Usup) ;
//! Calculates the 4 extremum distances between the <br>
//! point P and the segment [Uinf,Usup] of the parabola <br>
//! C. <br>
//! Tol is used to determine if two solutions u and v <br>
//! are identical; the condition is: <br>
//! dist(C(u),C(v)) < Tol. <br>
Standard_EXPORT Extrema_ExtPElC(const gp_Pnt& P,const gp_Parab& C,const Standard_Real Tol,const Standard_Real Uinf,const Standard_Real Usup);
Standard_EXPORT void Perform(const gp_Pnt& P,const gp_Parab& C,const Standard_Real Tol,const Standard_Real Uinf,const Standard_Real Usup) ;
//! True if the distances are found. <br>
Standard_EXPORT Standard_Boolean IsDone() const;
//! Returns the number of extremum distances. <br>
Standard_EXPORT Standard_Integer NbExt() const;
//! Returns the value of the Nth extremum square distance. <br>
Standard_EXPORT Standard_Real SquareDistance(const Standard_Integer N) const;
//! Returns True if the Nth extremum distance is a <br>
//! minimum. <br>
Standard_EXPORT Standard_Boolean IsMin(const Standard_Integer N) const;
//! Returns the point of the Nth extremum distance. <br>
Standard_EXPORT Extrema_POnCurv Point(const Standard_Integer N) const;
protected:
private:
Standard_Boolean myDone;
Standard_Integer myNbExt;
Standard_Real mySqDist[4];
Standard_Boolean myIsMin[4];
Extrema_POnCurv myPoint[4];
};
// other Inline functions and methods (like "C++: function call" methods)
#endif
|
