-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathfileio.cpp
1054 lines (1024 loc) · 28.4 KB
/
fileio.cpp
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
/******************************************************/
/* */
/* fileio.cpp - file I/O */
/* */
/******************************************************/
/* Copyright 2019-2021,2023 Pierre Abbat.
* This file is part of PerfectTIN.
*
* PerfectTIN is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* PerfectTIN is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License and Lesser General Public License
* for more details.
*
* You should have received a copy of the GNU General Public License
* and Lesser General Public License along with PerfectTIN. If not, see
* <http://www.gnu.org/licenses/>.
*/
#include <vector>
#include <cmath>
#include <cstring>
#include "dxf.h"
#include "random.h"
#include "neighbor.h"
#include "boundrect.h"
#include "octagon.h"
#include "ply.h"
#include "xyzfile.h"
#include "ldecimal.h"
#include "las.h"
#include "threads.h"
#include "binio.h"
#include "angle.h"
#include "cloud.h"
#include "fileio.h"
using namespace std;
CoordCheck zCheck;
Printer3dSize printer3d;
char hexdig[16]={'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'};
const double verticalOffset=0;
/* The vertical offset is added to all points' elevations for debugging
* the checksums. It is also added to the checksums in a way that depends
* on the total number of dots. When not debugging, set it to 0.
*/
PtinHeader::PtinHeader()
{
conversionTime=tolRatio=density=numPoints=numConvexHull=numTriangles=flags=0;
tolerance=NAN;
}
CoordCheck::CoordCheck()
{
clear();
}
void CoordCheck::clear()
{
count=0;
memset(stage0,0,sizeof(stage0));
memset(stage1,0,sizeof(stage1));
memset(stage2,0,sizeof(stage2));
memset(stage3,0,sizeof(stage3));
memset(stage4,0,sizeof(stage4));
}
void CoordCheck::dump()
// For debugging the test, which shifts mostly 0s into it.
{
int i,j;
bool labeled;
for (i=0;i<14;i++)
{
labeled=false;
for (j=0;j<8192;j++)
if (stage0[i][j])
{
if (!labeled)
cout<<"Stage 0["<<i<<"]\n";
labeled=true;
cout<<"["<<j<<" ("<<hex<<j<<")]="<<dec<<stage0[i][j]<<endl;
}
}
for (i=0;i<27;i++)
{
labeled=false;
for (j=0;j<8192;j++)
if (stage1[i][j])
{
if (!labeled)
cout<<"Stage 1["<<i<<"]\n";
labeled=true;
cout<<"["<<j<<" ("<<hex<<j<<")]="<<dec<<stage1[i][j]<<endl;
}
}
for (i=0;i<40;i++)
{
labeled=false;
for (j=0;j<8192;j++)
if (stage2[i][j])
{
if (!labeled)
cout<<"Stage 2["<<i<<"]\n";
labeled=true;
cout<<"["<<j<<" ("<<hex<<j<<")]="<<dec<<stage2[i][j]<<endl;
}
}
for (i=0;i<53;i++)
{
labeled=false;
for (j=0;j<8192;j++)
if (stage3[i][j])
{
if (!labeled)
cout<<"Stage 3["<<i<<"]\n";
labeled=true;
cout<<"["<<j<<" ("<<hex<<j<<")]="<<dec<<stage3[i][j]<<endl;
}
}
for (i=0;i<64;i++)
{
labeled=false;
for (j=0;j<4096;j++)
if (stage4[i][j])
{
if (!labeled)
cout<<"Stage 4["<<i<<"]\n";
labeled=true;
cout<<"["<<j<<" ("<<hex<<j<<")]="<<dec<<stage4[i][j]<<endl;
}
}
}
CoordCheck& CoordCheck::operator<<(double val)
{
int i;
double lastStageSum;
for (i=0;i<13;i++)
if ((count>>i)&1)
stage0[i][count&8191]=-val;
else
stage0[i][count&8191]=val;
stage0[13][count&8191]=val;
if ((count&8191)==8191)
{
for (i=0;i<13;i++)
stage1[i][(count>>13)&8191]=pairwisesum(stage0[i],8192);
lastStageSum=pairwisesum(stage0[13],8192);
for (i=13;i<26;i++)
if ((count>>i)&1)
stage1[i][(count>>13)&8191]=-lastStageSum;
else
stage1[i][(count>>13)&8191]=lastStageSum;
stage1[26][(count>>13)&8191]=lastStageSum;
memset(stage0,0,sizeof(stage0));
}
if ((count&0x3ffffff)==0x3ffffff)
{
for (i=0;i<26;i++)
stage2[i][(count>>26)&8191]=pairwisesum(stage1[i],8192);
lastStageSum=pairwisesum(stage1[26],8192);
for (i=26;i<39;i++)
if ((count>>i)&1)
stage2[i][(count>>26)&8191]=-lastStageSum;
else
stage2[i][(count>>26)&8191]=lastStageSum;
stage2[39][(count>>26)&8191]=lastStageSum;
memset(stage1,0,sizeof(stage1));
}
if ((count&0x7fffffffff)==0x7fffffffff)
{
for (i=0;i<39;i++)
stage3[i][(count>>39)&8191]=pairwisesum(stage2[i],8192);
lastStageSum=pairwisesum(stage2[39],8192);
for (i=39;i<52;i++)
if ((count>>i)&1)
stage3[i][(count>>39)&8191]=-lastStageSum;
else
stage3[i][(count>>39)&8191]=lastStageSum;
stage3[52][(count>>39)&8191]=lastStageSum;
memset(stage2,0,sizeof(stage2));
}
if ((count&0xfffffffffffff)==0xfffffffffffff)
{
for (i=0;i<52;i++)
stage4[i][(count>>52)&8191]=pairwisesum(stage3[i],8192);
lastStageSum=pairwisesum(stage3[52],8192);
for (i=52;i<64;i++)
if ((count>>i)&1)
stage4[i][(count>>52)&8191]=-lastStageSum;
else
stage4[i][(count>>52)&8191]=lastStageSum;
memset(stage3,0,sizeof(stage3));
}
count++;
return *this;
}
double CoordCheck::operator[](int n)
{
int n0=n,n1=n,n2=n,n3=n;
int s0=1,s1=1,s2=1,s3=1;
if (n0>=13)
{
n0=13;
s0=1-2*((count>>n)&1);
}
if (n1>=26)
{
n1=26;
s1=1-2*((count>>n)&1);
}
if (n2>=39)
{
n2=39;
s2=1-2*((count>>n)&1);
}
if (n3>=52)
{
n3=52;
s3=1-2*((count>>n)&1);
}
return pairwisesum(stage0[n0],8192)*s0+pairwisesum(stage1[n1],8192)*s1+
pairwisesum(stage2[n2],8192)*s2+pairwisesum(stage3[n3],8192)*s3+
pairwisesum(stage4[n],4096);
}
double CoordCheck::wrongCheck(int n)
/* This is a bug that was in version 0.5.1 and earlier. It made the checksums
* 13th, 26th, 39th, and 52nd (counting from 0) garbage.
*/
{
int n0=n,n1=n,n2=n,n3=n;
int s0=1,s1=1,s2=1,s3=1;
if (n0>13)
{
n0=13;
s0=1-2*((count>>n)&1);
}
if (n1>26)
{
n1=26;
s1=1-2*((count>>n)&1);
}
if (n2>39)
{
n2=39;
s2=1-2*((count>>n)&1);
}
if (n3>52)
{
n3=52;
s3=1-2*((count>>n)&1);
}
return pairwisesum(stage0[n0],8192)*s0+pairwisesum(stage1[n1],8192)*s1+
pairwisesum(stage2[n2],8192)*s2+pairwisesum(stage3[n3],8192)*s3+
pairwisesum(stage4[n],4096);
}
/* These functions are common to the command-line and GUI programs.
* In the GUI program, file I/O is done by a thread, one at a time (except
* that multiple formats of the same TIN may be output by different threads
* at once), while the program is not working on the TIN.
*/
string noExt(string fileName)
{
long long slashPos,dotPos; // npos turns into -1, which is convenient
string between;
slashPos=fileName.rfind('/');
dotPos=fileName.rfind('.');
if (dotPos>slashPos)
{
between=fileName.substr(slashPos+1,dotPos-slashPos-1);
if (between.find_first_not_of('.')>between.length())
dotPos=-1;
}
if (dotPos>slashPos)
fileName.erase(dotPos);
return fileName;
}
string extension(string fileName)
{
long long slashPos,dotPos; // npos turns into -1, which is convenient
string between;
slashPos=fileName.rfind('/');
dotPos=fileName.rfind('.');
if (dotPos>slashPos)
{
between=fileName.substr(slashPos+1,dotPos-slashPos-1);
if (between.find_first_not_of('.')>between.length())
dotPos=-1;
}
if (dotPos>slashPos)
fileName.erase(0,dotPos);
else
fileName="";
return fileName;
}
string baseName(string fileName)
{
long long slashPos;
slashPos=fileName.rfind('/');
return fileName.substr(slashPos+1);
}
void deleteFile(string fileName)
{
remove(fileName.c_str());
}
string randomRenameFile(string fileName)
/* Renames a file, adding a random suffix. The file will be deleted later.
* In Windows, moving a file on top of an existing file doesn't work.
* So move the file first, write the new file, then delete the old file.
*/
{
unsigned int suffixInt=rng.uirandom();
int i;
string newName=fileName;
for (i=0;i<8;i++)
newName+=hexdig[(suffixInt>>(4*i))&15];
rename(fileName.c_str(),newName.c_str());
return newName;
}
void writeDxf(string outputFile,bool asc,double outUnit,int flags)
/* Writes TIN and contours in DXF.
* flags bit 0=write empty triangles; bit 1=write only triangles in boundary;
* bit 2=don't write any triangles if there are contours.
*/
{
vector<GroupCode> dxfCodes;
vector<DxfLayer> dxfLayers;
map<ContourLayer,int> contourLayers;
int i,n;
map<ContourLayer,int>::iterator j;
map<ContourInterval,vector<polyspiral> >::iterator k;
DxfLayer layer;
ContourLayer cl;
BoundRect br;
ofstream dxfFile(outputFile,ofstream::binary|ofstream::trunc);
br.include(&net);
contourLayers=net.contourLayers();
layer.name="TIN";
layer.number=1;
layer.color=1;
dxfLayers.push_back(layer);
layer.name="Boundary";
layer.number=2;
layer.color=4;
dxfLayers.push_back(layer);
for (j=contourLayers.begin();j!=contourLayers.end();++j)
{
layer.name="Contour "+j->first.ci.valueToleranceString()+
' '+hexEncodeInt(j->first.tp);
layer.number=j->second;
layer.color=(j->first.tp>>8)*2+1;
dxfLayers.push_back(layer);
}
//dxfHeader(dxfCodes,br);
tableSection(dxfCodes,dxfLayers);
openEntitySection(dxfCodes);
for (i=0;i<net.triangles.size();i++)
if (net.triangles[i].ptValid())
if (net.shouldWrite(i,flags,contourLayers.size()))
insertTriangle(dxfCodes,net.triangles[i],outUnit);
else;
else
cerr<<"Invalid triangle "<<i<<endl;
if (net.boundary.size())
{
layer=dxfLayers[1];
insertPolyline(dxfCodes,net.boundary,layer,outUnit);
}
for (k=net.contours.begin();k!=net.contours.end();++k)
{
cl.ci=k->first;
for (i=0;i<k->second.size();i++)
{
cl.tp=cl.ci.contourType(k->second[i].getElevation());
n=contourLayers[cl]-1;
layer=dxfLayers[n];
insertPolyline(dxfCodes,k->second[i],layer,outUnit);
}
}
closeEntitySection(dxfCodes);
dxfEnd(dxfCodes);
writeDxfGroups(dxfFile,dxfCodes,asc);
}
void writeStl(string outputFile,bool asc,double outUnit,int flags)
/* Unlike the other export functions, setting outUnit to feet does not result
* in an STL file in feet; the file is always in millimeters. Rather, it means
* to prefer scales 1:x where x is divisible by 12. Also the flag does not mean
* to write empty triangles, which must always be written in STL; rather
* it means to decrease the scale to a round number.
*/
{
ofstream stlFile(outputFile,asc?ios::trunc:(ios::binary|ios::trunc));
double bear;
vector<StlTriangle> stltri;
bear=turnFitInPrinter(net,printer3d);
stltri=stlMesh(printer3d,false,false);
if (asc)
writeStlText(stlFile,stltri);
else
writeStlBinary(stlFile,stltri);
}
int readCloud(string &inputFile,double inUnit,int flags)
{
int i,already=cloud.size(),ret=0;
readPly(inputFile);
if (cloud.size()>already)
ret=RES_LOAD_PLY;
else
{
try
{
readLas(inputFile,flags);
}
catch (...)
{
cloud.resize(already);
}
if (cloud.size()>already)
ret=RES_LOAD_LAS;
}
if (cloud.size()==already)
{
readXyzText(inputFile);
if (cloud.size()>already)
ret=RES_LOAD_XYZ;
}
if (cloud.size()>already)
cout<<"Read "<<cloud.size()-already<<" dots\n";
for (i=already;i<cloud.size();i++)
cloud[i]*=inUnit;
return ret;
}
void writePoint(ostream &file,xyz pnt)
{
writeledouble(file,pnt.getx());
writeledouble(file,pnt.gety());
writeledouble(file,pnt.getz());
}
xyz readPoint(istream &file)
{
double x,y,z;
x=readledouble(file);
y=readledouble(file);
z=readledouble(file)+verticalOffset;
return xyz(x,y,z);
}
void writePoint4(ostream &file,xyz pnt)
{
writelefloat(file,pnt.getx());
writelefloat(file,pnt.gety());
writelefloat(file,pnt.getz());
}
xyz readPoint4(istream &file)
{
double x,y,z;
if (file.eof())
{
x=INFINITY;
y=z=NAN;
}
else
{
z=y=x=readlefloat(file);
if (std::isfinite(y))
z=y=readlefloat(file);
if (std::isfinite(z))
z=readlefloat(file);
}
return xyz(x,y,z);
}
void writeTriangle(ostream &file,triangle *tri)
{
int aInx,bInx,cInx;
int i;
xyz ctr;
net.wingEdge.lock_shared();
aInx=net.revpoints[tri->a];
bInx=net.revpoints[tri->b];
cInx=net.revpoints[tri->c];
net.wingEdge.unlock_shared();
ctr=((xyz)*tri->a+(xyz)*tri->b+(xyz)*tri->c)/3;
writeleint(file,aInx);
writeleint(file,bInx);
writeleint(file,cInx);
file.put(tri->dots.size()<255?tri->dots.size():255);
/* To save space, dots are written in 4-byte floats as the difference from
* the centroid. If there are at least 255 dots, the end is marked with NAN.
*/
for (i=0;i<tri->dots.size();i++)
{
writePoint4(file,tri->dots[i]-ctr);
zCheck<<tri->dots[i].getz();
}
if (tri->dots.size()>=255)
writelefloat(file,NAN);
}
const int ptinHeaderFormat=0x0000002c;
/* ptinHeaderFormat counts all bytes after the header format itself and before
* the start of points. The low two bytes are the count of bytes; the high
* two bytes are used to disambiguate between header formats that have
* the same number of bytes.
*
* Header formats:
* 0006 001c 01f0 1fc0 Magic numbers
* uint32 Header format (0x20, 0x28, or 0x2c)
* uint64 Timestamp
* uint32 Tolerance ratio
* double Tolerance
* double Density, not present in format 0x20
* uint32 Number of points
* uint32 Number of points in convex hull
* uint32 Number of triangles
* uint32 Number of groups of polylines, not present in format 0x20 or 0x28
*/
/* Format of contour lines:
* 0000 This is a group of contour lines
* 0010 Length of the label
* double*2 Label of this group of contour lines (the contour interval and tolerance)
* 0000 Each contour is a 2D polyline with elevation
* uint32 Number of contours
* Format of one contour:
* double Elevation
* byte Curvy bit
* uint32 Number of endpoints
* double*2n Endpoints
* uint32 Number of lengths
* double*n Lengths
* uint32 Number of deltas
* int32*n Deltas (final zeros omitted)
* uint32 Number of delta2s
* int32*n Delta2s (final zeros omitted)
* uint32 Checksum
*/
void writePtin(string outputFile,int tolRatio,double tolerance,double density)
/* outputFile contains the tolerance ratio, unless it's 1.
* tolerance is the final, not stage, tolerance. This can cause weirdness
* if one changes the tolerance during a conversion.
*/
{
int i,n;
map<ContourInterval,std::vector<polyspiral> >::iterator j;
xyz pnt;
triangle *tri;
ofstream checkFile;
string delendum;
vector<double> zcheck;
delendum=randomRenameFile(outputFile);
checkFile.open(outputFile,ios::binary);
zCheck.clear();
writeleshort(checkFile,6);
writeleshort(checkFile,28);
writeleshort(checkFile,496);
writeleshort(checkFile,8128);
writeleint(checkFile,ptinHeaderFormat);
writelelong(checkFile,net.conversionTime);
writeleint(checkFile,tolRatio);
writeledouble(checkFile,NAN); // will be filled in later with tolerance
writeledouble(checkFile,NAN); // will be filled in later with density
writeleint(checkFile,net.points.size());
writeleint(checkFile,net.convexHull.size());
writeleint(checkFile,net.triangles.size());
writeleint(checkFile,net.contours.size()+(net.boundary.size()>0));
for (i=1;i<=net.points.size();i++)
{
net.wingEdge.lock_shared();
pnt=net.points[i];
net.wingEdge.unlock_shared();
writePoint(checkFile,pnt);
}
for (i=0;i<net.convexHull.size();i++)
{
net.wingEdge.lock_shared();
n=net.revpoints[net.convexHull[i]];
net.wingEdge.unlock_shared();
writeleint(checkFile,n);
}
for (i=0;i<net.triangles.size();i++)
{
net.wingEdge.lock_shared();
tri=&net.triangles[i];
net.wingEdge.unlock_shared();
writeTriangle(checkFile,tri);
}
for (i=0;i<64;i++)
zcheck.push_back(zCheck[i]);
while (zcheck.size()>1 && zcheck[zcheck.size()-1]==zcheck[zcheck.size()-2])
zcheck.resize(zcheck.size()-1);
checkFile.put(zcheck.size());
for (i=0;i<zcheck.size();i++)
writeledouble(checkFile,zcheck[i]);
for (j=net.contours.begin();j!=net.contours.end();++j)
{
writeleshort(checkFile,GRP_CONTOUR);
writeleshort(checkFile,16);
writeledouble(checkFile,j->first.mediumInterval());
writeledouble(checkFile,j->first.getRelativeTolerance());
writeleshort(checkFile,GRPTYPE_POLY);
writeleint(checkFile,j->second.size());
for (i=0;i<j->second.size();i++)
{
j->second[i].write(checkFile);
writeleint(checkFile,j->second[i].checksum());
}
}
if (net.boundary.size())
{
writeleshort(checkFile,GRP_BOUNDARY);
writeleshort(checkFile,0);
writeleshort(checkFile,GRPTYPE_POLY);
writeleint(checkFile,1);
net.boundary.write(checkFile);
writeleint(checkFile,net.boundary.checksum());
}
checkFile.flush();
checkFile.seekp(24,ios::beg);
writeledouble(checkFile,tolerance);
writeledouble(checkFile,density);
net.setDirty(false);
deleteFile(delendum);
}
PtinHeader readPtinHeader(istream &inputFile)
{
PtinHeader ret;
int headerFormat;
if (readleshort(inputFile)==6 && readleshort(inputFile)==28 &&
readleshort(inputFile)==496 && readleshort(inputFile)==8128)
{
headerFormat=readleint(inputFile);
switch (headerFormat)
{
case 0x00000020:
ret.conversionTime=readlelong(inputFile);
ret.tolRatio=readleint(inputFile);
ret.tolerance=readledouble(inputFile);
ret.density=1/sqr(ret.tolerance);
ret.numPoints=readleint(inputFile);
ret.numConvexHull=readleint(inputFile);
ret.numTriangles=readleint(inputFile);
ret.numGroups=0;
break;
case 0x00000028:
ret.conversionTime=readlelong(inputFile);
ret.tolRatio=readleint(inputFile);
ret.tolerance=readledouble(inputFile);
ret.density=readledouble(inputFile);
ret.numPoints=readleint(inputFile);
ret.numConvexHull=readleint(inputFile);
ret.numTriangles=readleint(inputFile);
ret.numGroups=0;
break;
case 0x0000002c:
ret.conversionTime=readlelong(inputFile);
ret.tolRatio=readleint(inputFile);
ret.tolerance=readledouble(inputFile);
ret.density=readledouble(inputFile);
ret.numPoints=readleint(inputFile);
ret.numConvexHull=readleint(inputFile);
ret.numTriangles=readleint(inputFile);
ret.numGroups=readleint(inputFile);
break;
default:
ret.tolRatio=PT_UNKNOWN_HEADER_FORMAT;
}
if (ret.numTriangles!=2*ret.numPoints-ret.numConvexHull-2)
ret.tolRatio=PT_COUNT_MISMATCH;
}
else
ret.tolRatio=PT_NOT_PTIN_FILE;
return ret;
}
int skewsym(int a,int b)
/* skewsym(a,b)=-skewsym(b,a). This function is used to check that every edge
* (a,b) in a triangle is matched by another edge (b,a) in another triangle
* or in the convex hull. It is nonlinear so that omitting a triangle will not
* result in 0.
*/
{
int a1,a2,b1,b2;
a1=a*0x69969669;
a2=a*PHITURN;
b1=b*0x69969669;
b2=b*PHITURN;
a1=((a1&0xffe00000)>>21)|(a1&0x1ff800)|((a1&0x7ff)<<21);
a2=((a2&0xffff0000)>>16)|((a2&0xffff)<<16);
b1=((b1&0xffe00000)>>21)|(b1&0x1ff800)|((b1&0x7ff)<<21);
b2=((b2&0xffff0000)>>16)|((b2&0xffff)<<16);
return a*b1*a2-b*a1*b2;
}
PtinHeader readPtinHeader(std::string inputFile)
{
ifstream ptinFile(inputFile,ios::binary);
return readPtinHeader(ptinFile);
}
PtinHeader readPtin(std::string inputFile)
{
ifstream ptinFile(inputFile,ios::binary);
PtinHeader header;
int i,j,m,n,a,b,c;
int edgeCheck=0;
int nContours;
vector<int> convexHull;
vector<double> areas,sqrOffsets;
triangle *tri;
xyz pnt,ctr;
bool readingStarted=false;
double high=-INFINITY,low=INFINITY;
double absToler,rmsOffset;
double conterval,contoler;
uint64_t verticalAffect,mask;
vector<double> zcheck;
ContourInterval ci(0,0,false);
polyspiral ctour;
int concheck;
zCheck.clear();
header=readPtinHeader(ptinFile);
if (nBuckets()==0)
resizeBuckets(1);
if (header.tolRatio>0 && header.tolerance>0)
{
net.clear();
cloud.clear();
readingStarted=true;
for (i=1;i<=header.numPoints;i++)
{
net.wingEdge.lock();
net.points[i]=point(readPoint(ptinFile));
net.revpoints[&net.points[i]]=i;
net.wingEdge.unlock();
if (ptinFile.eof())
{
header.tolRatio=PT_EOF;
break;
}
if (net.points[i].getz()>high)
high=net.points[i].getz();
if (net.points[i].getz()<low)
low=net.points[i].getz();
}
}
colorize.setLimits(low,high);
swap(low,high);
if (header.tolRatio>0 && header.tolerance>0)
for (i=0;i<header.numConvexHull;i++)
{
n=readleint(ptinFile);
if (n<1 || n>header.numPoints)
header.tolRatio=PT_INVALID_POINT_NUMBER;
if (i)
edgeCheck+=skewsym(n,convexHull.back());
if (ptinFile.eof())
{
header.tolRatio=PT_EOF;
break;
}
convexHull.push_back(n);
net.convexHull.push_back(&net.points[n]);
}
if (convexHull.size())
edgeCheck+=skewsym(convexHull[0],convexHull.back());
if (header.tolRatio>0 && header.tolerance>0)
if (!net.validConvexHull())
header.tolRatio=PT_INVALID_CONVEX_HULL;
if (header.tolRatio>0 && header.tolerance>0)
for (i=0;i<header.numTriangles && header.tolRatio>0;i++)
{
net.wingEdge.lock();
n=net.addtriangle();
//cout<<n<<' ';
tri=&net.triangles[n];
a=readleint(ptinFile);
//cout<<a<<' ';
if (a<1 || a>header.numPoints)
header.tolRatio=PT_INVALID_POINT_NUMBER;
tri->a=&net.points[a];
b=readleint(ptinFile);
//cout<<b<<' ';
if (b<1 || b>header.numPoints)
header.tolRatio=PT_INVALID_POINT_NUMBER;
tri->b=&net.points[b];
c=readleint(ptinFile);
//cout<<c<<'\n';
if (c<1 || c>header.numPoints)
header.tolRatio=PT_INVALID_POINT_NUMBER;
tri->c=&net.points[c];
ctr=((xyz)*tri->a+(xyz)*tri->b+(xyz)*tri->c)/3;
tri->flatten();
//cout<<i<<' '<<tri->sarea<<endl;
if (!(tri->sarea>0)) // so written to catch the NaN case
header.tolRatio=PT_BACKWARD_TRIANGLE;
areas.push_back(tri->sarea);
edgeCheck+=skewsym(a,b)+skewsym(b,c)+skewsym(c,a);
m=ptinFile.get()&255;
if (m<255)
for (j=0;j<m;j++)
{
pnt=readPoint4(ptinFile);
if (xy(pnt).length()>tri->peri/3)
header.tolRatio=PT_DOT_OUTSIDE;
sqrOffsets.push_back(sqr(pnt.getz()));
pnt+=ctr;
if (tri->in(pnt))
tri->dots.push_back(pnt);
else
/* Because dots are stored in float, roundoff error can push a dot
* near an edge into an adjacent triangle. This will not affect the
* PT_DOT_OUTSIDE check, but could result in the dot being shuttled
* into a faraway triangle as refinement of the TIN continues.
*/
cloud.push_back(pnt);
zCheck<<pnt.getz();
if (pnt.getz()>high)
high=pnt.getz();
if (pnt.getz()<low)
low=pnt.getz();
}
else
while (true)
{
pnt=readPoint4(ptinFile);
if (xy(pnt).length()>tri->peri/3)
header.tolRatio=PT_DOT_OUTSIDE;
if (!pnt.isnan())
sqrOffsets.push_back(sqr(pnt.getz()));
pnt+=ctr;
if (pnt.isnan())
{
if (std::isinf(pnt.getx()))
header.tolRatio=PT_EOF;
break;
}
if (tri->in(pnt))
tri->dots.push_back(pnt);
else // See above.
cloud.push_back(pnt);
zCheck<<pnt.getz();
if (pnt.getz()>high)
high=pnt.getz();
if (pnt.getz()<low)
low=pnt.getz();
}
tri->dots.shrink_to_fit();
net.wingEdge.unlock();
markBucketDirty(i); // keep painting triangles
if (tri->dots.size()>65536)
sleepRead(); // Let GUI update between big triangles
}
//cout<<"edgeCheck="<<edgeCheck<<endl;
rmsOffset=sqrt(pairwisesum(sqrOffsets)/sqrOffsets.size());
if (!isfinite(rmsOffset))
rmsOffset=0;
if (header.tolRatio>0 && header.tolerance>0 && edgeCheck)
header.tolRatio=PT_EDGE_MISMATCH;
if (header.tolRatio>0 && header.tolerance>0)
{
colorize.setLimits(low,high);
clipHigh=2*high-low;
clipLow=2*low-high;
n=ptinFile.get()&255;
for (i=0;i<n;i++)
{
/* The vertical offset affects the checksums like this:
* 0: +0 +1 +0 +1 +0 +1 +0 +1 +0 +1 +0 +1 +0 +1 +0 +1 +0 ...
* 1: +0 +1 +2 +1 +0 +1 +2 +1 +0 +1 +2 +1 +0 +1 +2 +1 +0 ...
* 2: +0 +1 +2 +3 +4 +3 +2 +1 +0 +1 +2 +3 +4 +3 +2 +1 +0 ...
* 3: +0 +1 +2 +3 +4 +5 +6 +7 +8 +7 +6 +5 +4 +3 +2 +1 +0 ...
* where the numbers of dots start with 0.
*/
mask=((uint64_t)1<<i)-1;
if (zCheck.getCount()&(mask+1))
verticalAffect=mask+1-(mask&zCheck.getCount());
else
verticalAffect=mask&zCheck.getCount();
zcheck.push_back(readledouble(ptinFile)+verticalAffect*verticalOffset);
}
if (n==0)
zcheck.push_back(0);
while (zcheck.size()<64)
zcheck.push_back(zcheck.back());
absToler=header.tolRatio*rmsOffset*sqrt(zCheck.getCount())/CHECKSUM_DIV1;
//cout<<"absToler="<<absToler<<endl;
for (i=0;i<n;i++)
{
//cout<<i<<' '<<zcheck[i]<<' '<<zCheck[i]<<' '<<(zcheck[i]-zCheck[i]);
//cout<<' '<<absToler+fabs(zCheck[i])/CHECKSUM_DIV2<<endl;
}
for (i=0;i<64;i++)
{
if (fabs(zcheck[i]-zCheck[i])>absToler+fabs(zCheck[i])/CHECKSUM_DIV2)
// zCheck[i]/1e12 suffices for completed jobs, but is too tight for early checkpoint files.
if (fabs(zcheck[i]-zCheck.wrongCheck(i))>absToler+fabs(zCheck[i])/CHECKSUM_DIV2)
header.tolRatio=PT_ZCHECK_FAIL;
else // file was written by 0.5.1 or before, which had a checksum bug
header.flags=header.flags|CHECKSUM_BUG;
else
;
}
}
if (header.tolRatio>0 && header.tolerance>0)
for (i=0;i<header.numGroups;i++)
{
switch (readleshort(ptinFile))
{
case GRP_CONTOUR:
j=readleshort(ptinFile); // Length of label is 16 bytes (two doubles)
if (j!=16)
header.tolRatio=PT_CONTOUR_ERROR;
conterval=readledouble(ptinFile);
contoler=readledouble(ptinFile);
ci.setIntervalRatios(conterval,1,0);
ci.setRelativeTolerance(contoler);
if (readleshort(ptinFile)!=GRPTYPE_POLY)
header.tolRatio=PT_CONTOUR_ERROR;
nContours=readleint(ptinFile);
net.contours[ci].clear();
for (j=0;header.tolRatio>0 && j<nContours;j++)
{
try
{
ctour.read(ptinFile);
}
catch (...)
{
header.tolRatio=PT_CONTOUR_ERROR;
}
concheck=readleint(ptinFile);
if (abs(foldangle(concheck-ctour.checksum()))>5)
header.tolRatio=PT_CONTOUR_ERROR;
net.contours[ci].push_back(ctour);
}
break;
case GRP_BOUNDARY:
j=readleshort(ptinFile); // Length of label is 0 bytes (no label)
if (j!=0)
header.tolRatio=PT_CONTOUR_ERROR;
if (readleshort(ptinFile)!=GRPTYPE_POLY)
header.tolRatio=PT_CONTOUR_ERROR;
nContours=readleint(ptinFile);
for (j=0;header.tolRatio>0 && j<nContours;j++)
{
try
{
net.boundary.read(ptinFile);
}
catch (...)
{
header.tolRatio=PT_CONTOUR_ERROR;
}
concheck=readleint(ptinFile);
if (abs(foldangle(concheck-net.boundary.checksum()))>5)
header.tolRatio=PT_CONTOUR_ERROR;
}
break;
default:
header.tolRatio=PT_UNKNOWN_GROUP;
}
}
if (header.tolRatio>0 && header.tolerance>0)
{
setMutexArea(pairwisesum(areas));
net.makeEdges();
for (i=0;i<cloud.size();i++)
{
tri=tri->findt(cloud[i]);
if (!tri)
{
cerr<<"Can't happen: No triangle found for dot\n";
tri=&net.triangles[0];
}
else
tri->dots.push_back(cloud[i]);
}