VTKLoader.js 27 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189
  1. /**
  2. * @author mrdoob / http://mrdoob.com/
  3. * @author Alex Pletzer
  4. *
  5. * Updated on 22.03.2017
  6. * VTK header is now parsed and used to extract all the compressed data
  7. * @author Andrii Iudin https://github.com/andreyyudin
  8. * @author Paul Kibet Korir https://github.com/polarise
  9. * @author Sriram Somasundharam https://github.com/raamssundar
  10. */
  11. import {
  12. BufferAttribute,
  13. BufferGeometry,
  14. FileLoader,
  15. Float32BufferAttribute,
  16. Loader,
  17. LoaderUtils
  18. } from "../../../build/three.module.js";
  19. import { Zlib } from "../libs/inflate.module.min.js";
  20. var VTKLoader = function ( manager ) {
  21. Loader.call( this, manager );
  22. };
  23. VTKLoader.prototype = Object.assign( Object.create( Loader.prototype ), {
  24. constructor: VTKLoader,
  25. load: function ( url, onLoad, onProgress, onError ) {
  26. var scope = this;
  27. var loader = new FileLoader( scope.manager );
  28. loader.setPath( scope.path );
  29. loader.setResponseType( 'arraybuffer' );
  30. loader.load( url, function ( text ) {
  31. onLoad( scope.parse( text ) );
  32. }, onProgress, onError );
  33. },
  34. parse: function ( data ) {
  35. function parseASCII( data ) {
  36. // connectivity of the triangles
  37. var indices = [];
  38. // triangles vertices
  39. var positions = [];
  40. // red, green, blue colors in the range 0 to 1
  41. var colors = [];
  42. // normal vector, one per vertex
  43. var normals = [];
  44. var result;
  45. var patWord = /^[^0-9.\s-]+/;
  46. // pattern for reading vertices, 3 floats or integers
  47. var pat3Floats = /(\-?\d+\.?[\d\-\+e]*)\s+(\-?\d+\.?[\d\-\+e]*)\s+(\-?\d+\.?[\d\-\+e]*)/g;
  48. // pattern for connectivity, an integer followed by any number of ints
  49. // the first integer is the number of polygon nodes
  50. var patConnectivity = /^(\d+)\s+([\s\d]*)/;
  51. // indicates start of vertex data section
  52. var patPOINTS = /^POINTS /;
  53. // indicates start of polygon connectivity section
  54. var patPOLYGONS = /^POLYGONS /;
  55. // indicates start of triangle strips section
  56. var patTRIANGLE_STRIPS = /^TRIANGLE_STRIPS /;
  57. // POINT_DATA number_of_values
  58. var patPOINT_DATA = /^POINT_DATA[ ]+(\d+)/;
  59. // CELL_DATA number_of_polys
  60. var patCELL_DATA = /^CELL_DATA[ ]+(\d+)/;
  61. // Start of color section
  62. var patCOLOR_SCALARS = /^COLOR_SCALARS[ ]+(\w+)[ ]+3/;
  63. // NORMALS Normals float
  64. var patNORMALS = /^NORMALS[ ]+(\w+)[ ]+(\w+)/;
  65. var inPointsSection = false;
  66. var inPolygonsSection = false;
  67. var inTriangleStripSection = false;
  68. var inPointDataSection = false;
  69. var inCellDataSection = false;
  70. var inColorSection = false;
  71. var inNormalsSection = false;
  72. var lines = data.split( '\n' );
  73. for ( var i in lines ) {
  74. var line = lines[ i ].trim();
  75. if ( line.indexOf( 'DATASET' ) === 0 ) {
  76. var dataset = line.split( ' ' )[ 1 ];
  77. if ( dataset !== 'POLYDATA' ) throw new Error( 'Unsupported DATASET type: ' + dataset );
  78. } else if ( inPointsSection ) {
  79. // get the vertices
  80. while ( ( result = pat3Floats.exec( line ) ) !== null ) {
  81. if ( patWord.exec( line ) !== null ) break;
  82. var x = parseFloat( result[ 1 ] );
  83. var y = parseFloat( result[ 2 ] );
  84. var z = parseFloat( result[ 3 ] );
  85. positions.push( x, y, z );
  86. }
  87. } else if ( inPolygonsSection ) {
  88. if ( ( result = patConnectivity.exec( line ) ) !== null ) {
  89. // numVertices i0 i1 i2 ...
  90. var numVertices = parseInt( result[ 1 ] );
  91. var inds = result[ 2 ].split( /\s+/ );
  92. if ( numVertices >= 3 ) {
  93. var i0 = parseInt( inds[ 0 ] );
  94. var i1, i2;
  95. var k = 1;
  96. // split the polygon in numVertices - 2 triangles
  97. for ( var j = 0; j < numVertices - 2; ++ j ) {
  98. i1 = parseInt( inds[ k ] );
  99. i2 = parseInt( inds[ k + 1 ] );
  100. indices.push( i0, i1, i2 );
  101. k ++;
  102. }
  103. }
  104. }
  105. } else if ( inTriangleStripSection ) {
  106. if ( ( result = patConnectivity.exec( line ) ) !== null ) {
  107. // numVertices i0 i1 i2 ...
  108. var numVertices = parseInt( result[ 1 ] );
  109. var inds = result[ 2 ].split( /\s+/ );
  110. if ( numVertices >= 3 ) {
  111. var i0, i1, i2;
  112. // split the polygon in numVertices - 2 triangles
  113. for ( var j = 0; j < numVertices - 2; j ++ ) {
  114. if ( j % 2 === 1 ) {
  115. i0 = parseInt( inds[ j ] );
  116. i1 = parseInt( inds[ j + 2 ] );
  117. i2 = parseInt( inds[ j + 1 ] );
  118. indices.push( i0, i1, i2 );
  119. } else {
  120. i0 = parseInt( inds[ j ] );
  121. i1 = parseInt( inds[ j + 1 ] );
  122. i2 = parseInt( inds[ j + 2 ] );
  123. indices.push( i0, i1, i2 );
  124. }
  125. }
  126. }
  127. }
  128. } else if ( inPointDataSection || inCellDataSection ) {
  129. if ( inColorSection ) {
  130. // Get the colors
  131. while ( ( result = pat3Floats.exec( line ) ) !== null ) {
  132. if ( patWord.exec( line ) !== null ) break;
  133. var r = parseFloat( result[ 1 ] );
  134. var g = parseFloat( result[ 2 ] );
  135. var b = parseFloat( result[ 3 ] );
  136. colors.push( r, g, b );
  137. }
  138. } else if ( inNormalsSection ) {
  139. // Get the normal vectors
  140. while ( ( result = pat3Floats.exec( line ) ) !== null ) {
  141. if ( patWord.exec( line ) !== null ) break;
  142. var nx = parseFloat( result[ 1 ] );
  143. var ny = parseFloat( result[ 2 ] );
  144. var nz = parseFloat( result[ 3 ] );
  145. normals.push( nx, ny, nz );
  146. }
  147. }
  148. }
  149. if ( patPOLYGONS.exec( line ) !== null ) {
  150. inPolygonsSection = true;
  151. inPointsSection = false;
  152. inTriangleStripSection = false;
  153. } else if ( patPOINTS.exec( line ) !== null ) {
  154. inPolygonsSection = false;
  155. inPointsSection = true;
  156. inTriangleStripSection = false;
  157. } else if ( patTRIANGLE_STRIPS.exec( line ) !== null ) {
  158. inPolygonsSection = false;
  159. inPointsSection = false;
  160. inTriangleStripSection = true;
  161. } else if ( patPOINT_DATA.exec( line ) !== null ) {
  162. inPointDataSection = true;
  163. inPointsSection = false;
  164. inPolygonsSection = false;
  165. inTriangleStripSection = false;
  166. } else if ( patCELL_DATA.exec( line ) !== null ) {
  167. inCellDataSection = true;
  168. inPointsSection = false;
  169. inPolygonsSection = false;
  170. inTriangleStripSection = false;
  171. } else if ( patCOLOR_SCALARS.exec( line ) !== null ) {
  172. inColorSection = true;
  173. inNormalsSection = false;
  174. inPointsSection = false;
  175. inPolygonsSection = false;
  176. inTriangleStripSection = false;
  177. } else if ( patNORMALS.exec( line ) !== null ) {
  178. inNormalsSection = true;
  179. inColorSection = false;
  180. inPointsSection = false;
  181. inPolygonsSection = false;
  182. inTriangleStripSection = false;
  183. }
  184. }
  185. var geometry = new BufferGeometry();
  186. geometry.setIndex( indices );
  187. geometry.setAttribute( 'position', new Float32BufferAttribute( positions, 3 ) );
  188. if ( normals.length === positions.length ) {
  189. geometry.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
  190. }
  191. if ( colors.length !== indices.length ) {
  192. // stagger
  193. if ( colors.length === positions.length ) {
  194. geometry.setAttribute( 'color', new Float32BufferAttribute( colors, 3 ) );
  195. }
  196. } else {
  197. // cell
  198. geometry = geometry.toNonIndexed();
  199. var numTriangles = geometry.attributes.position.count / 3;
  200. if ( colors.length === ( numTriangles * 3 ) ) {
  201. var newColors = [];
  202. for ( var i = 0; i < numTriangles; i ++ ) {
  203. var r = colors[ 3 * i + 0 ];
  204. var g = colors[ 3 * i + 1 ];
  205. var b = colors[ 3 * i + 2 ];
  206. newColors.push( r, g, b );
  207. newColors.push( r, g, b );
  208. newColors.push( r, g, b );
  209. }
  210. geometry.setAttribute( 'color', new Float32BufferAttribute( newColors, 3 ) );
  211. }
  212. }
  213. return geometry;
  214. }
  215. function parseBinary( data ) {
  216. var count, pointIndex, i, numberOfPoints, s;
  217. var buffer = new Uint8Array( data );
  218. var dataView = new DataView( data );
  219. // Points and normals, by default, are empty
  220. var points = [];
  221. var normals = [];
  222. var indices = [];
  223. // Going to make a big array of strings
  224. var vtk = [];
  225. var index = 0;
  226. function findString( buffer, start ) {
  227. var index = start;
  228. var c = buffer[ index ];
  229. var s = [];
  230. while ( c !== 10 ) {
  231. s.push( String.fromCharCode( c ) );
  232. index ++;
  233. c = buffer[ index ];
  234. }
  235. return { start: start,
  236. end: index,
  237. next: index + 1,
  238. parsedString: s.join( '' ) };
  239. }
  240. var state, line;
  241. while ( true ) {
  242. // Get a string
  243. state = findString( buffer, index );
  244. line = state.parsedString;
  245. if ( line.indexOf( 'DATASET' ) === 0 ) {
  246. var dataset = line.split( ' ' )[ 1 ];
  247. if ( dataset !== 'POLYDATA' ) throw new Error( 'Unsupported DATASET type: ' + dataset );
  248. } else if ( line.indexOf( 'POINTS' ) === 0 ) {
  249. vtk.push( line );
  250. // Add the points
  251. numberOfPoints = parseInt( line.split( ' ' )[ 1 ], 10 );
  252. // Each point is 3 4-byte floats
  253. count = numberOfPoints * 4 * 3;
  254. points = new Float32Array( numberOfPoints * 3 );
  255. pointIndex = state.next;
  256. for ( i = 0; i < numberOfPoints; i ++ ) {
  257. points[ 3 * i ] = dataView.getFloat32( pointIndex, false );
  258. points[ 3 * i + 1 ] = dataView.getFloat32( pointIndex + 4, false );
  259. points[ 3 * i + 2 ] = dataView.getFloat32( pointIndex + 8, false );
  260. pointIndex = pointIndex + 12;
  261. }
  262. // increment our next pointer
  263. state.next = state.next + count + 1;
  264. } else if ( line.indexOf( 'TRIANGLE_STRIPS' ) === 0 ) {
  265. var numberOfStrips = parseInt( line.split( ' ' )[ 1 ], 10 );
  266. var size = parseInt( line.split( ' ' )[ 2 ], 10 );
  267. // 4 byte integers
  268. count = size * 4;
  269. indices = new Uint32Array( 3 * size - 9 * numberOfStrips );
  270. var indicesIndex = 0;
  271. pointIndex = state.next;
  272. for ( i = 0; i < numberOfStrips; i ++ ) {
  273. // For each strip, read the first value, then record that many more points
  274. var indexCount = dataView.getInt32( pointIndex, false );
  275. var strip = [];
  276. pointIndex += 4;
  277. for ( s = 0; s < indexCount; s ++ ) {
  278. strip.push( dataView.getInt32( pointIndex, false ) );
  279. pointIndex += 4;
  280. }
  281. // retrieves the n-2 triangles from the triangle strip
  282. for ( var j = 0; j < indexCount - 2; j ++ ) {
  283. if ( j % 2 ) {
  284. indices[ indicesIndex ++ ] = strip[ j ];
  285. indices[ indicesIndex ++ ] = strip[ j + 2 ];
  286. indices[ indicesIndex ++ ] = strip[ j + 1 ];
  287. } else {
  288. indices[ indicesIndex ++ ] = strip[ j ];
  289. indices[ indicesIndex ++ ] = strip[ j + 1 ];
  290. indices[ indicesIndex ++ ] = strip[ j + 2 ];
  291. }
  292. }
  293. }
  294. // increment our next pointer
  295. state.next = state.next + count + 1;
  296. } else if ( line.indexOf( 'POLYGONS' ) === 0 ) {
  297. var numberOfStrips = parseInt( line.split( ' ' )[ 1 ], 10 );
  298. var size = parseInt( line.split( ' ' )[ 2 ], 10 );
  299. // 4 byte integers
  300. count = size * 4;
  301. indices = new Uint32Array( 3 * size - 9 * numberOfStrips );
  302. var indicesIndex = 0;
  303. pointIndex = state.next;
  304. for ( i = 0; i < numberOfStrips; i ++ ) {
  305. // For each strip, read the first value, then record that many more points
  306. var indexCount = dataView.getInt32( pointIndex, false );
  307. var strip = [];
  308. pointIndex += 4;
  309. for ( s = 0; s < indexCount; s ++ ) {
  310. strip.push( dataView.getInt32( pointIndex, false ) );
  311. pointIndex += 4;
  312. }
  313. // divide the polygon in n-2 triangle
  314. for ( var j = 1; j < indexCount - 1; j ++ ) {
  315. indices[ indicesIndex ++ ] = strip[ 0 ];
  316. indices[ indicesIndex ++ ] = strip[ j ];
  317. indices[ indicesIndex ++ ] = strip[ j + 1 ];
  318. }
  319. }
  320. // increment our next pointer
  321. state.next = state.next + count + 1;
  322. } else if ( line.indexOf( 'POINT_DATA' ) === 0 ) {
  323. numberOfPoints = parseInt( line.split( ' ' )[ 1 ], 10 );
  324. // Grab the next line
  325. state = findString( buffer, state.next );
  326. // Now grab the binary data
  327. count = numberOfPoints * 4 * 3;
  328. normals = new Float32Array( numberOfPoints * 3 );
  329. pointIndex = state.next;
  330. for ( i = 0; i < numberOfPoints; i ++ ) {
  331. normals[ 3 * i ] = dataView.getFloat32( pointIndex, false );
  332. normals[ 3 * i + 1 ] = dataView.getFloat32( pointIndex + 4, false );
  333. normals[ 3 * i + 2 ] = dataView.getFloat32( pointIndex + 8, false );
  334. pointIndex += 12;
  335. }
  336. // Increment past our data
  337. state.next = state.next + count;
  338. }
  339. // Increment index
  340. index = state.next;
  341. if ( index >= buffer.byteLength ) {
  342. break;
  343. }
  344. }
  345. var geometry = new BufferGeometry();
  346. geometry.setIndex( new BufferAttribute( indices, 1 ) );
  347. geometry.setAttribute( 'position', new BufferAttribute( points, 3 ) );
  348. if ( normals.length === points.length ) {
  349. geometry.setAttribute( 'normal', new BufferAttribute( normals, 3 ) );
  350. }
  351. return geometry;
  352. }
  353. function Float32Concat( first, second ) {
  354. var firstLength = first.length, result = new Float32Array( firstLength + second.length );
  355. result.set( first );
  356. result.set( second, firstLength );
  357. return result;
  358. }
  359. function Int32Concat( first, second ) {
  360. var firstLength = first.length, result = new Int32Array( firstLength + second.length );
  361. result.set( first );
  362. result.set( second, firstLength );
  363. return result;
  364. }
  365. function parseXML( stringFile ) {
  366. // Changes XML to JSON, based on https://davidwalsh.name/convert-xml-json
  367. function xmlToJson( xml ) {
  368. // Create the return object
  369. var obj = {};
  370. if ( xml.nodeType === 1 ) { // element
  371. // do attributes
  372. if ( xml.attributes ) {
  373. if ( xml.attributes.length > 0 ) {
  374. obj[ 'attributes' ] = {};
  375. for ( var j = 0; j < xml.attributes.length; j ++ ) {
  376. var attribute = xml.attributes.item( j );
  377. obj[ 'attributes' ][ attribute.nodeName ] = attribute.nodeValue.trim();
  378. }
  379. }
  380. }
  381. } else if ( xml.nodeType === 3 ) { // text
  382. obj = xml.nodeValue.trim();
  383. }
  384. // do children
  385. if ( xml.hasChildNodes() ) {
  386. for ( var i = 0; i < xml.childNodes.length; i ++ ) {
  387. var item = xml.childNodes.item( i );
  388. var nodeName = item.nodeName;
  389. if ( typeof obj[ nodeName ] === 'undefined' ) {
  390. var tmp = xmlToJson( item );
  391. if ( tmp !== '' ) obj[ nodeName ] = tmp;
  392. } else {
  393. if ( typeof obj[ nodeName ].push === 'undefined' ) {
  394. var old = obj[ nodeName ];
  395. obj[ nodeName ] = [ old ];
  396. }
  397. var tmp = xmlToJson( item );
  398. if ( tmp !== '' ) obj[ nodeName ].push( tmp );
  399. }
  400. }
  401. }
  402. return obj;
  403. }
  404. // Taken from Base64-js
  405. function Base64toByteArray( b64 ) {
  406. var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array;
  407. var i;
  408. var lookup = [];
  409. var revLookup = [];
  410. var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
  411. var len = code.length;
  412. for ( i = 0; i < len; i ++ ) {
  413. lookup[ i ] = code[ i ];
  414. }
  415. for ( i = 0; i < len; ++ i ) {
  416. revLookup[ code.charCodeAt( i ) ] = i;
  417. }
  418. revLookup[ '-'.charCodeAt( 0 ) ] = 62;
  419. revLookup[ '_'.charCodeAt( 0 ) ] = 63;
  420. var j, l, tmp, placeHolders, arr;
  421. var len = b64.length;
  422. if ( len % 4 > 0 ) {
  423. throw new Error( 'Invalid string. Length must be a multiple of 4' );
  424. }
  425. placeHolders = b64[ len - 2 ] === '=' ? 2 : b64[ len - 1 ] === '=' ? 1 : 0;
  426. arr = new Arr( len * 3 / 4 - placeHolders );
  427. l = placeHolders > 0 ? len - 4 : len;
  428. var L = 0;
  429. for ( i = 0, j = 0; i < l; i += 4, j += 3 ) {
  430. tmp = ( revLookup[ b64.charCodeAt( i ) ] << 18 ) | ( revLookup[ b64.charCodeAt( i + 1 ) ] << 12 ) | ( revLookup[ b64.charCodeAt( i + 2 ) ] << 6 ) | revLookup[ b64.charCodeAt( i + 3 ) ];
  431. arr[ L ++ ] = ( tmp & 0xFF0000 ) >> 16;
  432. arr[ L ++ ] = ( tmp & 0xFF00 ) >> 8;
  433. arr[ L ++ ] = tmp & 0xFF;
  434. }
  435. if ( placeHolders === 2 ) {
  436. tmp = ( revLookup[ b64.charCodeAt( i ) ] << 2 ) | ( revLookup[ b64.charCodeAt( i + 1 ) ] >> 4 );
  437. arr[ L ++ ] = tmp & 0xFF;
  438. } else if ( placeHolders === 1 ) {
  439. tmp = ( revLookup[ b64.charCodeAt( i ) ] << 10 ) | ( revLookup[ b64.charCodeAt( i + 1 ) ] << 4 ) | ( revLookup[ b64.charCodeAt( i + 2 ) ] >> 2 );
  440. arr[ L ++ ] = ( tmp >> 8 ) & 0xFF;
  441. arr[ L ++ ] = tmp & 0xFF;
  442. }
  443. return arr;
  444. }
  445. function parseDataArray( ele, compressed ) {
  446. var numBytes = 0;
  447. if ( json.attributes.header_type === 'UInt64' ) {
  448. numBytes = 8;
  449. } else if ( json.attributes.header_type === 'UInt32' ) {
  450. numBytes = 4;
  451. }
  452. // Check the format
  453. if ( ele.attributes.format === 'binary' && compressed ) {
  454. var rawData, content, byteData, blocks, cSizeStart, headerSize, padding, dataOffsets, currentOffset;
  455. if ( ele.attributes.type === 'Float32' ) {
  456. var txt = new Float32Array( );
  457. } else if ( ele.attributes.type === 'Int64' ) {
  458. var txt = new Int32Array( );
  459. }
  460. // VTP data with the header has the following structure:
  461. // [#blocks][#u-size][#p-size][#c-size-1][#c-size-2]...[#c-size-#blocks][DATA]
  462. //
  463. // 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:
  464. // [#blocks] = Number of blocks
  465. // [#u-size] = Block size before compression
  466. // [#p-size] = Size of last partial block (zero if it not needed)
  467. // [#c-size-i] = Size in bytes of block i after compression
  468. //
  469. // 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
  470. // computed by summing the compressed block sizes from preceding blocks according to the header.
  471. rawData = ele[ '#text' ];
  472. byteData = Base64toByteArray( rawData );
  473. blocks = byteData[ 0 ];
  474. for ( var i = 1; i < numBytes - 1; i ++ ) {
  475. blocks = blocks | ( byteData[ i ] << ( i * numBytes ) );
  476. }
  477. headerSize = ( blocks + 3 ) * numBytes;
  478. padding = ( ( headerSize % 3 ) > 0 ) ? 3 - ( headerSize % 3 ) : 0;
  479. headerSize = headerSize + padding;
  480. dataOffsets = [];
  481. currentOffset = headerSize;
  482. dataOffsets.push( currentOffset );
  483. // Get the blocks sizes after the compression.
  484. // There are three blocks before c-size-i, so we skip 3*numBytes
  485. cSizeStart = 3 * numBytes;
  486. for ( var i = 0; i < blocks; i ++ ) {
  487. var currentBlockSize = byteData[ i * numBytes + cSizeStart ];
  488. for ( var j = 1; j < numBytes - 1; j ++ ) {
  489. // Each data point consists of 8 bytes regardless of the header type
  490. currentBlockSize = currentBlockSize | ( byteData[ i * numBytes + cSizeStart + j ] << ( j * 8 ) );
  491. }
  492. currentOffset = currentOffset + currentBlockSize;
  493. dataOffsets.push( currentOffset );
  494. }
  495. for ( var i = 0; i < dataOffsets.length - 1; i ++ ) {
  496. var inflate = new Zlib.Inflate( byteData.slice( dataOffsets[ i ], dataOffsets[ i + 1 ] ), { resize: true, verify: true } ); // eslint-disable-line no-undef
  497. content = inflate.decompress();
  498. content = content.buffer;
  499. if ( ele.attributes.type === 'Float32' ) {
  500. content = new Float32Array( content );
  501. txt = Float32Concat( txt, content );
  502. } else if ( ele.attributes.type === 'Int64' ) {
  503. content = new Int32Array( content );
  504. txt = Int32Concat( txt, content );
  505. }
  506. }
  507. delete ele[ '#text' ];
  508. if ( ele.attributes.type === 'Int64' ) {
  509. if ( ele.attributes.format === 'binary' ) {
  510. txt = txt.filter( function ( el, idx ) {
  511. if ( idx % 2 !== 1 ) return true;
  512. } );
  513. }
  514. }
  515. } else {
  516. if ( ele.attributes.format === 'binary' && ! compressed ) {
  517. var content = Base64toByteArray( ele[ '#text' ] );
  518. // VTP data for the uncompressed case has the following structure:
  519. // [#bytes][DATA]
  520. // where "[#bytes]" is an integer value specifying the number of bytes in the block of data following it.
  521. content = content.slice( numBytes ).buffer;
  522. } else {
  523. if ( ele[ '#text' ] ) {
  524. var content = ele[ '#text' ].split( /\s+/ ).filter( function ( el ) {
  525. if ( el !== '' ) return el;
  526. } );
  527. } else {
  528. var content = new Int32Array( 0 ).buffer;
  529. }
  530. }
  531. delete ele[ '#text' ];
  532. // Get the content and optimize it
  533. if ( ele.attributes.type === 'Float32' ) {
  534. var txt = new Float32Array( content );
  535. } else if ( ele.attributes.type === 'Int32' ) {
  536. var txt = new Int32Array( content );
  537. } else if ( ele.attributes.type === 'Int64' ) {
  538. var txt = new Int32Array( content );
  539. if ( ele.attributes.format === 'binary' ) {
  540. txt = txt.filter( function ( el, idx ) {
  541. if ( idx % 2 !== 1 ) return true;
  542. } );
  543. }
  544. }
  545. } // endif ( ele.attributes.format === 'binary' && compressed )
  546. return txt;
  547. }
  548. // Main part
  549. // Get Dom
  550. var dom = null;
  551. if ( window.DOMParser ) {
  552. try {
  553. dom = ( new DOMParser() ).parseFromString( stringFile, 'text/xml' );
  554. } catch ( e ) {
  555. dom = null;
  556. }
  557. } else if ( window.ActiveXObject ) {
  558. try {
  559. dom = new ActiveXObject( 'Microsoft.XMLDOM' ); // eslint-disable-line no-undef
  560. dom.async = false;
  561. if ( ! dom.loadXML( /* xml */ ) ) {
  562. throw new Error( dom.parseError.reason + dom.parseError.srcText );
  563. }
  564. } catch ( e ) {
  565. dom = null;
  566. }
  567. } else {
  568. throw new Error( 'Cannot parse xml string!' );
  569. }
  570. // Get the doc
  571. var doc = dom.documentElement;
  572. // Convert to json
  573. var json = xmlToJson( doc );
  574. var points = [];
  575. var normals = [];
  576. var indices = [];
  577. if ( json.PolyData ) {
  578. var piece = json.PolyData.Piece;
  579. var compressed = json.attributes.hasOwnProperty( 'compressor' );
  580. // Can be optimized
  581. // Loop through the sections
  582. var sections = [ 'PointData', 'Points', 'Strips', 'Polys' ];// +['CellData', 'Verts', 'Lines'];
  583. var sectionIndex = 0, numberOfSections = sections.length;
  584. while ( sectionIndex < numberOfSections ) {
  585. var section = piece[ sections[ sectionIndex ] ];
  586. // If it has a DataArray in it
  587. if ( section && section.DataArray ) {
  588. // Depending on the number of DataArrays
  589. if ( Object.prototype.toString.call( section.DataArray ) === '[object Array]' ) {
  590. var arr = section.DataArray;
  591. } else {
  592. var arr = [ section.DataArray ];
  593. }
  594. var dataArrayIndex = 0, numberOfDataArrays = arr.length;
  595. while ( dataArrayIndex < numberOfDataArrays ) {
  596. // Parse the DataArray
  597. if ( ( '#text' in arr[ dataArrayIndex ] ) && ( arr[ dataArrayIndex ][ '#text' ].length > 0 ) ) {
  598. arr[ dataArrayIndex ].text = parseDataArray( arr[ dataArrayIndex ], compressed );
  599. }
  600. dataArrayIndex ++;
  601. }
  602. switch ( sections[ sectionIndex ] ) {
  603. // if iti is point data
  604. case 'PointData':
  605. var numberOfPoints = parseInt( piece.attributes.NumberOfPoints );
  606. var normalsName = section.attributes.Normals;
  607. if ( numberOfPoints > 0 ) {
  608. for ( var i = 0, len = arr.length; i < len; i ++ ) {
  609. if ( normalsName === arr[ i ].attributes.Name ) {
  610. var components = arr[ i ].attributes.NumberOfComponents;
  611. normals = new Float32Array( numberOfPoints * components );
  612. normals.set( arr[ i ].text, 0 );
  613. }
  614. }
  615. }
  616. break;
  617. // if it is points
  618. case 'Points':
  619. var numberOfPoints = parseInt( piece.attributes.NumberOfPoints );
  620. if ( numberOfPoints > 0 ) {
  621. var components = section.DataArray.attributes.NumberOfComponents;
  622. points = new Float32Array( numberOfPoints * components );
  623. points.set( section.DataArray.text, 0 );
  624. }
  625. break;
  626. // if it is strips
  627. case 'Strips':
  628. var numberOfStrips = parseInt( piece.attributes.NumberOfStrips );
  629. if ( numberOfStrips > 0 ) {
  630. var connectivity = new Int32Array( section.DataArray[ 0 ].text.length );
  631. var offset = new Int32Array( section.DataArray[ 1 ].text.length );
  632. connectivity.set( section.DataArray[ 0 ].text, 0 );
  633. offset.set( section.DataArray[ 1 ].text, 0 );
  634. var size = numberOfStrips + connectivity.length;
  635. indices = new Uint32Array( 3 * size - 9 * numberOfStrips );
  636. var indicesIndex = 0;
  637. for ( var i = 0, len = numberOfStrips; i < len; i ++ ) {
  638. var strip = [];
  639. for ( var s = 0, len1 = offset[ i ], len0 = 0; s < len1 - len0; s ++ ) {
  640. strip.push( connectivity[ s ] );
  641. if ( i > 0 ) len0 = offset[ i - 1 ];
  642. }
  643. for ( var j = 0, len1 = offset[ i ], len0 = 0; j < len1 - len0 - 2; j ++ ) {
  644. if ( j % 2 ) {
  645. indices[ indicesIndex ++ ] = strip[ j ];
  646. indices[ indicesIndex ++ ] = strip[ j + 2 ];
  647. indices[ indicesIndex ++ ] = strip[ j + 1 ];
  648. } else {
  649. indices[ indicesIndex ++ ] = strip[ j ];
  650. indices[ indicesIndex ++ ] = strip[ j + 1 ];
  651. indices[ indicesIndex ++ ] = strip[ j + 2 ];
  652. }
  653. if ( i > 0 ) len0 = offset[ i - 1 ];
  654. }
  655. }
  656. }
  657. break;
  658. // if it is polys
  659. case 'Polys':
  660. var numberOfPolys = parseInt( piece.attributes.NumberOfPolys );
  661. if ( numberOfPolys > 0 ) {
  662. var connectivity = new Int32Array( section.DataArray[ 0 ].text.length );
  663. var offset = new Int32Array( section.DataArray[ 1 ].text.length );
  664. connectivity.set( section.DataArray[ 0 ].text, 0 );
  665. offset.set( section.DataArray[ 1 ].text, 0 );
  666. var size = numberOfPolys + connectivity.length;
  667. indices = new Uint32Array( 3 * size - 9 * numberOfPolys );
  668. var indicesIndex = 0, connectivityIndex = 0;
  669. var i = 0, len = numberOfPolys, len0 = 0;
  670. while ( i < len ) {
  671. var poly = [];
  672. var s = 0, len1 = offset[ i ];
  673. while ( s < len1 - len0 ) {
  674. poly.push( connectivity[ connectivityIndex ++ ] );
  675. s ++;
  676. }
  677. var j = 1;
  678. while ( j < len1 - len0 - 1 ) {
  679. indices[ indicesIndex ++ ] = poly[ 0 ];
  680. indices[ indicesIndex ++ ] = poly[ j ];
  681. indices[ indicesIndex ++ ] = poly[ j + 1 ];
  682. j ++;
  683. }
  684. i ++;
  685. len0 = offset[ i - 1 ];
  686. }
  687. }
  688. break;
  689. default:
  690. break;
  691. }
  692. }
  693. sectionIndex ++;
  694. }
  695. var geometry = new BufferGeometry();
  696. geometry.setIndex( new BufferAttribute( indices, 1 ) );
  697. geometry.setAttribute( 'position', new BufferAttribute( points, 3 ) );
  698. if ( normals.length === points.length ) {
  699. geometry.setAttribute( 'normal', new BufferAttribute( normals, 3 ) );
  700. }
  701. return geometry;
  702. } else {
  703. throw new Error( 'Unsupported DATASET type' );
  704. }
  705. }
  706. function getStringFile( data ) {
  707. var stringFile = '';
  708. var charArray = new Uint8Array( data );
  709. var i = 0;
  710. var len = charArray.length;
  711. while ( len -- ) {
  712. stringFile += String.fromCharCode( charArray[ i ++ ] );
  713. }
  714. return stringFile;
  715. }
  716. // get the 5 first lines of the files to check if there is the key word binary
  717. var meta = LoaderUtils.decodeText( new Uint8Array( data, 0, 250 ) ).split( '\n' );
  718. if ( meta[ 0 ].indexOf( 'xml' ) !== - 1 ) {
  719. return parseXML( getStringFile( data ) );
  720. } else if ( meta[ 2 ].includes( 'ASCII' ) ) {
  721. return parseASCII( getStringFile( data ) );
  722. } else {
  723. return parseBinary( data );
  724. }
  725. }
  726. } );
  727. export { VTKLoader };