forked from likev/contour.js
-
Notifications
You must be signed in to change notification settings - Fork 0
/
contour_track.h
528 lines (422 loc) · 11.7 KB
/
contour_track.h
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
#pragma once
/*
根据一组网格点追踪等值线
使用方法
1.定义contr::contour_track 类型
2.启动追踪 contr::contour_track::begin_track()
3.获取所有等值线 contr::contour_track::get_all_iso_line();
*/
#include "contr.h"
namespace contr{
//等值点信息
struct iso_point
{
int row; //这里的行列是按行列线(注意是线)来算的
int col; //这里的行列的最大值要比rows cols小1
pointxy<double> xy;
bool is_horizon; //等值点是否在X轴上(水平线上) true--X false--Y
iso_point(int r=0,int c=0,bool h=true,double x=0,double y=0)
:row(r),col(c),is_horizon(h),xy(x,y)
{}
};
//每条边上的信息(有无等值点,有时点在何处(_rate)
struct edge_info
{
bool have_iso_point; //在此边上是否有等值点
double rate;
};
struct iso_line //等值线的信息
{
std::vector<iso_point> line;
double value; //指示当前等值线的值
};
class contour_track
{
public:
typedef std::vector<std::vector<edge_info> > edge_side_type;
typedef std::vector<iso_line> iso_line_array;
private:
int n_level; //等值线数
std::vector<double> contour_level;
bool is_set_default_level; //是否设置成为默认的等值线等级,默认为10等分
std::string pre_filename; //先前的文件名,来决定是否再次读取数据
access_contour acc_contr;
int grid_rows,grid_cols;
double delt_x,delt_y;//x y 坐标间隔值
const double Excursion; //修正值
edge_side_type x_side, y_side;
double cur_follow_value; //当前正在追踪的等值线值
iso_point pre_iso_point, cur_iso_point, next_iso_point;
iso_line now_iso_line; //当前等值线
iso_line_array all_iso_line; //所有等值线
public:
contour_track(std::string filename="")
:Excursion(0.001)
{
n_level = 10;
is_set_default_level = true;
pre_filename = filename;
}
void begin_track()
{
acc_contr.get_grid_data(pre_filename);
grid_rows = acc_contr.gd_info().rows;
grid_cols = acc_contr.gd_info().cols;
x_side.assign(grid_rows,std::vector<edge_info> (grid_cols-1));
y_side.assign(grid_rows-1,std::vector<edge_info> (grid_cols));
if (is_set_default_level)
set_default_level();
else
SetContourLevel(); //用户自定义等值点 目前为空函数
delt_x = (acc_contr.gd_info().xmax-acc_contr.gd_info().xmin)/(grid_cols-1);
delt_y = (acc_contr.gd_info().ymax-acc_contr.gd_info().ymin)/(grid_rows-1);
for (int i = 0; i < n_level; i++)
{
cur_follow_value = contour_level[i];
interpolate_tracing_value(); //扫描并计算纵、横边上等值点的情况
tracing_non_closed_contour(); //追踪开等值线
tracing_closed_contour(); //追踪封闭等值线
}
}
iso_line_array get_all_iso_line()
{
return all_iso_line;
}
private:
void interpolate_xy(std::vector<std::vector<edge_info> > &edge, bool is_horizon)
{
/* 网格点标识如下:
(i+1,j)·--------·(i+1,j+1)
| |
| |
· |
| |
(i,j) ·--------·(i,j+1)
i:表示行号(向上增加)
j:表示列号(向右增加)
标识一个网格交点时,行号在前,列号在右,如:(i,j)
*/
/*
* 其中对水平方向h0--(i, j) h1--(i, j+1) _xSide, _ySide中的_rate为(value-h0)/(h1-h0)
*/
double h0, h1; //计录一条边上的两个值
std::vector<grid_point> gridPoints = acc_contr.gdpts();
//扫描每一条边
for (size_t i = 0; i < edge.size(); i++)
{
for (size_t j = 0; j < edge[i].size(); j++)
{
h0 = gridPoints[i * grid_cols + j].value;
if(is_horizon)
{
//x边的端点
h1 = gridPoints[i * grid_cols + j + 1].value;
}
else
{
h1 = gridPoints[(i + 1) * grid_cols + j].value;
}
if (beql(h0, h1))
{
edge[i][j].rate = -2.0;
edge[i][j].have_iso_point = false;
}
else
{
double flag = (cur_follow_value - h0) * (cur_follow_value - h1);
if (flag > 0) //同时大于或小于两端点
{
edge[i][j].rate = -2.0;
edge[i][j].have_iso_point = false;
}
else if (flag < 0) //在两点之间
{
edge[i][j].rate = (cur_follow_value - h0) / (h1 - h0);
edge[i][j].have_iso_point = true;
}
else //与其中一个相等
{
//修正
if (beql(cur_follow_value, h0))
h0 += Excursion;
else
h1 += Excursion;
edge[i][j].rate = (cur_follow_value - h0) / (h1 - h0);
if (edge[i][j].rate < 0 || edge[i][j].rate > 1)
edge[i][j].have_iso_point = false;
else
edge[i][j].have_iso_point = true;
}
}
}
}
}
//扫描并计算横、纵边上等值点的情况(得到_xSide, _ySide的值)
void interpolate_tracing_value()
{
interpolate_xy(x_side,true);
interpolate_xy(y_side,false);
}
void tracing_non_closed_contour()
{
//追踪左边框
for (int i = 0; i < grid_rows-1; i++)
{
if (y_side[i][0].have_iso_point)
{
pre_iso_point = iso_point(i,-1,false);
cur_iso_point = iso_point(i, 0,false);
tracing_one_non_closed_contour();
}
}
//追踪上边框
for (int j = 0; j < grid_cols-1; j++)
{
if (x_side[grid_rows-1][j].have_iso_point)
{
pre_iso_point = iso_point(grid_rows-1,j,true);
cur_iso_point = iso_point(grid_rows-1,j,true);
tracing_one_non_closed_contour();
}
}
//追踪右边框
for (int i = 0; i < grid_rows-1; i++)
{
if (y_side[i][grid_cols-1].have_iso_point)
{
pre_iso_point = iso_point(i,grid_cols-1,false);
cur_iso_point = iso_point(i,grid_cols-1,false);
tracing_one_non_closed_contour();
}
}
//追踪下边框
for (int j = 0; j < grid_cols-1; j++)
{
if (x_side[0][j].have_iso_point)
{
pre_iso_point = iso_point(-1,j,true);
cur_iso_point = iso_point(0, j,true);
tracing_one_non_closed_contour();
}
}
}
void tracing_one_non_closed_contour()
{
now_iso_line.line.clear();
now_iso_line.value = cur_follow_value;
int row = cur_iso_point.row, col = cur_iso_point.col;
bool is_h = cur_iso_point.is_horizon;
calc_coord(row,col,is_h);
if(is_h)
{
x_side[row][col].have_iso_point = false;
}
else
{
y_side[row][col].have_iso_point = false;
}
bool over = false;
while(!over)
{
trace_next_point();
pre_iso_point = cur_iso_point;
cur_iso_point = next_iso_point;
over = (!cur_iso_point.row && cur_iso_point.is_horizon)
|| (!cur_iso_point.col && !cur_iso_point.is_horizon)
|| (cur_iso_point.row == grid_rows-1)
|| (cur_iso_point.col == grid_cols-1);
}
all_iso_line.push_back(now_iso_line);
}
//判断方向
void determine_direction(iso_point &left,iso_point &right,iso_point &oppsite,iso_point &leftoppsite)
{
//判断从网格哪边进入
if (cur_iso_point.row > pre_iso_point.row) //从下至上
{
left = cur_iso_point;
left.is_horizon = false;
right = left;
right.col += 1;
oppsite = cur_iso_point;
oppsite.row += 1;
leftoppsite = left;
leftoppsite.row += 1;
//TracingFromBottom2Top();
return;
}
else if (cur_iso_point.col > pre_iso_point.col) //从左至右
{
right = cur_iso_point;
right.is_horizon = true;
left = right;
left.row += 1;
oppsite = cur_iso_point;
oppsite.col += 1;
leftoppsite = left;
leftoppsite.col += 1;
//TracingFromLeft2Right();
return;
}
else if (cur_iso_point.is_horizon) //从上至下
{
right = cur_iso_point;
right.row -= 1;
right.is_horizon = false;
left = right;
left.col += 1;
oppsite = cur_iso_point;
oppsite.row -= 1;
leftoppsite = left;
leftoppsite.row -= 1;
//TracingFromTop2Bottom();
return;
}
else //从右至左
{
left = cur_iso_point;
left.col -= 1;
left.is_horizon = true;
right = left;
right.row += 1;
oppsite = cur_iso_point;
oppsite.col -= 1;
leftoppsite = left;
leftoppsite.col -= 1;
//TracingFromRight2Left();
return;
}
}
//追踪下一点
void trace_next_point()
{
iso_point left,right,oppsite,leftoppsite;
determine_direction(left,right,oppsite,leftoppsite);
std::vector<std::vector<edge_info> > edge1 = y_side,edge2 = x_side;
if(left.is_horizon)
{
edge1 = x_side;
edge2 = y_side;
}
edge_info left_edge = edge1[left.row][left.col],
right_edge = edge1[right.row][right.col],
oppsite_edge = edge2[oppsite.row][oppsite.col],leftoppsite_edge;
//需考虑边界情形
if(leftoppsite.row>=0 && leftoppsite.row < grid_rows-1 && leftoppsite.col>=0 && leftoppsite.col < grid_cols-1)
leftoppsite_edge = edge1[leftoppsite.row][leftoppsite.col];
else
leftoppsite_edge.rate = -2.0; //超出边界
if(left_edge.have_iso_point)//进入方向左边的边上是否含有等值点
{
if(oppsite_edge.have_iso_point)
{
if(left_edge.rate < right_edge.rate)
{
deal_next_point(left);
}
else if(left_edge.rate > right_edge.rate)
{
deal_next_point(right);
}
else
{
if(leftoppsite_edge.rate < 0.5)
{
deal_next_point(left);
}
else
{
deal_next_point(right);
}
}
}
else
{
deal_next_point(left);
}
}
else if(oppsite_edge.have_iso_point)
{
deal_next_point(oppsite);
}
else
{
deal_next_point(right);
}
}
void deal_next_point(iso_point point)
{
int row = point.row, col = point.col;
bool is_h = point.is_horizon;
calc_coord(row,col,is_h);
if(is_h)
{
x_side[row][col].have_iso_point = false;
}
else
{
y_side[row][col].have_iso_point = false;
}
next_iso_point = point;
}
void tracing_closed_contour()
{
for(int j=0;j<grid_cols-1;j++)
{
for(int i=0;i<grid_rows-1;i++)
{
if(y_side[i][j].have_iso_point)
{
pre_iso_point = iso_point(i,0,false);
cur_iso_point = iso_point(i,j,false);
tracing_one_closed_contour();
}
}
}
}
void tracing_one_closed_contour()
{
now_iso_line.line.clear();
now_iso_line.value = cur_follow_value;
int start_r = cur_iso_point.row, start_c = cur_iso_point.col;
calc_coord(start_r,start_c,false);
bool over = false;
while(!over)
{
trace_next_point();
pre_iso_point = cur_iso_point;
cur_iso_point = next_iso_point;
over = (cur_iso_point.row==start_r) && (cur_iso_point.col == start_c)
&& (!cur_iso_point.is_horizon);
}
all_iso_line.push_back(now_iso_line);
}
//默认的等值线(10等分)
void set_default_level()
{
contour_level.clear();
grid_info grdf = acc_contr.gd_info();
for (int i = 0; i < n_level; i++)
{
contour_level.push_back((grdf.zmax-grdf.zmin)*i/(n_level-1)+grdf.zmin );
}
}
void SetContourLevel()
{}
//计算坐标并将此点加入当前等值线中
void calc_coord(int row,int col,bool is_h)
{
double x= acc_contr.gd_info().xmin + col*delt_x,
y= acc_contr.gd_info().ymin + row*delt_y;
if(is_h)
{
x += x_side[row][col].rate * delt_x;
}
else
{
y += y_side[row][col].rate * delt_y;
}
now_iso_line.line.push_back(iso_point(row,col,is_h,x,y));
}
};
}