VTKLoader.js 27 KB

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