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
|
-- File: Extrema_GLocateExtPC.cdl
-- Created: Tue Dec 14 16:24:56 1993
-- Author: Christophe MARION
-- <cma@zerox>
---Copyright: Matra Datavision 1993
generic class GLocateExtPC from Extrema(
TheCurve as any;
TheCurveTool as any;
TheExtPElC as any;
ThePoint as any;
TheVector as any;
ThePOnC as any;
TheSequenceOfPOnC as any)
---Purpose: It calculates the distance between a point and a
-- curve with a close point.
-- This distance can be a minimum or a maximum.
uses CurveType from GeomAbs
raises DomainError from Standard,
NotDone from StdFail
class ELPC instantiates GExtPC from Extrema
(TheCurve,
TheCurveTool,
TheExtPElC,
ThePoint,
TheVector,
ThePOnC,
TheSequenceOfPOnC);
class LocEPC instantiates GenLocateExtPC from Extrema
(TheCurve,
TheCurveTool,
ThePOnC,
ThePoint,
TheVector);
is
Create returns GLocateExtPC;
Create (P: ThePoint; C: TheCurve; U0: Real; TolF: Real)
returns GLocateExtPC
---Purpose: Calculates the distance with a close point.
-- The close point is defined by the parameter value
-- U0.
-- The function F(u)=distance(P,C(u)) has an extremum
-- when g(u)=dF/du=0. The algorithm searchs a zero
-- near the close point.
-- TolF is used to decide to stop the iterations.
-- At the nth iteration, the criteria is:
-- abs(Un - Un-1) < TolF.
raises DomainError;
-- if U0 is outside the definition range of the curve.
Create (P: ThePoint; C: TheCurve; U0: Real; Umin, Usup: Real; TolF: Real)
returns GLocateExtPC
---Purpose: Calculates the distance with a close point.
-- The close point is defined by the parameter value
-- U0.
-- The function F(u)=distance(P,C(u)) has an extremum
-- when g(u)=dF/du=0. The algorithm searchs a zero
-- near the close point.
-- Zeros are searched between Umin et Usup.
-- TolF is used to decide to stop the iterations.
-- At the nth iteration, the criteria is:
-- abs(Un - Un-1) < TolF.
raises DomainError;
-- if U0 is outside the definition range of the curve.
Initialize(me: in out; C: TheCurve; Umin, Usup: Real; TolF: Real)
---Purpose: sets the fields of the algorithm.
is static;
Perform(me: in out; P: ThePoint; U0: Real)
---Purpose:
is static;
IsDone (me) returns Boolean
---Purpose: Returns True if the distance is found.
is static;
SquareDistance (me) returns Real
---Purpose: Returns the value of the extremum square distance.
raises NotDone from StdFail
-- if IsDone(me)=False.
is static;
IsMin (me) returns Boolean
---Purpose: Returns True if the extremum distance is a minimum.
raises NotDone from StdFail
-- if IsDone(me)=False.
is static;
Point (me) returns ThePOnC
---Purpose: Returns the point of the extremum distance.
raises NotDone from StdFail
-- if IsDone(me)=False.
is static;
fields
mypp: ThePOnC;
myC: Address from Standard;
mydist2: Real from Standard;
myismin: Boolean from Standard;
myDone : Boolean from Standard;
myumin: Real from Standard;
myusup: Real from Standard;
mytol: Real from Standard;
myLocExtPC: LocEPC from Extrema;
myExtremPC: ELPC from Extrema;
type: CurveType from GeomAbs;
numberext: Integer from Standard;
end GLocateExtPC;
|
