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
|
-- File: UniformDeflection.cdl
-- Created: Mon Mar 23 16:54:23 1992
-- Author: Herve LEGRAND
-- <hl@topsn3>
---Copyright: Matra Datavision 1992
class UniformDeflection from GCPnts
---Purpose: Provides an algorithm to compute a distribution of
-- points on a 'C2' continuous curve. The algorithm
-- respects a criterion of maximum deflection between
-- the curve and the polygon that results from the computed points.
-- Note: This algorithm is relatively time consuming. A
-- GCPnts_QuasiUniformDeflection algorithm is
-- quicker; it can also work with non-'C2' continuous
-- curves, but it generates more points in the distribution.
uses
Pnt from gp,
Curve from Adaptor3d,
Curve2d from Adaptor2d,
SequenceOfPnt from TColgp,
SequenceOfReal from TColStd
raises DomainError from Standard,
ConstructionError from Standard,
OutOfRange from Standard,
NotDone from StdFail
is
Create
---Purpose: Constructs an empty algorithm. To define the problem
-- to be solved, use the function Initialize.
returns UniformDeflection from GCPnts;
Create(C : in out Curve from Adaptor3d; Deflection : Real;
WithControl : Boolean = Standard_True)
--- Purpose : Computes a uniform Deflection distribution of points on
-- the Curve <C>.
-- if <WithControl> is True,the algorithm controls the estimate
-- deflection
returns UniformDeflection from GCPnts
raises ConstructionError;
Create(C : in out Curve2d from Adaptor2d; Deflection : Real;
WithControl : Boolean = Standard_True)
--- Purpose : Computes a uniform Deflection distribution of points on
-- the Curve <C>.
-- if <WithControl> is True,the algorithm controls the estimate
-- deflection
returns UniformDeflection from GCPnts
raises ConstructionError;
Create(C : in out Curve from Adaptor3d; Deflection, U1, U2 : Real;
WithControl : Boolean = Standard_True)
--- Purpose : Computes a Uniform Deflection distribution of points
-- on a part of the Curve <C>.
-- if <WithControl> is True,the algorithm controls the estimate
-- deflection
returns UniformDeflection from GCPnts
raises ConstructionError,
DomainError;
Create(C : in out Curve2d from Adaptor2d; Deflection, U1, U2 : Real;
WithControl : Boolean = Standard_True)
--- Purpose : Computes a Uniform Deflection distribution of points
-- on a part of the Curve <C>.
-- if <WithControl> is True,the algorithm controls the estimate
-- deflection
--This and the above algorithms compute a distribution of points:
-- - on the curve C, or
-- - on the part of curve C limited by the two
-- parameter values U1 and U2,
-- where the maximum distance between C and the
-- polygon that results from the points of the distribution
-- is not greater than Deflection.
-- The first point of the distribution is either the origin of
-- curve C or the point of parameter U1. The last point
-- of the distribution is either the end point of curve C or
-- the point of parameter U2. Intermediate points of the
-- distribution are built using interpolations of segments
-- of the curve limited at the 2nd degree. Primarily, the
-- construction algorithm ensures that the chordal
-- deviation for this interpolation of the curve is less
-- than or equal to Deflection. However, it does not
-- ensure that the chordal deviation for the curve itself is
-- less than or equal to Deflection. To do this a check is
-- necessary, which may generate (second step)
-- additional intermediate points. This check is time
-- consuming and can be avoided by setting
-- WithControl to false. Note that by default
-- WithControl is true and the check is performed.
-- Use the function IsDone to verify that the
-- computation was successful, the function NbPoints
-- to obtain the number of points of the computed
-- distribution, and the function Parameter to read the
-- parameter of each point.
-- Warning
-- - C is necessary, 'C2' continuous. This property is
-- not checked at construction time.
-- - The roles of U1 and U2 are inverted if U1 > U2.
-- Warning
-- C is an adapted curve, i.e. an object which is an interface between:
-- - the services provided by either a 2D curve from
-- the package Geom2d (in the case of an
-- Adaptor2d_Curve2d curve) or a 3D curve from
-- the package Geom (in the case of an
-- Adaptor3d_Curve curve),
-- - and those required on the curve by the computation algorithm.
returns UniformDeflection from GCPnts
raises ConstructionError,
DomainError;
Initialize(me : in out; C : in out Curve from Adaptor3d; Deflection : Real;
WithControl : Boolean = Standard_True)
---Purpose: Initialize the algoritms with <C>, <Deflection>
raises ConstructionError
is static;
Initialize(me : in out; C : in out Curve2d from Adaptor2d; Deflection : Real;
WithControl : Boolean = Standard_True)
---Purpose: Initialize the algoritms with <C>, <Deflection>
raises ConstructionError
is static;
Initialize(me : in out; C : in out Curve from Adaptor3d; Deflection, U1, U2 : Real;
WithControl : Boolean = Standard_True)
---Purpose: Initialize the algoritms with <C>, <Deflection>,
-- <U1>,<U2>
raises ConstructionError,
DomainError
is static;
Initialize(me : in out; C : in out Curve2d from Adaptor2d;
Deflection, U1, U2 : Real;
WithControl : Boolean = Standard_True)
---Purpose: Initialize the algoritms with <C>, <Deflection>,
-- <U1>,<U2>
-- This and the above methods initialize (or reinitialize) this algorithm and
-- compute a distribution of points:
-- - on the curve C, or
-- - on the part of curve C limited by the two
-- parameter values U1 and U2,
-- where the maximum distance between C and the
-- polygon that results from the points of the
-- distribution is not greater than Deflection.
-- The first point of the distribution is either the origin
-- of curve C or the point of parameter U1. The last
-- point of the distribution is either the end point of
-- curve C or the point of parameter U2. Intermediate
-- points of the distribution are built using
-- interpolations of segments of the curve limited at
-- the 2nd degree. The construction ensures, in a first
-- step, that the chordal deviation for this
-- interpolation of the curve is less than or equal to
-- Deflection. However, it does not ensure that the
-- chordal deviation for the curve itself is less than or
-- equal to Deflection. To do this a check is
-- necessary, which may generate (second step)
-- additional intermediate points. This check is time
-- consuming, and can be avoided by setting
-- WithControl to false. Note that by default
-- WithControl is true and check is performed.
-- Use the function IsDone to verify that the
-- computation was successful, the function NbPoints
-- to obtain the number of points of the computed
-- distribution, and the function Parameter to read
-- the parameter of each point.
-- Warning
-- - C is necessary, 'C2' continuous. This property is
-- not checked at construction time.
-- - The roles of U1 and U2 are inverted if U1 > U2.
-- Warning
-- C is an adapted curve, i.e. an object which is an interface between:
-- - the services provided by either a 2D curve from
-- the package Geom2d (in the case of an
-- Adaptor2d_Curve2d curve) or a 3D curve from
-- the package Geom (in the case of an Adaptor3d_Curve curve),
-- - and those required on the curve by the computation algorithm.
raises ConstructionError,
DomainError
is static;
IsDone(me) returns Boolean
---C++: inline
---Purpose: Returns true if the computation was successful.
-- IsDone is a protection against:
-- - non-convergence of the algorithm
-- - querying the results before computation.
is static;
NbPoints(me) returns Integer
---C++: inline
---Purpose: Returns the number of points of the distribution
-- computed by this algorithm.
-- Exceptions
-- StdFail_NotDone if this algorithm has not been
-- initialized, or if the computation was not successful.
is static;
Parameter(me; Index : Integer) returns Real
---C++: inline
--- Purpose : Returns the parameter of the point of index Index in
-- the distribution computed by this algorithm.
-- Warning
-- Index must be greater than or equal to 1, and less
-- than or equal to the number of points of the
-- distribution. However, pay particular attention as this
-- condition is not checked by this function.
-- Exceptions
-- StdFail_NotDone if this algorithm has not been
-- initialized, or if the computation was not successful.
is static;
Value(me; Index : Integer) returns Pnt from gp
--- Purpose : Returns the point of index Index in the distribution
-- computed by this algorithm.
-- Warning
-- Index must be greater than or equal to 1, and less
-- than or equal to the number of points of the
-- distribution. However, pay particular attention as this
-- condition is not checked by this function.
-- Exceptions
-- StdFAil_NotDone if this algorithm has not been
-- initialized, or if the computation was not successful.
is static;
Deflection(me) returns Real
---C++: inline
--- Purpose : Returns the deflection between the curve and the
-- polygon resulting from the points of the distribution
-- computed by this algorithm.
-- This value is the one given to the algorithm at the
-- time of construction (or initialization).
-- Exceptions
-- StdFail_NotDone if this algorithm has not been
-- initialized, or if the computation was not successful.
is static;
fields
myDone : Boolean;
myDeflection : Real;
myParams : SequenceOfReal from TColStd;
myPoints : SequenceOfPnt from TColgp;
end UniformDeflection;
|
