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
|
// File: fill.cxx
// Created: Wed May 21 10:48:27 1997
// Author: Prihodyko Michael
// <kim@maniax>
// Modified by mpo, Tue Jul 8 15:31:23 1997
// Modified 23/02/98 : FMN ; Remplacement PI par Standard_PI
///////////////////////////////////////////////////////////////////////////////////////
///////////////////////////////// EXAMPLE OF USE //////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////////////
/*
mpo_one_line aLine;
// Drawing filled arc
Standard_Integer n = __InitFillArc (X, Y, anXradius, anYradius, aStartAngle, anOpenAngle,
0.0, 0.0, 0.2*(myHeight/myWidth));
for (Standard_Integer i = 1; i <= n; i++) {
__GetLineOfFilledArc (i, aLine);
DrawSegment (aLine.X1, aLine.Y1, aLine.X2, aLine.Y2);
if (aLine.type == 2)
DrawSegment (aLine.X3, aLine.Y3, aLine.X4, aLine.Y4);
}
__DoneFillArc ();
*/
//--------------------------------------------------------
#include <math.h>
#include <stdlib.h>
#include <Standard_Stream.hxx>
#include <PlotMgt_fill.hxx>
#define Standard_PI (3.14159)
#define maxDouble ((double)1.E+30)
//--------------------------------------------------------
/*
// Description:
// fill sectorof arc with rotated lines and
// arc can be rotated too...
// Some about algorithm:
// rotate everything so, that lines become horizontal and then
// seek points of intersection between each line and sector and
// then rotate it in other way
// Some about using it:
// Call __InitFillArc() to initialize computations
// Using __GetLineOfFilledArc() you can get each line of filling
// Call of __DoneFillArc() will free all allocated memory and will end your computations
// Initialize sector filling
// X, Y -- coordinates of ellipse
// a, b -- radiuses of ellipse
// alpha -- start angle of fill, beta -- add angle of filling
// gamma -- rotation angle of filling (non-dependent of delta)
// delta -- rotation angle of ellipse
// step -- filling step
int __InitFillArc(double X, double Y, double a, double b, double alpha,
double beta, double gamma, double delta, double step);
// Get another line of fill
// n -- number of line
// data -- structure for retrieving coordinates of points
// data->n -- number of lines = {0, 1, 2}
// if data->n = 1 line is (data->X1, data->Y1, data->X2, data->Y2)
// if data->n = 2 line is (data->X1, data->Y1, data->X2, data->Y2) and
// (data->X3, data->Y3, data->X4, data->Y4)
int __GetLineOfFilledArc(int n, mpo_one_line &data);
// Finish all job
void __DoneFillArc(void);
*/
//----------------------------- Implementation -----------------------
int mpo_count;
int mpo_start;
mpo_one_line *mpo_lines;
//Truncate double number
double ftrunc(double a)
{
a = floor(a);
if (a<0) a++;
return a;
}
// Determine is angle a is between b and b+c (c>0)
int mpo_inside(double a, double b, double c)
{
while (b<0) {b += 2*Standard_PI;}; b -= 2*Standard_PI*ftrunc(b/(2*Standard_PI));
c -= 2*Standard_PI*ftrunc(c/(2*Standard_PI));
while (a<0) {a+=2*Standard_PI;}; a -= 2*Standard_PI*ftrunc(a/(2*Standard_PI));
// while(c<0) {c+=2*Standard_PI;}; c-=2*Standard_PI*ftrunc(c/(2*Standard_PI));
if ((a > b) && (a < b+c)) return 1;
else if ((2*Standard_PI+a > b) && (2*Standard_PI+a < b+c)) return 1;
return 0;
}
int __InitFillArc(double X, double Y, double a, double b, double alpha,
double beta, double gamma, double delta, double step)
{
int i ;
alpha -= 2*Standard_PI*ftrunc(alpha/(2*Standard_PI)); beta -= 2*Standard_PI*ftrunc(beta/(2*Standard_PI));
if (beta < 0.0)
{
alpha += beta; beta = -beta;
}
delta -= gamma; alpha -= gamma;
double C1 = b*b*cos(delta)*cos(delta) + a*a*sin(delta)*sin(delta);
double C3 = b*b*sin(delta)*sin(delta) + a*a*cos(delta)*cos(delta);
double C2 = sin(delta)*cos(delta)*(b*b - a*a);
// cout << "C1 = " << C1 << "; C2 = " << C2 << "; C3 = " << C3 << endl << flush;
double Ys = a*b/sqrt(C3 - C2*C2/C1)-0.5*step;
int size = int( ftrunc(2*Ys/step) + 1 );
// cout << "Ysize = " << Ys << endl << flush;
// cout << "Size = " << size << endl << flush;
// cout << "Alpha = " << alpha*180/Standard_PI << endl << flush;
// cout << "Beta = " << beta*180/Standard_PI << endl << flush;
mpo_lines = (mpo_one_line*)malloc(sizeof(mpo_one_line)*size);
for ( i = 0; i < size; i++)
{
double Yt = Ys - i*step;
(mpo_lines+i)->X1 = (-C2*Yt - sqrt(C2*C2*Yt*Yt - C1*(C3*Yt*Yt - a*a*b*b)))/C1;
(mpo_lines+i)->X2 = (-C2*Yt + sqrt(C2*C2*Yt*Yt - C1*(C3*Yt*Yt - a*a*b*b)))/C1;
// cout << "alpha = " << alpha*180/Standard_PI << " alpha+beta = " << (alpha+beta)*180/Standard_PI << endl << flush;
// cout << "" << atan2(Yt, (mpo_lines+i)->X2)*180/Standard_PI << " type " << (mpo_lines+i)->type << endl << flush;;
// cout << "Xleft = " << (mpo_lines+i)->X1 << " Xright = " << (mpo_lines+i)->X2 << endl << flush;
// cout << "C2*C2 - C1*(C3*Yt*Yt - a*a*b*b) = " << C2*C2 - C1*(C3*Yt*Yt - a*a*b*b) << endl << flush;
// cout << "C1*(C3*Yt*Yt - a*a*b*b) = " << C1*(C3*Yt*Yt - a*a*b*b) << endl << flush;
// cout << "C2*C2 = " << C2*C2 << endl << flush;
if (Yt > 0.0)
{
if (sin(alpha) <= 0.0) (mpo_lines+i)->X3 = maxDouble;
else (mpo_lines+i)->X3 = Yt/tan(alpha);
if (sin(alpha+beta) <= 0.0) (mpo_lines+i)->X4 = maxDouble;
else (mpo_lines+i)->X4 = Yt/tan(alpha+beta);
if (((mpo_lines+i)->X3 > (mpo_lines+i)->X2) || ((mpo_lines+i)->X3 < (mpo_lines+i)->X1))
(mpo_lines+i)->X3 = maxDouble;
if (((mpo_lines+i)->X4 > (mpo_lines+i)->X2) || ((mpo_lines+i)->X4 < (mpo_lines+i)->X1))
(mpo_lines+i)->X4 = maxDouble;
if (((mpo_lines+i)->X3 != maxDouble)&&((mpo_lines+i)->X4 != maxDouble))
if ((mpo_lines+i)->X3 <= (mpo_lines+i)->X4) (mpo_lines+i)->type = 0;
else
{
(mpo_lines+i)->type = 1;
double tmp = (mpo_lines+i)->X3; (mpo_lines+i)->X3 = (mpo_lines+i)->X4; (mpo_lines+i)->X4 = tmp;
}
else if ((mpo_lines+i)->X3 != maxDouble)
{
(mpo_lines+i)->type = 2; (mpo_lines+i)->X4 = (mpo_lines+i)->X3;
}
else if ((mpo_lines+i)->X4 != maxDouble)
{
(mpo_lines+i)->type = 3; (mpo_lines+i)->X3 = (mpo_lines+i)->X4;
}
else if (mpo_inside(atan2((double)Yt,(double)((mpo_lines+i)->X2)), alpha, beta))
(mpo_lines+i)->type = 5;
else (mpo_lines+i)->type = 4;
}
else if (Yt <= 0.0) //!!!!!
{
if (sin(alpha) >= 0.0) (mpo_lines+i)->X3 = maxDouble;
else (mpo_lines+i)->X3 = Yt/tan(alpha);
if (sin(alpha+beta) >= 0.0) (mpo_lines+i)->X4 = maxDouble;
else (mpo_lines+i)->X4 = Yt/tan(alpha+beta);
if (((mpo_lines+i)->X3 > (mpo_lines+i)->X2) || ((mpo_lines+i)->X3 < (mpo_lines+i)->X1))
(mpo_lines+i)->X3 = maxDouble;
if (((mpo_lines+i)->X4 > (mpo_lines+i)->X2) || ((mpo_lines+i)->X4 < (mpo_lines+i)->X1))
(mpo_lines+i)->X4 = maxDouble;
if (((mpo_lines+i)->X3 != maxDouble)&&((mpo_lines+i)->X4 != maxDouble))
if ((mpo_lines+i)->X3 >= (mpo_lines+i)->X4)
{
(mpo_lines+i)->type = 0;
double tmp = (mpo_lines+i)->X3; (mpo_lines+i)->X3 = (mpo_lines+i)->X4; (mpo_lines+i)->X4 = tmp;
}
else (mpo_lines+i)->type = 1;
else if ((mpo_lines+i)->X3 != maxDouble) (mpo_lines+i)->type = 3;
else if ((mpo_lines+i)->X4 != maxDouble) (mpo_lines+i)->type = 2;
else if (mpo_inside(atan2((double)Yt, (double)((mpo_lines+i)->X2)), alpha, beta))
(mpo_lines+i)->type = 5;
else (mpo_lines+i)->type = 4;
}
// cout << "Xlm = " << (mpo_lines+i)->X3 << " Xrm = " << (mpo_lines+i)->X4 << endl << flush;
// cout << "------------ i = " << i << endl << flush;
}
mpo_start = 0; mpo_count = 0;
while (((mpo_lines+mpo_start)->type == 4)&&(mpo_start < size)) mpo_start++;
while (((mpo_lines+mpo_start+mpo_count)->type != 4)&&((mpo_start+mpo_count < size))) mpo_count++;
// cout << "start = " << mpo_start << " count = " << mpo_count << endl << flush;
for (i = mpo_start; i < mpo_count+mpo_start; i++)
{
double Yt = Ys - i*step;
(mpo_lines+i)->Y1 = (mpo_lines+i)->X1*sin(gamma) + Yt*cos(gamma) + Y;
(mpo_lines+i)->X1 = (mpo_lines+i)->X1*cos(gamma) - Yt*sin(gamma) + X;
(mpo_lines+i)->Y2 = (mpo_lines+i)->X2*sin(gamma) + Yt*cos(gamma) + Y;
(mpo_lines+i)->X2 = (mpo_lines+i)->X2*cos(gamma) - Yt*sin(gamma) + X;
(mpo_lines+i)->Y3 = (mpo_lines+i)->X3*sin(gamma) + Yt*cos(gamma) + Y;
(mpo_lines+i)->X3 = (mpo_lines+i)->X3*cos(gamma) - Yt*sin(gamma) + X;
(mpo_lines+i)->Y4 = (mpo_lines+i)->X4*sin(gamma) + Yt*cos(gamma) + Y;
(mpo_lines+i)->X4 = (mpo_lines+i)->X4*cos(gamma) - Yt*sin(gamma) + X;
}
return mpo_count;
}
// Get another line of fill
// n -- number of line
// data -- structure for retrieving coordinates of points
// data->n -- number of lines = {0, 1, 2}
// data->n = 1 line is (data->X1, data->Y1, data->X2, data->Y2)
// data->n = 2 line is (data->X1, data->Y1, data->X2, data->Y2) and (data->X3, data->Y3, data->X4, data->Y4)
int __GetLineOfFilledArc(int n, mpo_one_line &data)
{
if (n > mpo_count) return 0; n--; n += mpo_start;
switch((mpo_lines+n)->type) {
case 0:
data.type = 2;
data.X1 = (mpo_lines+n)->X1;
data.Y1 = (mpo_lines+n)->Y1;
data.X2 = (mpo_lines+n)->X3;
data.Y2 = (mpo_lines+n)->Y3;
data.X3 = (mpo_lines+n)->X4;
data.Y3 = (mpo_lines+n)->Y4;
data.X4 = (mpo_lines+n)->X2;
data.Y4 = (mpo_lines+n)->Y2;
break;
case 1:
data.type = 1;
data.X1 = (mpo_lines+n)->X3;
data.Y1 = (mpo_lines+n)->Y3;
data.X2 = (mpo_lines+n)->X4;
data.Y2 = (mpo_lines+n)->Y4;
break;
case 2:
data.type = 1;
data.X1 = (mpo_lines+n)->X1;
data.Y1 = (mpo_lines+n)->Y1;
data.X2 = (mpo_lines+n)->X4;
data.Y2 = (mpo_lines+n)->Y4;
break;
case 3:
data.type = 1;
data.X1 = (mpo_lines+n)->X3;
data.Y1 = (mpo_lines+n)->Y3;
data.X2 = (mpo_lines+n)->X2;
data.Y2 = (mpo_lines+n)->Y2;
break;
case 4:
cout << "??????????????????" << endl << flush; // doesn't exist
break;
case 5:
data.type = 1;
data.X1 = (mpo_lines+n)->X1;
data.Y1 = (mpo_lines+n)->Y1;
data.X2 = (mpo_lines+n)->X2;
data.Y2 = (mpo_lines+n)->Y2;
break;
}
return 1;
}
//Ending job with filler
void __DoneFillArc(void)
{
free(mpo_lines);
}
|
