VTKLoader.js 27 KB

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