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
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
/*! \file src/scanbeam.cpp
\author Klaas Holwerda or Julian Smart
Copyright: 2001-2004 (C) Klaas Holwerda
Licence: see kboollicense.txt
RCS-ID: $Id: scanbeam.cpp,v 1.7 2009/09/14 16:50:12 titato Exp $
*/
// class scanbeam
// this class represents de space between two scanlines
#include "kbool/scanbeam.h"
#include <math.h>
#include <assert.h>
#include "kbool/booleng.h"
#include "kbool/graph.h"
#include "kbool/node.h"
//this here is to initialize the static iterator of scanbeam
//with NOLIST constructor
int recordsorter( kbRecord* , kbRecord* );
int recordsorter_ysp_angle( kbRecord* , kbRecord* );
int recordsorter_ysp_angle_back( kbRecord* rec1, kbRecord* rec2 );
ScanBeam::ScanBeam( Bool_Engine* GC ): DL_List<kbRecord*>()
{
_GC = GC;
_type = NORMAL;
_BI.Attach( this );
}
ScanBeam::~ScanBeam()
{
//first delete all record still in the beam
_BI.Detach();
remove_all( true );
//DeleteRecordPool();
}
void ScanBeam::SetType( kbNode* low, kbNode* high )
{
if ( low->GetX() < high->GetX() )
_type = NORMAL;
else
_type = FLAT;
}
/*
//catch node to link crossings
// must be sorted on ysp
int ScanBeam::FindCloseLinksAndCross(TDLI<kbLink>* _I,kbNode* _lowf)
{
int merges = 0;
kbRecord* record;
TDLI<kbRecord> _BBI=TDLI<kbRecord>(this);
if (_BI.count() > 1)
{
//first search a link towards this node
for(_BI.tohead(); !_BI.hitroot(); _BI++)
{
record=_BI.item();
if( (record->GetLink()->GetBeginNode()==_lowf) ||
(record->GetLink()->GetEndNode() ==_lowf)
)
break;
}
//NOTICE if the node "a_node" is not inside a record
//for instance to connected flat links (flatlinks not in beam)
//then IL will be at end (those will be catched at 90 degrees rotation)
if (_BI.hitroot())
{
return(merges);
}
//from IL search back for close links
_BBI.toiter(&_BI);
_BBI--;
while(!_BBI.hitroot())
{
record=_BBI.item();
if (record->Ysp() != _lowf->GetY())
break;
// the distance to the low node is smaller then the MARGE
if( (record->GetLink()->GetBeginNode()!=_lowf) &&
(record->GetLink()->GetEndNode() !=_lowf)
)
{ // the link is not towards the low node
record->GetLink()->AddCrossing(_lowf);
record->SetNewLink(record->GetLink()->ProcessCrossingsSmart(_I));
merges++;
}
_BBI--;
}
//from IL search forward for close links
_BBI.toiter(&_BI);
_BBI++;
while(!_BBI.hitroot())
{
record=_BBI.item();
if (record->Ysp() != _lowf->GetY())
// if (record->Ysp() < _lowf->GetY()-MARGE)
break;
// the distance to the low node is smaller then the MARGE
if( (record->GetLink()->GetBeginNode()!=_lowf) &&
(record->GetLink()->GetEndNode() !=_lowf)
)
{ // the link is not towards the low node
record->GetLink()->AddCrossing(_lowf);
record->SetNewLink(record->GetLink()->ProcessCrossingsSmart(_I));
merges++;
}
_BBI++;
}
}
return merges;
}
*/
/*
bool ScanBeam::Update(TDLI<kbLink>* _I,kbNode* _lowf)
{
bool found=false;
kbLink* link;
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record=_BI.item();
record->Calc_Ysp(_type,_low);
_BI++;
}
FindCloseLinksAndCross(_I,_lowf);
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record=_BI.item();
//records containing links towards the new low node
//are links to be marked for removal
if ((record->GetLink()->GetEndNode() == _lowf) ||
(record->GetLink()->GetBeginNode() == _lowf)
)
{
//cross here the links that meat eachother now
delete _BI.item();
_BI.remove();
//cross here the links that meat eachother now
_BI--;
if (!_BI.hitroot() && (_BI.count() > 1))
{
kbRecord* prev=_BI.item();
_BI++;
if (!_BI.hitroot())
{
if (!_BI.item()->Equal(prev)) // records NOT parallel
if (_BI.item()->GetLine()->Intersect(prev->GetLine(),MARGE))
{
//they did cross, integrate the crossings in the graph
//this may modify the links already part of the record
//this is why they are returned in set for the record
_BI.item()->SetNewLink(_BI.item()->GetLink()->ProcessCrossingsSmart(_I));
prev->SetNewLink(prev->GetLink()->ProcessCrossingsSmart(_I));
}
}
}
else
_BI++;
}
else
_BI++;
}
//writebeam();
//ONLY links towards the low node are possible to be added
//the bin flag will be set if it fits in the beam
//so for following beams it will not be checked again
while ( bool(link=_lowf->GetBinHighest(false)) )
{
kbRecord* record=new kbRecord(link);
// yp_new will always be the y of low node since all new links are
// from this node
record->SetYsp(_lowf->GetY());
record->Set_Flags(_type);
//need to calculate ysn to be able to sort this record in the right order
//this is only used when the insert node is equal for both records
// ins_smart and cross neighbour directly
// if empty then just insert
if (empty())
insend(record);
else
{
// put new item left of the one that is bigger
_BI.tohead();
while(!_BI.hitroot())
{
if (recordsorter_ysp_angle(record,_BI.item())==1)
break;
_BI++;
}
_BI.insbefore(record);
_BI--;_BI--; //just before the new record inserted
if (!_BI.hitroot())
{
kbRecord* prev=_BI.item();
_BI++; //goto the new record inserted
if (!_BI.item()->Equal(prev)) // records NOT parallel
{
if (_BI.item()->GetLine()->Intersect(prev->GetLine(),MARGE))
{
//this may modify the links already part of the record
//this is why they are returned in set for the record
_BI.item()->SetNewLink(_BI.item()->GetLink()->ProcessCrossingsSmart(_I));
prev->SetNewLink(prev->GetLink()->ProcessCrossingsSmart(_I));
}
}
}
else
_BI++;
kbRecord* prev=_BI.item(); //the new record
_BI++;
if (!_BI.hitroot() && !_BI.item()->Equal(prev)) // records NOT parallel
{
kbRecord* cur=_BI.item();
if (cur->GetLine()->Intersect(prev->GetLine(),MARGE))
{
//this may modify the links already part of the record
//this is why they are returned in set for the record
cur->SetNewLink(cur->GetLink()->ProcessCrossingsSmart(_I));
prev->SetNewLink(prev->GetLink()->ProcessCrossingsSmart(_I));
}
}
}
//remember this to calculate in/out values for each new link its polygon again.
GNI->insend(record->GetLink()->GetGraphNum());
found=true;
record->GetLink()->SetBeenHere();
}
FindCloseLinksAndCross(_I,_lowf);
//writebeam();
return(found);
}
*/
bool ScanBeam::FindNew( SCANTYPE scantype, TDLI<kbLink>* _I, bool& holes )
{
bool foundnew = false;
_low = _I->item()->GetBeginNode();
kbLink* link;
//if (!checksort())
// SortTheBeam();
lastinserted = 0;
//ONLY links towards the low node are possible to be added
//the bin flag will be set if it fits in the beam
//so for following beams it will not be checked again
while ( ( link = _low->GetBinHighest( false ) ) != NULL )
{
if ( ( link->GetEndNode()->GetX() == link->GetBeginNode()->GetX() ) //flatlink in flatbeam
&& ( ( scantype == NODELINK ) || ( scantype == LINKLINK ) || ( scantype == LINKHOLES ) )
)
{
switch( scantype )
{
case NODELINK:
{
//all vertical links in flatbeam are ignored
//normal link in beam
kbRecord * record = new kbRecord( link, _GC );
// yp_new will always be the y of low node since all new links are
// from this node
record->SetYsp( _low->GetY() );
record->Set_Flags();
// put new item left of the one that is lower in the beam
// The last one inserted in this loop, is already left of the current
// iterator position. So the new links are inerted in proper order.
link->SetRecordNode( _BI.insbefore( record ) );
_BI--;
foundnew = Process_PointToLink_Crossings() != 0 || foundnew;
delete record;
_BI.remove();
break;
}
case LINKLINK:
//is the new record a flat link
{
kbLine flatline = kbLine( link, _GC );
foundnew = Process_LinkToLink_Flat( &flatline ) || foundnew;
//flatlinks are not part of the beams, still they are used to find new beams
//they can be processed now if the beginnode does not change, since this is used to
//to find new beams. and its position does not change
//ProcessCrossings does take care of this
flatline.ProcessCrossings( _I );
break;
}
case LINKHOLES : //holes are never to flatlinks
assert( true );
default:
break;
}
}
else
{
//normal link in beam
kbRecord* record = new kbRecord( link, _GC );
// yp_new will always be the y of low node since all new links are
// from this node
record->SetYsp( _low->GetY() );
record->Set_Flags();
// put new item left of the one that is lower in the beam
// The last one inserted in this loop, is already left of the current
// iterator position. So the new links are inserted in proper order.
link->SetRecordNode( _BI.insbefore( record ) );
lastinserted++;
//_GC->Write_Log( "after insert" );
writebeam();
switch( scantype )
{
case NODELINK:
_BI--;
foundnew = Process_PointToLink_Crossings() != 0 || foundnew;
_BI++;
break;
case INOUT:
{
_BI--;
//now we can set the _inc flag
Generate_INOUT( record->GetLink()->GetGraphNum() );
_BI++;
}
break;
case GENLR:
{
//now we can set the a/b group flags based on the above link
_BI--;
_BI--;
kbRecord* above = 0;
if ( !_BI.hitroot() )
above = _BI.item();
_BI++;
//something to do for winding rule
if ( record->Calc_Left_Right( above ) )
{
delete record;
_BI.remove();
lastinserted--;
}
else
_BI++;
}
break;
case LINKHOLES:
_BI--;
holes = ProcessHoles( true, _I ) || holes;
_BI++;
break;
default:
break;
}
}
link->SetBeenHere();
}
writebeam();
return foundnew;
}
bool ScanBeam::RemoveOld( SCANTYPE scantype, TDLI<kbLink>* _I, bool& holes )
{
bool found = false;
bool foundnew = false;
DL_Iter<kbRecord*> _BBI = DL_Iter<kbRecord*>();
_low = _I->item()->GetBeginNode();
switch( scantype )
{
case INOUT:
case GENLR:
case LINKHOLES:
if ( _type == NORMAL )
{
if ( _low->GetBinHighest( true ) ) //is there something to remove
{
if ( scantype == LINKHOLES )
{
// Tophole links can be linked at the begin or end point, depending on
// which is higher in Y.
// A link pointing to the low node, and which is a tophole link,
// and which was not linked in sofar should be linked now.
_BI.tohead();
while ( !_BI.hitroot() )
{
kbRecord * record = _BI.item();
//records containing links towards the new low node
//are links to be removed
if ( ( record->GetLink()->GetEndNode() == _low ) ||
( record->GetLink()->GetBeginNode() == _low )
)
{
holes = ProcessHoles( false, _I ) || holes;
}
_BI++;
}
}
_BI.tohead();
while ( !_BI.hitroot() )
{
kbRecord * record = _BI.item();
//records containing links towards the new low node
//are links to be removed
if ( ( record->GetLink()->GetEndNode() == _low ) ||
( record->GetLink()->GetBeginNode() == _low )
)
{
delete _BI.item();
_BI.remove();
found = true;
}
else
{
//recalculate ysp for the new scanline
record->Calc_Ysp( _low );
_BI++;
}
}
// all records are renewed in Ysp.
// found links to remove, we search the new insert position for new links.
if ( found )
{
_BI.tohead();
while ( !_BI.hitroot() )
{
kbRecord * record = _BI.item();
if ( record->Ysp() < _low->GetY() )
{
break;
}
_BI++;
}
}
}
else
{
// nothing is removed from the beam, still we moved forward with the scanline
// at the new _low, so we need to recalculate the intersections of the links
// with the new scanline.
// Also the the insert position for new links is determined, being the first
// link below _low.
_BBI.Attach( this );
_BBI.toroot();
_BI.tohead();
while ( !_BI.hitroot() )
{
kbRecord * record = _BI.item();
record->Calc_Ysp( _low );
if ( !found && ( record->Ysp() < _low->GetY() ) )
{
found = true;
_BBI.toiter( &_BI );
}
_BI++;
}
_BI.toiter( &_BBI );
_BBI.Detach();
}
}
else // _type == NORMAL
{ //because the previous beam was flat the links to remove are
//below the last insert position
if ( _low->GetBinHighest( true ) ) //is there something to remove
{
if ( scantype == LINKHOLES )
{
_BI.tohead();
while ( !_BI.hitroot() )
{
kbRecord * record = _BI.item();
//records containing links towards the new low node
//are links to be removed
if ( ( record->GetLink()->GetEndNode() == _low ) ||
( record->GetLink()->GetBeginNode() == _low )
)
{
holes = ProcessHoles( false, _I ) || holes;
}
_BI++;
}
}
//on record back bring us to the last inserted record
//or if nothing was inserted the record before the last deleted record
//if there was no record before the last deleted record this means
//we where at the beginning of the beam, so at root
_BI.tohead();
while ( !_BI.hitroot() )
{
kbRecord * record = _BI.item();
//records containing links towards the new low node
//are links to be removed
if ( ( record->GetLink()->GetEndNode() == _low ) ||
( record->GetLink()->GetBeginNode() == _low )
)
{
delete _BI.item();
_BI.remove();
found = true;
}
else if ( found ) //only once in here
break;
else if ( record->Ysp() < _low->GetY() )
//if flatlinks are not in the beam nothing will be found
//this will bring us to the right insertion point
break;
else
_BI++;
}
}
else
{
//on record back bring us to the last inserted record
//or if nothing was inserted the record before the last deleted record
//if there was no record before the last deleted record this means
//we where at the beginning of the beam, so at root
_BI.tohead();
while ( !_BI.hitroot() )
{
kbRecord * record = _BI.item();
if ( record->Ysp() < _low->GetY() )
break;
_BI++;
}
}
}
break;
case NODELINK:
case LINKLINK:
{
if ( _type == NORMAL )
{
Calc_Ysp();
if ( scantype == LINKLINK )
foundnew = Process_LinkToLink_Crossings() != 0 || foundnew;
else
SortTheBeam( false );
}
//else beam is already sorted because the added/removed flat links
//do not change the ysp of links already there, new non flat links
//are inserted in order, as result the beam stays sorted
if ( _low->GetBinHighest( true ) ) //is there something to remove
{
_BI.tohead();
while ( !_BI.hitroot() )
{
kbRecord * record = _BI.item();
//records containing links towards the new low node
//are links to be removed
if ( ( record->GetLink()->GetEndNode() == _low ) ||
( record->GetLink()->GetBeginNode() == _low )
)
{
kbLine * line = record->GetLine();
if ( scantype == NODELINK )
foundnew = Process_PointToLink_Crossings() != 0 || foundnew;
line->ProcessCrossings( _I );
delete _BI.item();
_BI.remove();
found = true;
}
//because the beam is sorted on ysp, stop when nothing can be there to remove
//and the right insertion point for new links has been found
else if ( ( record->Ysp() < _low->GetY() ) )
break;
else
_BI++;
}
}
else
{
_BI.tohead();
while ( !_BI.hitroot() )
{
kbRecord * record = _BI.item();
//because the beam is sorted on ysp, stop when
//the right insertion point for new links has been found
if ( ( record->Ysp() < _low->GetY() ) )
break;
_BI++;
}
}
}
break;
default:
break;
}
return foundnew;
}
/*
bool ScanBeam::RemoveOld(SCANTYPE scantype,TDLI<kbLink>* _I, bool& holes )
{
bool found = false;
bool foundnew = false;
DL_Iter<kbRecord*> _BBI=DL_Iter<kbRecord*>();
bool attached=false;
_low = _I->item()->GetBeginNode();
switch(scantype)
{
case INOUT:
case GENLR:
case LINKHOLES:
if (_type==NORMAL )
{
kbLink* link = _low->GetBinHighest(true);
if ( link ) //is there something to remove
{
link->SetRecordNode( NULL );
if ( scantype == LINKHOLES )
{
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record = _BI.item();
//records containing links towards the new low node
//are links to be removed
if ((record->GetLink()->GetEndNode() == _low) ||
(record->GetLink()->GetBeginNode() == _low)
)
{
holes = ProcessHoles(false,_I) || holes;
}
_BI++;
}
}
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record=_BI.item();
//records containing links towards the new low node
//are links to be removed
if ((record->GetLink()->GetEndNode() == _low) ||
(record->GetLink()->GetBeginNode() == _low)
)
{
delete _BI.item();
_BI.remove();
found=true;
}
else if (found) //only once in here
{
attached=true;
found=false;
//recalculate ysp for the new scanline
record->Calc_Ysp(_low);
_BI++;
}
else
{
//recalculate ysp for the new scanline
record->Calc_Ysp(_low);
_BI++;
}
}
}
else
{
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record=_BI.item();
record->Calc_Ysp(_low);
_BI++;
}
}
}
else
{ //because the previous beam was flat the links to remove are
//below the last insert position
kbLink* link;
link = _low->GetBinHighest(true);
if( link )//is there something to remove
{
link->SetRecordNode( NULL );
bool linkf = false;
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record = _BI.item();
if (record->GetLink() == link)
linkf = true;
_BI++;
}
if ( !linkf )
_BI.tohead();
if ( scantype == LINKHOLES )
{
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record=_BI.item();
//records containing links towards the new low node
//are links to be removed
if ((record->GetLink()->GetEndNode() == _low) ||
(record->GetLink()->GetBeginNode() == _low)
)
{
holes = ProcessHoles(false,_I) || holes;
}
_BI++;
}
}
//_BI.tonode( link->GetRecordNode() );
//delete _BI.item();
//_BI.remove();
//on record back bring us to the last inserted record
//or if nothing was inserted the record before the last deleted record
//if there was no record before the last deleted record this means
//we where at the beginning of the beam, so at root
//_BI << (lastinserted+1);
//_BI--;
//if (_BI.hitroot()) //only possible when at the begin of the beam
//found=false;
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record=_BI.item();
//records containing links towards the new low node
//are links to be removed
if ((record->GetLink()->GetEndNode() == _low) ||
(record->GetLink()->GetBeginNode() == _low)
)
{
if ( link != record->GetLink() )
{
break;
}
if ( link->GetRecordNode() != _BI.node() )
{
delete _BI.item();
_BI.remove();
}
else
{
delete _BI.item();
_BI.remove();
}
found=true;
}
else if (found) //only once in here
break;
else if (record->Ysp() < _low->GetY())
//if flatlinks are not in the beam nothing will be found
//this will bring us to the right insertion point
break;
else
_BI++;
}
}
else
{
//on record back bring us to the last inserted record
//or if nothing was inserted the record before the last deleted record
//if there was no record before the last deleted record this means
//we where at the beginning of the beam, so at root
//_BI << (lastinserted+ 1);
//_BI--;
//if (_BI.hitroot()) //only possible when at the begin of the beam
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record=_BI.item();
if (record->Ysp() < _low->GetY())
break;
_BI++;
}
}
}
break;
case NODELINK:
case LINKLINK:
{
if (_type == NORMAL)
{
Calc_Ysp();
if (scantype==LINKLINK)
foundnew = Process_LinkToLink_Crossings() !=0 || foundnew;
else
SortTheBeam( false );
}
//else beam is already sorted because the added/removed flat links
//do not change the ysp of links already there, new non flat links
//are inserted in order, as result the beam stays sorted
if (_low->GetBinHighest(true)) //is there something to remove
{
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record=_BI.item();
//records containing links towards the new low node
//are links to be removed
if ((record->GetLink()->GetEndNode() == _low) ||
(record->GetLink()->GetBeginNode() == _low)
)
{
kbLine* line=record->GetLine();
if (scantype==NODELINK)
foundnew = Process_PointToLink_Crossings() !=0 || foundnew;
line->ProcessCrossings(_I);
delete _BI.item();
_BI.remove();
found=true;
}
//because the beam is sorted on ysp, stop when nothing can be there to remove
//and the right insertion point for new links has been found
else if ((record->Ysp() < _low->GetY()))
break;
else
_BI++;
}
}
else
{
_BI.tohead();
while (!_BI.hitroot())
{
kbRecord* record=_BI.item();
//because the beam is sorted on ysp, stop when
//the right insertion point for new links has been found
if ((record->Ysp() < _low->GetY()))
break;
_BI++;
}
}
}
break;
default:
break;
}
return foundnew;
}
*/
void ScanBeam::SortTheBeam( bool backangle )
{
if ( backangle )
_BI.mergesort( recordsorter_ysp_angle_back );
else
_BI.mergesort( recordsorter_ysp_angle );
}
void ScanBeam::Calc_Ysp()
{
_BI.tohead();
while ( !_BI.hitroot() )
{
kbRecord * record = _BI.item();
// kbLink* link=_BI.item()->GetLink();
record->Calc_Ysp( _low );
_BI++;
}
}
// this function will set for all the records which contain a link with the
// corresponding graphnumber the inc flag.
// The inc flag's function is to see in a beam if we go deeper in the graph or not
void ScanBeam::Generate_INOUT( int graphnumber )
{
DIRECTION first_dir = GO_LEFT;
int diepte = 0;
DL_Iter<kbRecord*> _BBI = DL_Iter<kbRecord*>();
_BBI.Attach( this );
for( _BBI.tohead(); !_BBI.hitroot(); _BBI++ )
{
// recalculate _inc again
if ( _BBI.item()->GetLink()->GetGraphNum() == graphnumber )
{ //found a link that belongs to the graph
if ( diepte == 0 )
{ // first link found or at depth zero again
// the direction is important since this is used to find out
// if we go further in or out for coming links
first_dir = _BBI.item()->Direction();
_BBI.item()->GetLink()->SetInc( true );
diepte = 1;
}
else
{ // according to depth=1 links set depth
// verhoog of verlaag diepte
if ( _BBI.item()->Direction() == first_dir )
{
diepte++;
_BBI.item()->GetLink()->SetInc( true );
}
else
{
diepte--;
_BBI.item()->GetLink()->SetInc( false );
}
}
}
if ( _BBI.item() == _BI.item() ) break; //not need to do the rest, will come in a later beam
}
_BBI.Detach();
}
// function ProcessHoles
//
// this function will search the closest link to a hole
// step one, search for a link that is marked (this is a hole)
// step two, the closest link is the previous link in
// the beam, but only in the beam that contains the highest node
// from the marked link.
// why ? : if the marked link has for the begin and end node different
// x,y values, see below as link C
// B
// A +---------+
// +----------+
// ___--+
// ___---
// +--- C
//
// when we at first detect link C we would link it to link A, should work he
// but; we always link a hole at its topleft node, so the highest node
// and then we can't link to A but we should link to B
// so when we found the link, we will look if the node that will come
// in a later beam will be higher than the current, if so we will wait
// till that node comes around otherwise we will link this node to the
// closest link (prev in beam)
bool ScanBeam::ProcessHoles( bool atinsert, TDLI<kbLink>* _LI )
{
// The scanbeam must already be sorted at this moment
kbNode * topnode;
bool foundholes = false;
kbRecord* record = _BI.item();
kbLink* link = record->GetLink();
kbNode* _low = _LI->item()->GetBeginNode();
if( _GC->GetAllowNonTopHoleLinking() )
{
_BI++;
if ( !_BI.hitroot() && _BI.item()->GetLink()->IsTopHole() )
{
kbLink* linkToThis = _BI.item()->GetLink();
//calculate linkToThis its Y at X of topnode.
kbLine line( _GC );
line.Set( linkToThis );
B_INT Y;
kbNode * leftnode; //left node of clossest link
//link right now
if ( linkToThis->GetEndNode()->GetX() == _low->GetX() )
Y = linkToThis->GetEndNode()->GetY();
else if ( linkToThis->GetBeginNode()->GetX() == _low->GetX() )
Y = linkToThis->GetBeginNode()->GetY();
else
Y = line.Calculate_Y( _low->GetX() );
if ( linkToThis->GetBeginNode()->GetX() < linkToThis->GetEndNode()->GetX() )
leftnode = linkToThis->GetBeginNode();
else
leftnode = linkToThis->GetEndNode();
kbNode *topnode = new kbNode( _low->GetX(), Y, _GC );
kbLink *link_A = new kbLink( 0, topnode, leftnode, _GC );
// the orginal linkToThis
linkToThis->Replace( leftnode, topnode );
_LI->insbegin( link_A );
//reset mark to flag that this hole has been processed
linkToThis->SetTopHole( false );
kbLink *link_B = new kbLink( 0, _low, topnode, _GC );
kbLink *link_BB = new kbLink( 0, topnode, _low, _GC );
_LI->insbegin( link_B );
_LI->insbegin( link_BB );
//mark those two segments as hole linking segments
link_B->SetHoleLink( true );
link_BB->SetHoleLink( true );
//is where we come from/link to a hole
bool closest_is_hole = linkToThis->GetHole();
// if the polygon linked to, is a hole, this hole here
// just gets bigger, so we take over the links its hole marking.
link_A->SetHole( closest_is_hole );
link_B->SetHole( closest_is_hole );
link_BB->SetHole( closest_is_hole );
// we have only one operation at the time, taking
// over the operation flags is enough, since the linking segments will
// be part of that output for any operation done.
link_A->TakeOverOperationFlags( linkToThis );
link_B->TakeOverOperationFlags( linkToThis );
link_BB->TakeOverOperationFlags( linkToThis );
foundholes = true;
SortTheBeam( atinsert );
}
_BI--;
}
if ( !record->GetLine()->CrossListEmpty() )
{
SortTheBeam( atinsert );
// link the holes in the graph to a link above.
// a the link where the linecrosslist is not empty, means that
// there are links which refer to this link (must be linked to this link)
// make new nodes and links and set them, re-use the old link, so the links
// that still stand in the linecrosslist will not be lost.
// There is a hole that must be linked to this link !
kbLink* linkToThis = link;
TDLI<kbNode> I( record->GetLine()->GetCrossList() );
I.tohead();
while( !I.hitroot() )
{
topnode = I.item();
I.remove();
//calculate linkToThis its Y at X of topnode.
kbLine line( _GC );
line.Set( linkToThis );
kbNode * leftnode; //left node of clossest link
B_INT Y;
//check if flatlink ( i think is always linkBB from a topnode at same X coordinate.
//but lets accept all flatlinks
if ( linkToThis->GetEndNode()->GetX() == linkToThis->GetBeginNode()->GetX() )
{
//we take the lowest of the flatlink nodes, which is right for
// a second hole at same X
if ( linkToThis->GetEndNode()->GetY() >= linkToThis->GetBeginNode()->GetY() )
{
Y = linkToThis->GetBeginNode()->GetY();
leftnode = linkToThis->GetBeginNode();
}
else
{
Y = linkToThis->GetEndNode()->GetY();
leftnode = linkToThis->GetEndNode();
}
}
else
{
if ( linkToThis->GetEndNode()->GetX() == topnode->GetX() )
Y = linkToThis->GetEndNode()->GetY();
else if ( linkToThis->GetBeginNode()->GetX() == topnode->GetX() )
Y = linkToThis->GetBeginNode()->GetY();
else
Y = line.Calculate_Y( topnode->GetX() );
if ( linkToThis->GetBeginNode()->GetX() < linkToThis->GetEndNode()->GetX() )
leftnode = linkToThis->GetBeginNode();
else
leftnode = linkToThis->GetEndNode();
}
// Now we'll create new nodes and new links to make the link between
// the graphs.
//holes are always linked in a non hole or hole
//for a non hole this link will be to the right
//because non holes are right around
//for holes this will be to the right also,
//because they are left around but the link is always on the
//bottom of the hole
// linkA linkToThis
// o-------->--------NodeA------->------------o
// leftnode | |
// | |
// linkB v ^ linkBB
// | |
// | |
// outgoing* | | incoming*
// o------<---------topnode--------<----------o
//
// all holes are oriented left around
kbNode *node_A = new kbNode( topnode->GetX(), Y, _GC );
kbLink *link_A = new kbLink( 0, leftnode, node_A, _GC );
kbLink *link_B = new kbLink( 0, node_A, topnode, _GC );
kbLink *link_BB = new kbLink( 0, topnode, node_A, _GC );
// the orginal linkToThis
linkToThis->Replace( leftnode, node_A );
_LI->insbegin( link_A );
_LI->insbegin( link_B );
_LI->insbegin( link_BB );
//mark those two segments as hole linking segments
link_B->SetHoleLink( true );
link_BB->SetHoleLink( true );
//is where we come from/link to a hole
bool closest_is_hole = linkToThis->GetHole();
// if the polygon linked to, is a hole, this hole here
// just gets bigger, so we take over the links its hole marking.
link_A->SetHole( closest_is_hole );
link_B->SetHole( closest_is_hole );
link_BB->SetHole( closest_is_hole );
// we have only one operation at the time, taking
// over the operation flags is enough, since the linking segments will
// be part of that output for any operation done.
link_A->TakeOverOperationFlags( linkToThis );
link_B->TakeOverOperationFlags( linkToThis );
link_BB->TakeOverOperationFlags( linkToThis );
// check next top node is at same X
if ( !I.hitroot() )
{
kbNode *newtopnode = I.item();
if ( topnode->GetX() == newtopnode->GetX() )
linkToThis = link_BB;
else
linkToThis = link;
}
}
}
if ( link->IsTopHole() )
{
SortTheBeam( atinsert );
writebeam();
}
if ( link->IsTopHole() && !_BI.athead() )
{
// now we check if this hole should now be linked, or later
// we always link on the node with the maximum y value, Why ? because i like it !
// to link we put the node of the hole into the crosslist of the closest link !
assert( record->Direction() == GO_LEFT );
// he goes to the left
if ( atinsert )
{
if ( link->GetBeginNode()->GetY() <= link->GetEndNode()->GetY() )
{
topnode = link->GetEndNode();
//the previous link in the scanbeam == the closest link to the hole in vertical
//direction PUT this node into this link
_BI--;
_BI.item()->GetLine()->AddCrossing( topnode );
_BI++;
//reset tophole flag, hole has been processed
link->SetTopHole( false );
foundholes = true;
}
}
else //remove stage of links from te beam
{
//the tophole link was NOT linked at the insert stage, so it most be linked now
topnode = _BI.item()->GetLink()->GetBeginNode();
//the previous link in the scanbeam == the closest link to the hole in vertical
//direction PUT this node into this link
_BI--;
_BI.item()->GetLine()->AddCrossing( topnode );
_BI++;
//reset mark to flag that this hole has been processed
link->SetTopHole( false );
foundholes = true;
}
}
return foundholes;
}
//sort the records on Ysp if eqaul, sort on tangent at ysp
int recordsorter_ysp_angle( kbRecord* rec1, kbRecord* rec2 )
{
if ( rec1->Ysp() > rec2->Ysp() )
return( 1 );
if ( rec1->Ysp() < rec2->Ysp() )
return( -1 );
//it seems they are equal
B_INT rightY1;
if ( rec1->Direction() == GO_LEFT )
rightY1 = rec1->GetLink()->GetBeginNode()->GetY();
else
rightY1 = rec1->GetLink()->GetEndNode()->GetY();
B_INT rightY2;
if ( rec2->Direction() == GO_LEFT )
rightY2 = rec2->GetLink()->GetBeginNode()->GetY();
else
rightY2 = rec2->GetLink()->GetEndNode()->GetY();
if ( rightY1 > rightY2 )
return( 1 );
if ( rightY1 < rightY2 )
return( -1 );
return( 0 );
}
//sort the records on Ysp if eqaul, sort on tangent at ysp
int recordsorter_ysp_angle_back( kbRecord* rec1, kbRecord* rec2 )
{
if ( rec1->Ysp() > rec2->Ysp() )
return( 1 );
if ( rec1->Ysp() < rec2->Ysp() )
return( -1 );
//it seems they are equal
B_INT leftY1;
if ( rec1->Direction() == GO_RIGHT )
leftY1 = rec1->GetLink()->GetBeginNode()->GetY();
else
leftY1 = rec1->GetLink()->GetEndNode()->GetY();
B_INT leftY2;
if ( rec2->Direction() == GO_RIGHT )
leftY2 = rec2->GetLink()->GetBeginNode()->GetY();
else
leftY2 = rec2->GetLink()->GetEndNode()->GetY();
if ( leftY1 > leftY2 )
return( 1 );
if ( leftY1 < leftY2 )
return( -1 );
return( 0 );
}
// swap functie for cocktailsort ==> each swap means an intersection of links
bool swap_crossing_normal( kbRecord *a, kbRecord *b )
{
if ( !a->Equal( b ) ) // records NOT parallel
{
a->GetLine()->Intersect_simple( b->GetLine() );
return true;
}
return false;
}
int ScanBeam::Process_LinkToLink_Crossings()
{
// sort on y value of next intersection; and find the intersections
return _BI.cocktailsort( recordsorter_ysp_angle_back, swap_crossing_normal );
}
//catch node to link crossings
// must be sorted on ysp
int ScanBeam::Process_PointToLink_Crossings()
{
int merges = 0;
kbRecord* record;
if ( _BI.count() > 1 )
{
DL_Iter<kbRecord*> IL = DL_Iter<kbRecord*>( this );
IL.toiter( &_BI );
//from IL search back for close links
IL--;
while( !IL.hitroot() )
{
record = IL.item();
if ( record->Ysp() > _low->GetY() + _GC->GetInternalMarge() )
break;
// the distance to the lo/hi node is smaller then the _GC->GetInternalMarge()
if( ( record->GetLink()->GetBeginNode() != _low ) &&
( record->GetLink()->GetEndNode() != _low )
)
{ // the link is not towards the lohi node
record->GetLine()->AddCrossing( _low );
merges++;
}
IL--;
}
//from IL search forward for close links
IL.toiter( &_BI );
IL++;
while( !IL.hitroot() )
{
record = IL.item();
if ( record->Ysp() < _low->GetY() - _GC->GetInternalMarge() )
break;
// the distance to the lohi node is smaller then the booleng->Get_Marge()
if( ( record->GetLink()->GetBeginNode() != _low ) &&
( record->GetLink()->GetEndNode() != _low )
)
{ // the link is not towards the low node
record->GetLine()->AddCrossing( _low );
merges++;
}
IL++;
}
}
return merges;
}
int ScanBeam::Process_LinkToLink_Flat( kbLine* flatline )
{
int crossfound = 0;
kbRecord* record;
DL_Iter<kbRecord*> _BBI = DL_Iter<kbRecord*>();
_BBI.Attach( this );
_BBI.toiter( &_BI );
for( _BI.tohead(); !_BI.hitroot(); _BI++ )
{
record = _BI.item();
if ( record->Ysp() < ( flatline->GetLink()->GetLowNode()->GetY() - _GC->GetInternalMarge() ) )
break;//they are sorted so no other can be there
if ( ( record->Ysp() > ( flatline->GetLink()->GetLowNode()->GetY() - _GC->GetInternalMarge() ) )
&&
( record->Ysp() < ( flatline->GetLink()->GetHighNode()->GetY() + _GC->GetInternalMarge() ) )
)
{ //it is in between the flat link region
//create a new node at ysp and insert it in both the flatlink and the crossing link
if (
( record->GetLink()->GetEndNode() != flatline->GetLink()->GetHighNode() ) &&
( record->GetLink()->GetEndNode() != flatline->GetLink()->GetLowNode() ) &&
( record->GetLink()->GetBeginNode() != flatline->GetLink()->GetHighNode() ) &&
( record->GetLink()->GetBeginNode() != flatline->GetLink()->GetLowNode() )
)
{
kbNode * newnode = new kbNode( _low->GetX(), _BI.item()->Ysp(), _GC );
flatline->AddCrossing( newnode );
record->GetLine()->AddCrossing( newnode );
crossfound++;
}
}
}
_BI.toiter( &_BBI );
_BBI.Detach();
return crossfound;
}
bool ScanBeam::checksort()
{
// if empty then just insert
if ( empty() )
return true;
// put new item left of the one that is bigger
_BI.tohead();
kbRecord* prev = _BI.item();
_BI++;
while( !_BI.hitroot() )
{
kbRecord * curr = _BI.item();
if ( recordsorter_ysp_angle( prev, curr ) == -1 )
{
recordsorter_ysp_angle( prev, curr );
return false;
}
prev = _BI.item();
_BI++;
}
return true;
}
bool ScanBeam::writebeam()
{
#if KBOOL_DEBUG == 1
FILE * file = _GC->GetLogFile();
if ( file == NULL )
return true;
fprintf( file, "# beam %d \n", count() );
fprintf( file, " low %I64d %I64d \n", _low->GetX() , _low->GetY() );
fprintf( file, " type %d \n", _type );
if ( empty() )
{
fprintf( file, " empty \n" );
return true;
}
DL_Iter<kbRecord*> _BI( this );
// put new item left of the one that is bigger
_BI.tohead();
while( !_BI.hitroot() )
{
kbRecord * cur = _BI.item();
fprintf( file, " ysp %I64d \n", cur->Ysp() );
kbLink* curl = cur->GetLink();
fprintf( file, " linkbegin %I64d %I64d \n", curl->GetBeginNode()->GetX(), curl->GetBeginNode()->GetY() );
fprintf( file, " linkend %I64d %I64d \n", curl->GetEndNode()->GetX(), curl->GetEndNode()->GetY() );
if ( curl->GetEndNode()->GetX() == -2459565876494606883 )
fprintf( file, " linkend %I64d %I64d \n", curl->GetEndNode()->GetX(), curl->GetEndNode()->GetY() );
_BI++;
}
#endif
return true;
}