Spaces:
Running
Running
File size: 28,999 Bytes
a28eca3 |
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 |
import {
BufferAttribute,
BufferGeometry,
Color,
FileLoader,
Float32BufferAttribute,
Loader,
SRGBColorSpace
} from 'three';
import * as fflate from '../libs/fflate.module.js';
class VTKLoader extends Loader {
constructor( manager ) {
super( manager );
}
load( url, onLoad, onProgress, onError ) {
const scope = this;
const loader = new FileLoader( scope.manager );
loader.setPath( scope.path );
loader.setResponseType( 'arraybuffer' );
loader.setRequestHeader( scope.requestHeader );
loader.setWithCredentials( scope.withCredentials );
loader.load( url, function ( text ) {
try {
onLoad( scope.parse( text ) );
} catch ( e ) {
if ( onError ) {
onError( e );
} else {
console.error( e );
}
scope.manager.itemError( url );
}
}, onProgress, onError );
}
parse( data ) {
function parseASCII( data ) {
// connectivity of the triangles
const indices = [];
// triangles vertices
const positions = [];
// red, green, blue colors in the range 0 to 1
const colors = [];
// normal vector, one per vertex
const normals = [];
let result;
// pattern for detecting the end of a number sequence
const patWord = /^[^\d.\s-]+/;
// pattern for reading vertices, 3 floats or integers
const pat3Floats = /(\-?\d+\.?[\d\-\+e]*)\s+(\-?\d+\.?[\d\-\+e]*)\s+(\-?\d+\.?[\d\-\+e]*)/g;
// pattern for connectivity, an integer followed by any number of ints
// the first integer is the number of polygon nodes
const patConnectivity = /^(\d+)\s+([\s\d]*)/;
// indicates start of vertex data section
const patPOINTS = /^POINTS /;
// indicates start of polygon connectivity section
const patPOLYGONS = /^POLYGONS /;
// indicates start of triangle strips section
const patTRIANGLE_STRIPS = /^TRIANGLE_STRIPS /;
// POINT_DATA number_of_values
const patPOINT_DATA = /^POINT_DATA[ ]+(\d+)/;
// CELL_DATA number_of_polys
const patCELL_DATA = /^CELL_DATA[ ]+(\d+)/;
// Start of color section
const patCOLOR_SCALARS = /^COLOR_SCALARS[ ]+(\w+)[ ]+3/;
// NORMALS Normals float
const patNORMALS = /^NORMALS[ ]+(\w+)[ ]+(\w+)/;
let inPointsSection = false;
let inPolygonsSection = false;
let inTriangleStripSection = false;
let inPointDataSection = false;
let inCellDataSection = false;
let inColorSection = false;
let inNormalsSection = false;
const color = new Color();
const lines = data.split( '\n' );
for ( const i in lines ) {
const line = lines[ i ].trim();
if ( line.indexOf( 'DATASET' ) === 0 ) {
const dataset = line.split( ' ' )[ 1 ];
if ( dataset !== 'POLYDATA' ) throw new Error( 'Unsupported DATASET type: ' + dataset );
} else if ( inPointsSection ) {
// get the vertices
while ( ( result = pat3Floats.exec( line ) ) !== null ) {
if ( patWord.exec( line ) !== null ) break;
const x = parseFloat( result[ 1 ] );
const y = parseFloat( result[ 2 ] );
const z = parseFloat( result[ 3 ] );
positions.push( x, y, z );
}
} else if ( inPolygonsSection ) {
if ( ( result = patConnectivity.exec( line ) ) !== null ) {
// numVertices i0 i1 i2 ...
const numVertices = parseInt( result[ 1 ] );
const inds = result[ 2 ].split( /\s+/ );
if ( numVertices >= 3 ) {
const i0 = parseInt( inds[ 0 ] );
let k = 1;
// split the polygon in numVertices - 2 triangles
for ( let j = 0; j < numVertices - 2; ++ j ) {
const i1 = parseInt( inds[ k ] );
const i2 = parseInt( inds[ k + 1 ] );
indices.push( i0, i1, i2 );
k ++;
}
}
}
} else if ( inTriangleStripSection ) {
if ( ( result = patConnectivity.exec( line ) ) !== null ) {
// numVertices i0 i1 i2 ...
const numVertices = parseInt( result[ 1 ] );
const inds = result[ 2 ].split( /\s+/ );
if ( numVertices >= 3 ) {
// split the polygon in numVertices - 2 triangles
for ( let j = 0; j < numVertices - 2; j ++ ) {
if ( j % 2 === 1 ) {
const i0 = parseInt( inds[ j ] );
const i1 = parseInt( inds[ j + 2 ] );
const i2 = parseInt( inds[ j + 1 ] );
indices.push( i0, i1, i2 );
} else {
const i0 = parseInt( inds[ j ] );
const i1 = parseInt( inds[ j + 1 ] );
const i2 = parseInt( inds[ j + 2 ] );
indices.push( i0, i1, i2 );
}
}
}
}
} else if ( inPointDataSection || inCellDataSection ) {
if ( inColorSection ) {
// Get the colors
while ( ( result = pat3Floats.exec( line ) ) !== null ) {
if ( patWord.exec( line ) !== null ) break;
const r = parseFloat( result[ 1 ] );
const g = parseFloat( result[ 2 ] );
const b = parseFloat( result[ 3 ] );
color.setRGB( r, g, b, SRGBColorSpace );
colors.push( color.r, color.g, color.b );
}
} else if ( inNormalsSection ) {
// Get the normal vectors
while ( ( result = pat3Floats.exec( line ) ) !== null ) {
if ( patWord.exec( line ) !== null ) break;
const nx = parseFloat( result[ 1 ] );
const ny = parseFloat( result[ 2 ] );
const nz = parseFloat( result[ 3 ] );
normals.push( nx, ny, nz );
}
}
}
if ( patPOLYGONS.exec( line ) !== null ) {
inPolygonsSection = true;
inPointsSection = false;
inTriangleStripSection = false;
} else if ( patPOINTS.exec( line ) !== null ) {
inPolygonsSection = false;
inPointsSection = true;
inTriangleStripSection = false;
} else if ( patTRIANGLE_STRIPS.exec( line ) !== null ) {
inPolygonsSection = false;
inPointsSection = false;
inTriangleStripSection = true;
} else if ( patPOINT_DATA.exec( line ) !== null ) {
inPointDataSection = true;
inPointsSection = false;
inPolygonsSection = false;
inTriangleStripSection = false;
} else if ( patCELL_DATA.exec( line ) !== null ) {
inCellDataSection = true;
inPointsSection = false;
inPolygonsSection = false;
inTriangleStripSection = false;
} else if ( patCOLOR_SCALARS.exec( line ) !== null ) {
inColorSection = true;
inNormalsSection = false;
inPointsSection = false;
inPolygonsSection = false;
inTriangleStripSection = false;
} else if ( patNORMALS.exec( line ) !== null ) {
inNormalsSection = true;
inColorSection = false;
inPointsSection = false;
inPolygonsSection = false;
inTriangleStripSection = false;
}
}
let geometry = new BufferGeometry();
geometry.setIndex( indices );
geometry.setAttribute( 'position', new Float32BufferAttribute( positions, 3 ) );
if ( normals.length === positions.length ) {
geometry.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
}
if ( colors.length !== indices.length ) {
// stagger
if ( colors.length === positions.length ) {
geometry.setAttribute( 'color', new Float32BufferAttribute( colors, 3 ) );
}
} else {
// cell
geometry = geometry.toNonIndexed();
const numTriangles = geometry.attributes.position.count / 3;
if ( colors.length === ( numTriangles * 3 ) ) {
const newColors = [];
for ( let i = 0; i < numTriangles; i ++ ) {
const r = colors[ 3 * i + 0 ];
const g = colors[ 3 * i + 1 ];
const b = colors[ 3 * i + 2 ];
color.setRGB( r, g, b, SRGBColorSpace );
newColors.push( color.r, color.g, color.b );
newColors.push( color.r, color.g, color.b );
newColors.push( color.r, color.g, color.b );
}
geometry.setAttribute( 'color', new Float32BufferAttribute( newColors, 3 ) );
}
}
return geometry;
}
function parseBinary( data ) {
const buffer = new Uint8Array( data );
const dataView = new DataView( data );
// Points and normals, by default, are empty
let points = [];
let normals = [];
let indices = [];
let index = 0;
function findString( buffer, start ) {
let index = start;
let c = buffer[ index ];
const s = [];
while ( c !== 10 ) {
s.push( String.fromCharCode( c ) );
index ++;
c = buffer[ index ];
}
return { start: start,
end: index,
next: index + 1,
parsedString: s.join( '' ) };
}
let state, line;
while ( true ) {
// Get a string
state = findString( buffer, index );
line = state.parsedString;
if ( line.indexOf( 'DATASET' ) === 0 ) {
const dataset = line.split( ' ' )[ 1 ];
if ( dataset !== 'POLYDATA' ) throw new Error( 'Unsupported DATASET type: ' + dataset );
} else if ( line.indexOf( 'POINTS' ) === 0 ) {
// Add the points
const numberOfPoints = parseInt( line.split( ' ' )[ 1 ], 10 );
// Each point is 3 4-byte floats
const count = numberOfPoints * 4 * 3;
points = new Float32Array( numberOfPoints * 3 );
let pointIndex = state.next;
for ( let i = 0; i < numberOfPoints; i ++ ) {
points[ 3 * i ] = dataView.getFloat32( pointIndex, false );
points[ 3 * i + 1 ] = dataView.getFloat32( pointIndex + 4, false );
points[ 3 * i + 2 ] = dataView.getFloat32( pointIndex + 8, false );
pointIndex = pointIndex + 12;
}
// increment our next pointer
state.next = state.next + count + 1;
} else if ( line.indexOf( 'TRIANGLE_STRIPS' ) === 0 ) {
const numberOfStrips = parseInt( line.split( ' ' )[ 1 ], 10 );
const size = parseInt( line.split( ' ' )[ 2 ], 10 );
// 4 byte integers
const count = size * 4;
indices = new Uint32Array( 3 * size - 9 * numberOfStrips );
let indicesIndex = 0;
let pointIndex = state.next;
for ( let i = 0; i < numberOfStrips; i ++ ) {
// For each strip, read the first value, then record that many more points
const indexCount = dataView.getInt32( pointIndex, false );
const strip = [];
pointIndex += 4;
for ( let s = 0; s < indexCount; s ++ ) {
strip.push( dataView.getInt32( pointIndex, false ) );
pointIndex += 4;
}
// retrieves the n-2 triangles from the triangle strip
for ( let j = 0; j < indexCount - 2; j ++ ) {
if ( j % 2 ) {
indices[ indicesIndex ++ ] = strip[ j ];
indices[ indicesIndex ++ ] = strip[ j + 2 ];
indices[ indicesIndex ++ ] = strip[ j + 1 ];
} else {
indices[ indicesIndex ++ ] = strip[ j ];
indices[ indicesIndex ++ ] = strip[ j + 1 ];
indices[ indicesIndex ++ ] = strip[ j + 2 ];
}
}
}
// increment our next pointer
state.next = state.next + count + 1;
} else if ( line.indexOf( 'POLYGONS' ) === 0 ) {
const numberOfStrips = parseInt( line.split( ' ' )[ 1 ], 10 );
const size = parseInt( line.split( ' ' )[ 2 ], 10 );
// 4 byte integers
const count = size * 4;
indices = new Uint32Array( 3 * size - 9 * numberOfStrips );
let indicesIndex = 0;
let pointIndex = state.next;
for ( let i = 0; i < numberOfStrips; i ++ ) {
// For each strip, read the first value, then record that many more points
const indexCount = dataView.getInt32( pointIndex, false );
const strip = [];
pointIndex += 4;
for ( let s = 0; s < indexCount; s ++ ) {
strip.push( dataView.getInt32( pointIndex, false ) );
pointIndex += 4;
}
// divide the polygon in n-2 triangle
for ( let j = 1; j < indexCount - 1; j ++ ) {
indices[ indicesIndex ++ ] = strip[ 0 ];
indices[ indicesIndex ++ ] = strip[ j ];
indices[ indicesIndex ++ ] = strip[ j + 1 ];
}
}
// increment our next pointer
state.next = state.next + count + 1;
} else if ( line.indexOf( 'POINT_DATA' ) === 0 ) {
const numberOfPoints = parseInt( line.split( ' ' )[ 1 ], 10 );
// Grab the next line
state = findString( buffer, state.next );
// Now grab the binary data
const count = numberOfPoints * 4 * 3;
normals = new Float32Array( numberOfPoints * 3 );
let pointIndex = state.next;
for ( let i = 0; i < numberOfPoints; i ++ ) {
normals[ 3 * i ] = dataView.getFloat32( pointIndex, false );
normals[ 3 * i + 1 ] = dataView.getFloat32( pointIndex + 4, false );
normals[ 3 * i + 2 ] = dataView.getFloat32( pointIndex + 8, false );
pointIndex += 12;
}
// Increment past our data
state.next = state.next + count;
}
// Increment index
index = state.next;
if ( index >= buffer.byteLength ) {
break;
}
}
const geometry = new BufferGeometry();
geometry.setIndex( new BufferAttribute( indices, 1 ) );
geometry.setAttribute( 'position', new BufferAttribute( points, 3 ) );
if ( normals.length === points.length ) {
geometry.setAttribute( 'normal', new BufferAttribute( normals, 3 ) );
}
return geometry;
}
function Float32Concat( first, second ) {
const firstLength = first.length, result = new Float32Array( firstLength + second.length );
result.set( first );
result.set( second, firstLength );
return result;
}
function Int32Concat( first, second ) {
const firstLength = first.length, result = new Int32Array( firstLength + second.length );
result.set( first );
result.set( second, firstLength );
return result;
}
function parseXML( stringFile ) {
// Changes XML to JSON, based on https://davidwalsh.name/convert-xml-json
function xmlToJson( xml ) {
// Create the return object
let obj = {};
if ( xml.nodeType === 1 ) { // element
// do attributes
if ( xml.attributes ) {
if ( xml.attributes.length > 0 ) {
obj[ 'attributes' ] = {};
for ( let j = 0; j < xml.attributes.length; j ++ ) {
const attribute = xml.attributes.item( j );
obj[ 'attributes' ][ attribute.nodeName ] = attribute.nodeValue.trim();
}
}
}
} else if ( xml.nodeType === 3 ) { // text
obj = xml.nodeValue.trim();
}
// do children
if ( xml.hasChildNodes() ) {
for ( let i = 0; i < xml.childNodes.length; i ++ ) {
const item = xml.childNodes.item( i );
const nodeName = item.nodeName;
if ( typeof obj[ nodeName ] === 'undefined' ) {
const tmp = xmlToJson( item );
if ( tmp !== '' ) {
if ( Array.isArray( tmp[ '#text' ] ) ) {
tmp[ '#text' ] = tmp[ '#text' ][ 0 ];
}
obj[ nodeName ] = tmp;
}
} else {
if ( typeof obj[ nodeName ].push === 'undefined' ) {
const old = obj[ nodeName ];
obj[ nodeName ] = [ old ];
}
const tmp = xmlToJson( item );
if ( tmp !== '' ) {
if ( Array.isArray( tmp[ '#text' ] ) ) {
tmp[ '#text' ] = tmp[ '#text' ][ 0 ];
}
obj[ nodeName ].push( tmp );
}
}
}
}
return obj;
}
// Taken from Base64-js
function Base64toByteArray( b64 ) {
const Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array;
const revLookup = [];
const code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
for ( let i = 0, l = code.length; i < l; ++ i ) {
revLookup[ code.charCodeAt( i ) ] = i;
}
revLookup[ '-'.charCodeAt( 0 ) ] = 62;
revLookup[ '_'.charCodeAt( 0 ) ] = 63;
const len = b64.length;
if ( len % 4 > 0 ) {
throw new Error( 'Invalid string. Length must be a multiple of 4' );
}
const placeHolders = b64[ len - 2 ] === '=' ? 2 : b64[ len - 1 ] === '=' ? 1 : 0;
const arr = new Arr( len * 3 / 4 - placeHolders );
const l = placeHolders > 0 ? len - 4 : len;
let L = 0;
let i, j;
for ( i = 0, j = 0; i < l; i += 4, j += 3 ) {
const tmp = ( revLookup[ b64.charCodeAt( i ) ] << 18 ) | ( revLookup[ b64.charCodeAt( i + 1 ) ] << 12 ) | ( revLookup[ b64.charCodeAt( i + 2 ) ] << 6 ) | revLookup[ b64.charCodeAt( i + 3 ) ];
arr[ L ++ ] = ( tmp & 0xFF0000 ) >> 16;
arr[ L ++ ] = ( tmp & 0xFF00 ) >> 8;
arr[ L ++ ] = tmp & 0xFF;
}
if ( placeHolders === 2 ) {
const tmp = ( revLookup[ b64.charCodeAt( i ) ] << 2 ) | ( revLookup[ b64.charCodeAt( i + 1 ) ] >> 4 );
arr[ L ++ ] = tmp & 0xFF;
} else if ( placeHolders === 1 ) {
const tmp = ( revLookup[ b64.charCodeAt( i ) ] << 10 ) | ( revLookup[ b64.charCodeAt( i + 1 ) ] << 4 ) | ( revLookup[ b64.charCodeAt( i + 2 ) ] >> 2 );
arr[ L ++ ] = ( tmp >> 8 ) & 0xFF;
arr[ L ++ ] = tmp & 0xFF;
}
return arr;
}
function parseDataArray( ele, compressed ) {
let numBytes = 0;
if ( json.attributes.header_type === 'UInt64' ) {
numBytes = 8;
} else if ( json.attributes.header_type === 'UInt32' ) {
numBytes = 4;
}
let txt, content;
// Check the format
if ( ele.attributes.format === 'binary' && compressed ) {
if ( ele.attributes.type === 'Float32' ) {
txt = new Float32Array( );
} else if ( ele.attributes.type === 'Int32' || ele.attributes.type === 'Int64' ) {
txt = new Int32Array( );
}
// VTP data with the header has the following structure:
// [#blocks][#u-size][#p-size][#c-size-1][#c-size-2]...[#c-size-#blocks][DATA]
//
// Each token is an integer value whose type is specified by "header_type" at the top of the file (UInt32 if no type specified). The token meanings are:
// [#blocks] = Number of blocks
// [#u-size] = Block size before compression
// [#p-size] = Size of last partial block (zero if it not needed)
// [#c-size-i] = Size in bytes of block i after compression
//
// The [DATA] portion stores contiguously every block appended together. The offset from the beginning of the data section to the beginning of a block is
// computed by summing the compressed block sizes from preceding blocks according to the header.
const textNode = ele[ '#text' ];
const rawData = Array.isArray( textNode ) ? textNode[ 0 ] : textNode;
const byteData = Base64toByteArray( rawData );
// Each data point consists of 8 bits regardless of the header type
const dataPointSize = 8;
let blocks = byteData[ 0 ];
for ( let i = 1; i < numBytes - 1; i ++ ) {
blocks = blocks | ( byteData[ i ] << ( i * dataPointSize ) );
}
let headerSize = ( blocks + 3 ) * numBytes;
const padding = ( ( headerSize % 3 ) > 0 ) ? 3 - ( headerSize % 3 ) : 0;
headerSize = headerSize + padding;
const dataOffsets = [];
let currentOffset = headerSize;
dataOffsets.push( currentOffset );
// Get the blocks sizes after the compression.
// There are three blocks before c-size-i, so we skip 3*numBytes
const cSizeStart = 3 * numBytes;
for ( let i = 0; i < blocks; i ++ ) {
let currentBlockSize = byteData[ i * numBytes + cSizeStart ];
for ( let j = 1; j < numBytes - 1; j ++ ) {
currentBlockSize = currentBlockSize | ( byteData[ i * numBytes + cSizeStart + j ] << ( j * dataPointSize ) );
}
currentOffset = currentOffset + currentBlockSize;
dataOffsets.push( currentOffset );
}
for ( let i = 0; i < dataOffsets.length - 1; i ++ ) {
const data = fflate.unzlibSync( byteData.slice( dataOffsets[ i ], dataOffsets[ i + 1 ] ) );
content = data.buffer;
if ( ele.attributes.type === 'Float32' ) {
content = new Float32Array( content );
txt = Float32Concat( txt, content );
} else if ( ele.attributes.type === 'Int32' || ele.attributes.type === 'Int64' ) {
content = new Int32Array( content );
txt = Int32Concat( txt, content );
}
}
delete ele[ '#text' ];
if ( ele.attributes.type === 'Int64' ) {
if ( ele.attributes.format === 'binary' ) {
txt = txt.filter( function ( el, idx ) {
if ( idx % 2 !== 1 ) return true;
} );
}
}
} else {
if ( ele.attributes.format === 'binary' && ! compressed ) {
content = Base64toByteArray( ele[ '#text' ] );
// VTP data for the uncompressed case has the following structure:
// [#bytes][DATA]
// where "[#bytes]" is an integer value specifying the number of bytes in the block of data following it.
content = content.slice( numBytes ).buffer;
} else {
if ( ele[ '#text' ] ) {
content = ele[ '#text' ].split( /\s+/ ).filter( function ( el ) {
if ( el !== '' ) return el;
} );
} else {
content = new Int32Array( 0 ).buffer;
}
}
delete ele[ '#text' ];
// Get the content and optimize it
if ( ele.attributes.type === 'Float32' ) {
txt = new Float32Array( content );
} else if ( ele.attributes.type === 'Int32' ) {
txt = new Int32Array( content );
} else if ( ele.attributes.type === 'Int64' ) {
txt = new Int32Array( content );
if ( ele.attributes.format === 'binary' ) {
txt = txt.filter( function ( el, idx ) {
if ( idx % 2 !== 1 ) return true;
} );
}
}
} // endif ( ele.attributes.format === 'binary' && compressed )
return txt;
}
// Main part
// Get Dom
const dom = new DOMParser().parseFromString( stringFile, 'application/xml' );
// Get the doc
const doc = dom.documentElement;
// Convert to json
const json = xmlToJson( doc );
let points = [];
let normals = [];
let indices = [];
if ( json.AppendedData ) {
const appendedData = json.AppendedData[ '#text' ].slice( 1 );
const piece = json.PolyData.Piece;
const sections = [ 'PointData', 'CellData', 'Points', 'Verts', 'Lines', 'Strips', 'Polys' ];
let sectionIndex = 0;
const offsets = sections.map( s => {
const sect = piece[ s ];
if ( sect && sect.DataArray ) {
const arr = Array.isArray( sect.DataArray ) ? sect.DataArray : [ sect.DataArray ];
return arr.map( a => a.attributes.offset );
}
return [];
} ).flat();
for ( const sect of sections ) {
const section = piece[ sect ];
if ( section && section.DataArray ) {
if ( Array.isArray( section.DataArray ) ) {
for ( const sectionEle of section.DataArray ) {
sectionEle[ '#text' ] = appendedData.slice( offsets[ sectionIndex ], offsets[ sectionIndex + 1 ] );
sectionEle.attributes.format = 'binary';
sectionIndex ++;
}
} else {
section.DataArray[ '#text' ] = appendedData.slice( offsets[ sectionIndex ], offsets[ sectionIndex + 1 ] );
section.DataArray.attributes.format = 'binary';
sectionIndex ++;
}
}
}
}
if ( json.PolyData ) {
const piece = json.PolyData.Piece;
const compressed = json.attributes.hasOwnProperty( 'compressor' );
// Can be optimized
// Loop through the sections
const sections = [ 'PointData', 'Points', 'Strips', 'Polys' ];// +['CellData', 'Verts', 'Lines'];
let sectionIndex = 0;
const numberOfSections = sections.length;
while ( sectionIndex < numberOfSections ) {
const section = piece[ sections[ sectionIndex ] ];
// If it has a DataArray in it
if ( section && section.DataArray ) {
// Depending on the number of DataArrays
let arr;
if ( Array.isArray( section.DataArray ) ) {
arr = section.DataArray;
} else {
arr = [ section.DataArray ];
}
let dataArrayIndex = 0;
const numberOfDataArrays = arr.length;
while ( dataArrayIndex < numberOfDataArrays ) {
// Parse the DataArray
if ( ( '#text' in arr[ dataArrayIndex ] ) && ( arr[ dataArrayIndex ][ '#text' ].length > 0 ) ) {
arr[ dataArrayIndex ].text = parseDataArray( arr[ dataArrayIndex ], compressed );
}
dataArrayIndex ++;
}
switch ( sections[ sectionIndex ] ) {
// if iti is point data
case 'PointData':
{
const numberOfPoints = parseInt( piece.attributes.NumberOfPoints );
const normalsName = section.attributes.Normals;
if ( numberOfPoints > 0 ) {
for ( let i = 0, len = arr.length; i < len; i ++ ) {
if ( normalsName === arr[ i ].attributes.Name ) {
const components = arr[ i ].attributes.NumberOfComponents;
normals = new Float32Array( numberOfPoints * components );
normals.set( arr[ i ].text, 0 );
}
}
}
}
break;
// if it is points
case 'Points':
{
const numberOfPoints = parseInt( piece.attributes.NumberOfPoints );
if ( numberOfPoints > 0 ) {
const components = section.DataArray.attributes.NumberOfComponents;
points = new Float32Array( numberOfPoints * components );
points.set( section.DataArray.text, 0 );
}
}
break;
// if it is strips
case 'Strips':
{
const numberOfStrips = parseInt( piece.attributes.NumberOfStrips );
if ( numberOfStrips > 0 ) {
const connectivity = new Int32Array( section.DataArray[ 0 ].text.length );
const offset = new Int32Array( section.DataArray[ 1 ].text.length );
connectivity.set( section.DataArray[ 0 ].text, 0 );
offset.set( section.DataArray[ 1 ].text, 0 );
const size = numberOfStrips + connectivity.length;
indices = new Uint32Array( 3 * size - 9 * numberOfStrips );
let indicesIndex = 0;
for ( let i = 0, len = numberOfStrips; i < len; i ++ ) {
const strip = [];
for ( let s = 0, len1 = offset[ i ], len0 = 0; s < len1 - len0; s ++ ) {
strip.push( connectivity[ s ] );
if ( i > 0 ) len0 = offset[ i - 1 ];
}
for ( let j = 0, len1 = offset[ i ], len0 = 0; j < len1 - len0 - 2; j ++ ) {
if ( j % 2 ) {
indices[ indicesIndex ++ ] = strip[ j ];
indices[ indicesIndex ++ ] = strip[ j + 2 ];
indices[ indicesIndex ++ ] = strip[ j + 1 ];
} else {
indices[ indicesIndex ++ ] = strip[ j ];
indices[ indicesIndex ++ ] = strip[ j + 1 ];
indices[ indicesIndex ++ ] = strip[ j + 2 ];
}
if ( i > 0 ) len0 = offset[ i - 1 ];
}
}
}
}
break;
// if it is polys
case 'Polys':
{
const numberOfPolys = parseInt( piece.attributes.NumberOfPolys );
if ( numberOfPolys > 0 ) {
const connectivity = new Int32Array( section.DataArray[ 0 ].text.length );
const offset = new Int32Array( section.DataArray[ 1 ].text.length );
connectivity.set( section.DataArray[ 0 ].text, 0 );
offset.set( section.DataArray[ 1 ].text, 0 );
const size = numberOfPolys + connectivity.length;
indices = new Uint32Array( 3 * size - 9 * numberOfPolys );
let indicesIndex = 0, connectivityIndex = 0;
let i = 0, len0 = 0;
const len = numberOfPolys;
while ( i < len ) {
const poly = [];
let s = 0;
const len1 = offset[ i ];
while ( s < len1 - len0 ) {
poly.push( connectivity[ connectivityIndex ++ ] );
s ++;
}
let j = 1;
while ( j < len1 - len0 - 1 ) {
indices[ indicesIndex ++ ] = poly[ 0 ];
indices[ indicesIndex ++ ] = poly[ j ];
indices[ indicesIndex ++ ] = poly[ j + 1 ];
j ++;
}
i ++;
len0 = offset[ i - 1 ];
}
}
}
break;
default:
break;
}
}
sectionIndex ++;
}
const geometry = new BufferGeometry();
geometry.setIndex( new BufferAttribute( indices, 1 ) );
geometry.setAttribute( 'position', new BufferAttribute( points, 3 ) );
if ( normals.length === points.length ) {
geometry.setAttribute( 'normal', new BufferAttribute( normals, 3 ) );
}
return geometry;
} else {
throw new Error( 'Unsupported DATASET type' );
}
}
const textDecoder = new TextDecoder();
// get the 5 first lines of the files to check if there is the key word binary
const meta = textDecoder.decode( new Uint8Array( data, 0, 250 ) ).split( '\n' );
if ( meta[ 0 ].indexOf( 'xml' ) !== - 1 ) {
return parseXML( textDecoder.decode( data ) );
} else if ( meta[ 2 ].includes( 'ASCII' ) ) {
return parseASCII( textDecoder.decode( data ) );
} else {
return parseBinary( data );
}
}
}
export { VTKLoader };
|