forked from gustavo-gomes-ghg/My_Matlab
-
Notifications
You must be signed in to change notification settings - Fork 2
/
outstuff.dat
804 lines (804 loc) · 47.9 KB
/
outstuff.dat
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
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
1c1
< function [bound_ingrid,Nb] = compute_boundary(coord,bound)
---
> function [bound_ingrid,Nb] = compute_boundary(coord,bound,icoords)
3,62c3,66
< % -------------------------------------------------------------------------
< %| |
< %| +----------------------------+ |
< %| | GRIDGEN NOAA/NCEP | |
< %| | | |
< %| | Last Update : 23-Oct-2012 | |
< %| +----------------------------+ |
< %| Distributed with WAVEWATCH III |
< %| |
< %| Copyright 2009 National Weather Service (NWS), |
< %| National Oceanic and Atmospheric Administration. All rights reserved.|
< %| |
< %| DESCRIPTION |
< %| Computes the shoreline polygons from the GSHHS database that lie within|
< %| the grid domain, properly accounting for polygons that cross the domain|
< %| The routine has been designed to work with coastal polygons only but |
< %| that can be changed by changing the flag bound(i).flag in the code. See|
< %| GSHHS documentation for the meaning of the different flags |
< %| |
< %| [bound_ingrid,Nb] = compute_boundary(coord,bound) |
< %| |
< %| INPUT |
< %| coord : An array defining the corner points of the grid |
< %| coord(1) = Lattitude (y) of lower left hand corner |
< %| coord(2) = Longitude (x) of lower left hand corner |
< %| coord(3) = Lattitude (y) of upper right hand corner |
< %| coord(4) = Longitude (x) of upper right hand corner |
< %| bound : A data structure array of the basic polygons (The GSHHS |
< %| polygons are stored as mat files with several different |
< %| resolutions and the user should ensure that the files have |
< %| been loaded before using this routine). |
< %| |
< %| The different available files are -- |
< %| coastal_bound_ful.mat -- Full resolution |
< %| (188606 polygons) |
< %| coastal_bound_high.mat -- High resolution |
< %| (0.2 km; 153539 polygons) |
< %| coastal_bound_inter.mat -- Intermediate resolution|
< %| (1 km; 41523 polygons) |
< %| coastal_bound_low.mat -- Low resolution |
< %| (5 km; 10769 polygons) |
< %| coastal_bound_coarse.mat -- Coarse resolution |
< %| (25 km; 1866 polygons) |
< %| |
< %| Alternatively, a separate list of user defined polygons can |
< %| be generated having the same fields as bound. One such list is|
< %| "optional_coastal_polygons.mat" which is also distributed with|
< %| reference data. This is an ever growing list of water bodies |
< %| that see very little wave action and for most practical |
< %| purposes can be masked out as land. |
< %| |
< %| See also optional_bound.m which shows how the optional coastal|
< %| polygons are used |
< %| |
< %| OUTPUT |
< %| bound_ingrid : Subset data structure array of polygons that lie inside|
< %| the grid |
< %| Nb : Total number of polygons found that lie inside the grid|
< %| |
< % -------------------------------------------------------------------------
---
> % -------------------------------------------------------------------------------------
> %| |
> %| +----------------------------+ |
> %| | GRIDGEN NOAA/NCEP | |
> %| | Arun Chawla | |
> %| | Andre van der Westhuysen | |
> %| | | |
> %| | Last Update : 20-Aug-2010 | |
> %| +----------------------------+ |
> %| [email protected] |
> %| [email protected] |
> %| Distributed with WAVEWATCH III |
> %| |
> %| Copyright 2009 National Weather Service (NWS), |
> %| National Oceanic and Atmospheric Administration. All rights reserved. |
> %| |
> %| DESCRIPTION |
> %| Computes the shoreline polygons from the GSHHS database that lie within the |
> %| grid domain, properly accounting for polygons that cross the domain. The routine |
> %| has been designed to work with coastal polygons only but that can be changed by |
> %| changing the flag bound(i).flag in the code. See GSHHS documentation for the |
> %| meaning of the different flags |
> %| |
> %| [bound_ingrid,Nb] = compute_boundary(coord,bound) |
> %| |
> %| INPUT |
> %| coord : An array defining the corner points of the grid |
> %| coord(1) = Lattitude (y) of lower left hand corner |
> %| coord(2) = Longitude (x) of lower left hand corner |
> %| coord(3) = Lattitude (y) of upper right hand corner |
> %| coord(4) = Longitude (x) of upper right hand corner |
> %| bound : A data structure array of the basic polygons (The GSHHS polygons are |
> %| stored as mat files with several different resolutions and the user |
> %| should ensure that the files have been loaded before using this routine). |
> %| |
> %| The different available files are -- |
> %| coastal_bound_ful.mat -- Full resolution (188606 polygons) |
> %| coastal_bound_high.mat -- High resolution (0.2 km; 153539 polygons) |
> %| coastal_bound_inter.mat -- Intermediate resolution |
> %| (1 km; 41523 polygons) |
> %| coastal_bound_low.mat -- Low resolution (5 km; 10769 polygons) |
> %| coastal_bound_coarse.mat -- Coarse resolution (25 km; 1866 polygons) |
> %| |
> %| Loading any of these files would create a data structure array of the |
> %| GSHHS polygons called "bound" and the user can use any of the above |
> %| Alternatively, a separate list of user defined polygons can also be |
> %| generated having the same fields as bound. One such list is |
> %| "optional_coastal_polygons.mat" which is also distributed with the |
> %| reference data. This is an ever growing list of water bodies that see |
> %| very little wave action and for most practical purposes can be masked out |
> %| as land. |
> %| |
> %| See also optional_bound.m which shows how the optional coastal polygons |
> %| are used |
> %| icoords : Coordinate system representation for longitude data |
> %| Options are -- |
> %| 0 --> Longitudes range from -180 to 180 |
> %| 1 --> Longitudes range from 0 to 360 |
> %| |
> %| OUTPUT |
> %| bound_ingrid : Subset data structure array of polygons that lie inside the grid |
> %| Nb : Total number of polygons found that lie inside the grid |
> %| |
> % -------------------------------------------------------------------------------------
71,72c75
< %@@@ Minimum distance between points (to avoid round off errors from points
< %@@@ too close to each other)
---
> %@@@ Minimum distance between points (to avoid round off errors from points too close to each other)
76,83c79
< %@@@ Maximum distance between points. This is being defined so that we do
< %@@@ not have large gaps between subsequent points of the final boundary
< %@@@ polygon
<
< MAX_SEG_LENGTH = 0.25;
<
< %@@@ Polygon defining the bounding grid. Bounding grid is defined in the
< %@@@ counter clockwise direction
---
> %@@@ Polygon defining the bounding grid. Bounding grid is defined in the counter clockwise direction
111a108
> %@@@ Convert base data to specified longitude range
112a110,126
> if (icoords == 0)
> for i = 1:N
> loc = find(bound(i).x > 180);
> bound(i).x(loc) = bound(i).x(loc) - 360;
> bound(i).west = min(bound(i).x);
> bound(i).east = max(bound(i).x);
> clear loc;
> end;
> elseif (icoords == 1)
> for i = 1:N
> loc = find(bound(i).x < 0);
> bound(i).x(loc) = bound(i).x(loc) + 360;
> bound(i).west = min(bound(i).x);
> bound(i).east = max(bound(i).x);
> clear loc;
> end;
> end;
118,120c132,133
< %@@@ Limit boundaries to coastal type only. This flag needs to be
< %@@@ changed if interested in other boundaries. See GSHHS documentation
< %@@@ for boundary type flags
---
> %@@@ Limit boundaries to coastal type only. This flag needs to be changed if
> %@@@ interested in other boundaries. See GSHHS documentation for boundary type flags
132c145
<
---
>
135,136c148,149
< if (bound(i).west >= lon_start && bound(i).east <= lon_end && ...
< bound(i).south >= lat_start && bound(i).north <= lat_end)
---
> if (bound(i).west >= lon_start & bound(i).east <= lon_end & ...
> bound(i).south >= lat_start & bound(i).north <= lat_end)
150,151c163
< %@@@ Determine the points of the boundary that are
< %@@@ inside/on/outside the bounding box
---
> %@@@ Determine the points of the boundary that are inside/on/outside the bounding box
158,159c170
< %@@@ Ignore points that lie on the domain but neighboring
< %@@@ points do not
---
> %@@@ Ignore points that lie on the domain but neighboring points do not
172c183
< if (in_points(p1) == 0 && in_points(p2) == 0)
---
> if (in_points(p1) == 0 & in_points(p2) == 0)
175,197d185
< end;
<
< %@@@ Points of domain in the boundary
<
< domain_inb = inpolygon(px,py,bound(i).x,bound(i).y);
< loc_t = find(domain_inb == 1);
< domain_inb_lth = length(loc_t);
<
< if (isempty(loc1))
< if (domain_inb_lth == length(px))
< bound_ingrid(in_coord).x = px;
< bound_ingrid(in_coord).y = py;
< bound_ingrid(in_coord).n = length(px);
< bound_ingrid(in_coord).west = lon_start;
< bound_ingrid(in_coord).east = lon_end;
< bound_ingrid(in_coord).north = lat_end;
< bound_ingrid(in_coord).south = lat_start;
< bound_ingrid(in_coord).height = lon_end - lon_start;
< bound_ingrid(in_coord).width = lat_end - lat_start;
< bound_ingrid(in_coord).level = 1;
< in_coord = in_coord + 1;
< end;
< clear loc_t domain_inb;
206,207c194,195
< %@@@ Flag the points where the boundary moves from in
< %@@@ to out of the domain as well as out to in
---
> %@@@ Flag the points where the boundary moves from in to out of the domain
> %@@@ as well as out to in
216c204
< if (in_points(j) > 0 && in_points(j+1) == 0)
---
> if (in_points(j) > 0 & in_points(j+1) == 0)
220c208
< if (in_points(j) == 0 && in_points(j+1) > 0)
---
> if (in_points(j) == 0 & in_points(j+1) > 0)
233,234c221
< %@@@ Crossing points are oriented to make sure we start
< %@@@ from out to in
---
> %@@@ Crossing points are oriented to make sure we start from out to in
247,249c234,242
<
< clear in2out_gridbox in2out_gridboxdist in2out_xcross in2out_ycross;
< clear out2in_gridbox out2in_gridboxdist out2in_xcross out2in_ycross;
---
>
> in2out_gridbox = [];
> out2in_gridbox = [];
> in2out_gridboxdist = [];
> out2in_gridboxdist = [];
> in2out_xcross = [];
> out2in_xcross = [];
> in2out_ycross = [];
> out2in_ycross = [];
267c260
< else
---
> else
273,274c266
< in2out_gridboxdist(j) = k-1 + ...
< sqrt((px(k)-x1)^2+(py(k)-y1)^2)/box_length(k);
---
> in2out_gridboxdist(j) = k-1 + sqrt((px(k)-x1)^2+(py(k)-y1)^2)/box_length(k);
283c275
< else
---
> else
330,331c322
< in2out_gridboxdist(j) = k-1 + ...
< sqrt((px(k)-x)^2+(py(k)-y)^2)/box_length(k);
---
> in2out_gridboxdist(j) = k-1 + sqrt((px(k)-x)^2+(py(k)-y)^2)/box_length(k);
335c326
< if (on_points(out2in(j)+1) == 1)
---
> if(on_points(out2in(j)+1) == 1)
348,349c339
< out2in_gridboxdist(j) = k-1 + ...
< sqrt((px(k)-x1)^2+(py(k)-y1)^2)/box_length(k);
---
> out2in_gridboxdist(j) = k-1 + sqrt((px(k)-x1)^2+(py(k)-y1)^2)/box_length(k);
357c347
< else
---
> else
402,403c392
< out2in_gridboxdist(j) = k-1 + ...
< sqrt((px(k)-x)^2+(py(k)-y)^2)/box_length(k);
---
> out2in_gridboxdist(j) = k-1 + sqrt((px(k)-x)^2+(py(k)-y)^2)/box_length(k);
414,445d402
< crnr_acc = 1 - domain_inb;
<
< while(~isempty(find(subseg_acc == 0,1)))
<
< %@@@ Starting from the closest unaccounted
< %@@@ segment
<
< min_pos = 0;
< min_val = 4;
< for j = 1:in2out_count
< if (subseg_acc(j) == 0)
< if (out2in_gridboxdist(j) <= min_val)
< min_val = out2in_gridboxdist(j);
< min_pos = j;
< end;
< end;
< end;
<
< j = min_pos;
<
< bound_ingrid(in_coord).x = [];
< bound_ingrid(in_coord).y = [];
< bound_ingrid(in_coord).n = 0;
< bound_ingrid(in_coord).east = 0;
< bound_ingrid(in_coord).west = 0;
< bound_ingrid(in_coord).north = 0;
< bound_ingrid(in_coord).south = 0;
< bound_ingrid(in_coord).height = 0;
< bound_ingrid(in_coord).width = 0;
<
< bound_x = [];
< bound_y = [];
447,450c404
< if (~isnan(out2in_xcross(j)))
< bound_x = out2in_xcross(j);
< bound_y = out2in_ycross(j);
< end;
---
> %@@@ Keep looping till all intersection points accounted for
452,460c406
< if ((out2in(j)+1) <= in2out(j))
< bound_x = [bound_x;bound(i).x((out2in(j)+1):in2out(j))];
< bound_y = [bound_y;bound(i).y((out2in(j)+1):in2out(j))];
< else
< bound_x = [bound_x;bound(i).x((out2in(j)+1):n);...
< bound(i).x(2:in2out(j))];
< bound_y = [bound_y;bound(i).y((out2in(j)+1):n);...
< bound(i).y(2:in2out(j))];
< end;
---
> while(~isempty(find(subseg_acc == 0)))
462,464c408,416
< if (~isnan(in2out_xcross(j)))
< bound_x = [bound_x;in2out_xcross(j)];
< bound_y = [bound_y;in2out_ycross(j)];
---
> j=1;
> while(subseg_acc(j) == 1)
> j=j+1;
> if (j > in2out_count)
> j=1;
> end;
> if (isempty(find(subseg_acc == 0)))
> break;
> end;
466,477d417
<
< close_bound=0; %@@@ Flag initializing close boundary
<
< starting_edge = out2in_gridbox(j);
< ending_edge = in2out_gridbox(j);
<
< subseg_acc(j) = 1;
<
< %@@@ Find the next closest segment going
< %@@@ anti-clockwise
<
< seg_index = j;
478a419,464
> %@@@ Starting a new boundary from the first unaccounted for intersection
> %@@@ point. Boundary polygon is constructed by starting from the first time
> %@@@ the original polygon intersects the domain coming in and including all
> %@@@ the internal points and the intersection point from where it goes out again.
>
> if (subseg_acc(j) == 0)
>
> bound_ingrid(in_coord).x = [];
> bound_ingrid(in_coord).y = [];
> bound_ingrid(in_coord).n = 0;
> bound_ingrid(in_coord).east = 0;
> bound_ingrid(in_coord).west = 0;
> bound_ingrid(in_coord).north = 0;
> bound_ingrid(in_coord).south = 0;
> bound_ingrid(in_coord).height = 0;
> bound_ingrid(in_coord).width = 0;
>
> if (~isnan(out2in_xcross(j)))
> bound_ingrid(in_coord).x = out2in_xcross(j);
> bound_ingrid(in_coord).y = out2in_ycross(j);
> end;
>
> if ((out2in(j)+1) <= in2out(j))
> bound_ingrid(in_coord).x = [bound_ingrid(in_coord).x;...
> bound(i).x((out2in(j)+1):in2out(j))];
> bound_ingrid(in_coord).y = [bound_ingrid(in_coord).y;...
> bound(i).y((out2in(j)+1):in2out(j))];
> else
> bound_ingrid(in_coord).x = [bound_ingrid(in_coord).x;...
> bound(i).x((out2in(j)+1):n);...
> bound(i).x(2:in2out(j))];
> bound_ingrid(in_coord).y = [bound_ingrid(in_coord).y;...
> bound(i).y((out2in(j)+1):n);...
> bound(i).y(2:in2out(j))];
> end;
>
> if (~isnan(in2out_xcross(j)))
> bound_ingrid(in_coord).x = [bound_ingrid(in_coord).x;in2out_xcross(j)];
> bound_ingrid(in_coord).y = [bound_ingrid(in_coord).y;in2out_ycross(j)];
> end;
>
> new_bound=0; %@@@ Flag initializing a new boundary
>
> subseg_acc(j) = 1;
> seg_start = j;
> seg_index = j;
480,517c466,474
< while (close_bound == 0)
<
< %@@@ Check if last segment and see if can
< %@@@ proceed counter clockwise
<
< if (isempty(find(subseg_acc == 0,1)))
< for k = in2out_gridbox(seg_index):4
< if (domain_inb(k+1) == 1 && crnr_acc(k+1) == 0)
< bound_x = [bound_x;px(k+1)];
< bound_y = [bound_y;py(k+1)];
< crnr_acc(k+1) = 1;
< ending_edge = k;
< else
< close_bound = 1;
< break;
< end;
< end;
<
< if (close_bound == 0)
< for k = 1:(in2out_gridbox(seg_index)-1)
< if (domain_inb(k+1) == 1 && crnr_acc(k+1) == 0)
< bound_x = [bound_x;px(k+1)];
< bound_y = [bound_y;py(k+1)];
< crnr_acc(k+1) = 1;
< ending_edge = k;
< else
< close_bound = 1;
< break;
< end;
< end;
< close_bound = 1;
< end;
<
< else
<
< curr_seg = seg_index;
< kstart = in2out_gridbox(curr_seg);
< start_dist = in2out_gridboxdist(curr_seg);
---
> %@@@ Loop through intersection points till boundary is closed
>
> while (new_bound == 0)
>
> %@@@ Find the next closest point where the original polygon crosses the
> %@@@ domain in again
>
> kstart = in2out_gridbox(seg_index);
> start_dist = in2out_gridboxdist(seg_index);
520,521d476
<
< %@@@ Check all segments
523c478
< for k1 = 1:in2out_count
---
> for k1 = 1:out2in_count
530,531c485,487
<
< if (min_pos == 0)
---
>
> if (min_pos == 0) %@@@ did not find any crossings between in2out
> %@@@ and the end of the box
539,580c495,516
<
< if (subseg_acc(min_pos) == 1)
< close_bound = 1;
< ending_edge = in2out_gridbox(curr_seg);
< else
< kend = out2in_gridbox(min_pos);
< x_mid = [];
< y_mid = [];
<
< %@@@ If the boundary polygon crosses
< %@@@ the grid domain along different
< %@@@ domain edges then include the
< %@@@ common grid domain corner points
<
<
< if (kstart ~= kend)
< if (kstart < kend)
< for k1 = kstart:(kend-1)
< if (domain_inb(k1+1) == 1 ...
< && crnr_acc(k1+1) == 0)
< x_mid = [x_mid;px(k1+1)];
< y_mid = [y_mid;py(k1+1)];
< crnr_acc(k1+1) = 1;
< end;
< end;
< else
< for k1 = kstart:4
< if (domain_inb(k1+1) == 1 ...
< && crnr_acc(k1+1) == 0)
< x_mid = [x_mid;px(k1+1)];
< y_mid = [y_mid;py(k1+1)];
< crnr_acc(k1+1) = 1;
< end;
< end;
< for k1 = 1:(kend-1)
< if (domain_inb(k1+1) == 1 ...
< && crnr_acc(k1+1) == 0)
< x_mid = [x_mid;px(k1+1)];
< y_mid = [y_mid;py(k1+1)];
< crnr_acc(k1+1) = 1;
< end;
< end;
---
>
> kend = out2in_gridbox(min_pos);
> x_mid = [];
> y_mid = [];
>
> %@@@ If the boundary polygon crosses the grid domain along different
> %@@@ domain edges then include the common grid domain corner points
>
> if (kstart ~= kend)
> if (kstart < kend)
> for k1 = kstart:(kend-1)
> x_mid = [x_mid;px(k1+1)];
> y_mid = [y_mid;py(k1+1)];
> end;
> else
> for k1 = kstart:4
> x_mid = [x_mid;px(k1+1)];
> y_mid = [y_mid;py(k1+1)];
> end;
> for k1 = 1:(kend-1)
> x_mid = [x_mid;px(k1+1)];
> y_mid = [y_mid;py(k1+1)];
583,590c519,549
<
< if (~isempty(x_mid))
< bound_x = [bound_x;x_mid];
< bound_y = [bound_y;y_mid];
< end;
<
< %@@@ Adding the segment
<
---
> end;
>
> if (~isempty(x_mid))
> bound_ingrid(in_coord).x = [bound_ingrid(in_coord).x;x_mid];
> bound_ingrid(in_coord).y = [bound_ingrid(in_coord).y;y_mid];
> end;
>
> %@@@ Check if next crossing from out to in matches starting point of
> %@@@ new boundary segment. If yes, then close the boundary
>
> if (min_pos == seg_start) %@@@ need to close the grid
>
> bound_ingrid(in_coord).x(end+1) = bound_ingrid(in_coord).x(1);
> bound_ingrid(in_coord).y(end+1) = bound_ingrid(in_coord).y(1);
> bound_count = length(bound_ingrid(in_coord).x);
> bound_ingrid(in_coord).n = bound_count;
> bound_ingrid(in_coord).east = max(bound_ingrid(in_coord).x);
> bound_ingrid(in_coord).west = min(bound_ingrid(in_coord).x);
> bound_ingrid(in_coord).north = max(bound_ingrid(in_coord).y);
> bound_ingrid(in_coord).south = min(bound_ingrid(in_coord).y);
> bound_ingrid(in_coord).height = bound_ingrid(in_coord).north ...
> - bound_ingrid(in_coord).south;
> bound_ingrid(in_coord).width = bound_ingrid(in_coord).east ...
> - bound_ingrid(in_coord).west;
> bound_ingrid(in_coord).level = 1;
> in_coord=in_coord+1; %@@@ increment boundary counter
> new_bound=1; %@@@ reset flag to exit the boundary loop
> %@@@ and start new boundary
>
> else %@@@ add segment to the boundary
>
592,595c551,554
< bound_x = [bound_x;...
< out2in_xcross(min_pos)];
< bound_y = [bound_y;...
< out2in_ycross(min_pos)];
---
> bound_ingrid(in_coord).x = [bound_ingrid(in_coord).x;...
> out2in_xcross(min_pos)];
> bound_ingrid(in_coord).y = [bound_ingrid(in_coord).y;...
> out2in_ycross(min_pos)];
599,604c558,563
< bound_x = [bound_x;...
< bound(i).x((out2in(min_pos)+1):...
< in2out(min_pos))];
< bound_y = [bound_y;...
< bound(i).y((out2in(min_pos)+1):...
< in2out(min_pos))];
---
> bound_ingrid(in_coord).x = [bound_ingrid(in_coord).x;...
> bound(i).x((out2in(min_pos)+1):...
> in2out(min_pos))];
> bound_ingrid(in_coord).y = [bound_ingrid(in_coord).y;...
> bound(i).y((out2in(min_pos)+1):...
> in2out(min_pos))];
606,611c565,570
< bound_x = [bound_x;...
< bound(i).x((out2in(min_pos)+1):n);...
< bound(i).x(2:in2out(min_pos))];
< bound_y = [bound_y;...
< bound(i).y((out2in(min_pos)+1):n);...
< bound(i).y(2:in2out(min_pos))];
---
> bound_ingrid(in_coord).x = [bound_ingrid(in_coord).x;...
> bound(i).x((out2in(min_pos)+1):n);...
> bound(i).x(2:in2out(min_pos))];
> bound_ingrid(in_coord).y = [bound_ingrid(in_coord).y;...
> bound(i).y((out2in(min_pos)+1):n);...
> bound(i).y(2:in2out(min_pos))];
615,616c574,577
< bound_x = [bound_x;in2out_xcross(min_pos)];
< bound_y = [bound_y;in2out_ycross(min_pos)];
---
> bound_ingrid(in_coord).x = [bound_ingrid(in_coord).x;...
> in2out_xcross(min_pos)];
> bound_ingrid(in_coord).y = [bound_ingrid(in_coord).y;...
> in2out_ycross(min_pos)];
619,741c580,592
< subseg_acc(min_pos) = 1;
< ending_edge = in2out_gridbox(min_pos);
< seg_index = min_pos;
< end;
<
< end;
<
< end;
<
< %@@@ Need to close the grid;
<
< if (ending_edge ~= starting_edge)
< if (ending_edge < starting_edge)
< for k = ending_edge:(starting_edge-1)
< if (crnr_acc(k+1) == 0 && ...
< domain_inb(k+1) == 1)
< bound_x = [bound_x;px(k+1)];
< bound_y = [bound_y;py(k+1)];
< crnr_acc(k+1) = 1;
< end;
< end;
< else
< for k = ending_edge:4
< if (crnr_acc(k+1) == 0 && ...
< domain_inb(k+1) == 1)
< bound_x = [bound_x;px(k+1)];
< bound_y = [bound_y;py(k+1)];
< crnr_acc(k+1) = 1;
< end;
< end;
< for k =1:(starting_edge-1)
< if (crnr_acc(k+1) == 0 && ...
< domain_inb(k+1) == 1)
< bound_x = [bound_x;px(k+1)];
< bound_y = [bound_y;py(k+1)];
< crnr_acc(k+1) = 1;
< end;
< end;
< end;
< end;
<
< bound_x(end+1) = bound_x(1);
< bound_y(end+1) = bound_y(1);
<
< %@@@ Making sure that the added points do not
< %@@@ exceed max. defined seg length
<
< clear xt1 xt2 yt1 yt2 dist loc x_set y_set;
< nsample = length(bound_x);
< xt1 = bound_x(1:end-1);
< yt1 = bound_y(1:end-1);
< xt2 = bound_x(2:end);
< yt2 = bound_y(2:end);
<
< dist = sqrt((xt2-xt1).^2+(yt2-yt1).^2);
< loc = find(dist > 2*MAX_SEG_LENGTH);
<
< if (~isempty(loc))
< x_set = bound_x(1:loc(1));
< y_set = bound_y(1:loc(1));
< nc = length(loc);
< for k = 1:nc
< xp = bound_x(loc(k));
< yp = bound_y(loc(k));
< xn = bound_x(loc(k)+1);
< yn = bound_y(loc(k)+1);
< ns = floor(dist(loc(k))/MAX_SEG_LENGTH)-1;
< if (ns > 0)
< if (xp == xn)
< x_set = [x_set;ones(ns,1)*xp];
< y_set = [y_set;(yp+sign(yn-yp)...
< *(1:ns)'*MAX_SEG_LENGTH)];
< else
< mth = atan2(yn-yp,xn-xp);
< x_set = [x_set;(xp+[1:ns]'...
< *MAX_SEG_LENGTH*cos(mth))];
< y_set = [y_set;(yp+[1:ns]'...
< *MAX_SEG_LENGTH*sin(mth))];
< end;
< end;
< x_set = [x_set;xn];
< y_set = [y_set;yn];
< if k == nc
< if ((loc(k)+1) < nsample)
< x_set = [x_set;bound_x((loc(k)+2:end))];
< y_set = [y_set;bound_y((loc(k)+2:end))];
< end;
< else
< if ((loc(k)+1) < loc(k+1))
< x_set = [x_set;bound_x((loc(k)+2):loc(k+1))];
< y_set = [y_set;bound_y((loc(k)+2):loc(k+1))];
< end;
< end;
< end;
< else
< x_set = bound_x;
< y_set = bound_y;
< end;
<
< %@@@ Setting up the boundary polygon
<
< bound_ingrid(in_coord).x = x_set;
< bound_ingrid(in_coord).y = y_set;
< bound_count = length(bound_ingrid(in_coord).x);
< bound_ingrid(in_coord).n = bound_count;
< bound_ingrid(in_coord).east = max(bound_ingrid(in_coord).x);
< bound_ingrid(in_coord).west = min(bound_ingrid(in_coord).x);
< bound_ingrid(in_coord).north = max(bound_ingrid(in_coord).y);
< bound_ingrid(in_coord).south = min(bound_ingrid(in_coord).y);
< bound_ingrid(in_coord).height = bound_ingrid(in_coord).north ...
< - bound_ingrid(in_coord).south;
< bound_ingrid(in_coord).width = bound_ingrid(in_coord).east ...
< - bound_ingrid(in_coord).west;
< bound_ingrid(in_coord).level = 1;
<
< in_coord=in_coord+1; %@@@ increment boundary
< %@@@ counter
<
< crnr_acc(1) = crnr_acc(end);
<
< end; %@@@ corresponds to while loop that
< %@@@ checks if all sections (subseg_acc)
< %@@@ have been accounted for.
---
> seg_index = min_pos;
> subseg_acc(min_pos) = 1; %@@@ activate flag that segment has been
> %@@@ accounted for
>
> end; %@@@ end corresponding to check if min_pos == seg_start
>
> end; %@@@ end of while loop for new_bound. This loop exits when a
> %@@@ a boundary is closed and a new one has to be started
>
> end; %@@@ corresponds to if subseg_acc(j) == 0
>
> end; %@@@ corresponds to while loop that checks if all sections (subseg_acc)
> %@@@ have been accounted for. Loop exits when all accounted for
743,746c594,596
< end; %@@@ corresponds to if in2out_count > 0
<
< end; %@@@ corresponds to if statement checking
< %@@@ if there are boundary points inside
---
> end; %@@@ corresponds to if in2out_count > 0 (i.e. there are finite domain crossings)
>
> end; %@@@ corresponds to if statement checking if there are boundary points inside
769,772c619,620
< bound_ingrid(in_coord).height = bound_ingrid(in_coord).north ...
< - bound_ingrid(in_coord).south;
< bound_ingrid(in_coord).width = bound_ingrid(in_coord).east ...
< - bound_ingrid(in_coord).west;
---
> bound_ingrid(in_coord).height = bound_ingrid(in_coord).north - bound_ingrid(in_coord).south;
> bound_ingrid(in_coord).width = bound_ingrid(in_coord).east-bound_ingrid(in_coord).west;
776,777c624
< end; %@@@ corresponds to if statement that determines if boundary
< %@@@ lies partially/completely in domain
---
> end; %@@@ corresponds to if statement that determines if boundary lies partially/completely in domain
779,780c626
< end; %@@@ corresponds to if statement that determines if boundary
< %@@@ lies outside the domain
---
> end; %@@@ corresponds to if statement that determines if boundary lies outside the domain
788,790c634,635
< if (mod(itmp,5)==0 && itmp_prev ~= itmp && N > 100)
< fprintf(1,'Completed %d per cent of %d boundaries and found %d internal boundaries \n',...
< itmp,N,in_coord-1);
---
> if (mod(itmp,5)==0 & itmp_prev ~= itmp & N > 100)
> fprintf(1,'Completed %d per cent of %d boundaries and found %d internal boundaries \n',itmp,N,in_coord-1);