2
0

VTKLoader.js 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210
  1. /**
  2. * @author Sebastien Valette [email protected]
  3. */
  4. THREE.VTKLoader = function ( showStatus ) {
  5. THREE.Loader.call( this, showStatus );
  6. };
  7. THREE.VTKLoader.prototype = new THREE.Loader();
  8. THREE.VTKLoader.prototype.constructor = THREE.VTKLoader;
  9. THREE.VTKLoader.prototype.supr = THREE.Loader.prototype;
  10. THREE.VTKLoader.prototype.load = function( url, callback) {
  11. this.onLoadStart();
  12. function parseGeometry(text){
  13. var geometry=new THREE.Geometry();
  14. var lines=text.split("\n");
  15. function v( x, y, z ) {
  16. geometry.vertices.push( new THREE.Vector3( x, y, z ) );
  17. }
  18. function f3( a, b, c ) {
  19. geometry.faces.push( new THREE.Face3( a, b, c ) );
  20. }
  21. var lineIndex=0;
  22. var line=lines[0].split(" ");
  23. var lineLength=line.length;
  24. var columnIndex=-1;
  25. function readNextString ()
  26. {
  27. while (1)
  28. {
  29. var nextWord=line[columnIndex];
  30. columnIndex++;
  31. if (columnIndex==lineLength)
  32. {
  33. lineIndex++;
  34. columnIndex=0;
  35. if (lineIndex>lines.length)
  36. return ("");
  37. line=lines[lineIndex].split(" ");
  38. lineLength=line.length;
  39. }
  40. if (nextWord!=null)
  41. if (nextWord.length>0)
  42. return (nextWord);
  43. }
  44. }
  45. // read point data
  46. var found=false;
  47. while (!found)
  48. {
  49. var readString=readNextString();
  50. switch (readString.toUpperCase())
  51. {
  52. case "POINTS":
  53. found=true;
  54. break;
  55. case "":
  56. alert ("error while reading "+url+" : \n");
  57. return;
  58. default:
  59. }
  60. }
  61. var newIndex;
  62. var new2old;
  63. var numberOfPoints=parseInt(readNextString());
  64. if (numberOfPoints>5000000)
  65. {
  66. alert ("mesh is too big : "+numberOfPoints+" vertices");
  67. return;
  68. }
  69. var coord=[0,0,0];
  70. var index2=0;
  71. var number;
  72. var coordIndex;
  73. for (var j=0;j!=numberOfPoints;j++)
  74. {
  75. for (coordIndex=0;coordIndex<3;coordIndex++)
  76. {
  77. do
  78. {
  79. number=parseFloat(line[columnIndex]);
  80. columnIndex++;
  81. if (columnIndex==lineLength)
  82. {
  83. lineIndex++;
  84. columnIndex=0;
  85. if (lineIndex>lines.length)
  86. {
  87. alert ("error while reading "+url+" : \n");
  88. return;
  89. }
  90. line=lines[lineIndex].split(" ");
  91. lineLength=line.length;
  92. }
  93. } while (isNaN(number))
  94. coord[coordIndex]=number;
  95. }
  96. v(coord[0],coord[1],coord[2]);
  97. }
  98. found=false;
  99. while (!found)
  100. {
  101. var readString=readNextString();
  102. switch (readString)
  103. {
  104. case "POLYGONS":
  105. found=true;
  106. break;
  107. case "":
  108. alert ("error while reading "+url+" : \n");
  109. return;
  110. default:
  111. }
  112. }
  113. var numberOfPolygons=parseInt(readNextString());
  114. var numberOfpolygonElements=parseInt(readNextString());
  115. index2=0;
  116. var connectivity=[];
  117. for (var p=0;p!=numberOfpolygonElements;p++)
  118. {
  119. do
  120. {
  121. number=parseInt(line[columnIndex]);
  122. columnIndex++;
  123. if (columnIndex==lineLength)
  124. {
  125. lineIndex++;
  126. columnIndex=0;
  127. if (lineIndex>lines.length)
  128. {
  129. alert ("error while reading "+url+" : \n");
  130. return;
  131. }
  132. line=lines[lineIndex].split(" ");
  133. lineLength=line.length;
  134. }
  135. } while (isNaN(number))
  136. connectivity[index2]=number;
  137. index2++;
  138. if (index2==connectivity[0]+1)
  139. {
  140. var triangle=[0,0,0];
  141. index2=0;
  142. var numberOfTrianglesInCell=connectivity[0]-2;
  143. var vertex1=triangle[0]=connectivity[1];
  144. for (var i=0;i<numberOfTrianglesInCell;i++)
  145. {
  146. var vertex2=connectivity[i+2];
  147. var vertex3=triangle[2]=connectivity[i+3];
  148. f3(vertex1,vertex2,vertex3);
  149. }
  150. }
  151. }
  152. geometry.computeCentroids();
  153. geometry.computeFaceNormals();
  154. geometry.computeVertexNormals();
  155. geometry.computeBoundingSphere();
  156. return (geometry);
  157. }
  158. var xmlhttp=new XMLHttpRequest();
  159. xmlhttp.open("GET",url,true);
  160. function handler()
  161. {
  162. if(xmlhttp.readyState == 4)
  163. {
  164. if (xmlhttp.status!=200)
  165. {
  166. alert("Could not read file "+url+": error"+xmlhttp.status);
  167. return;
  168. }
  169. var myGeometry=parseGeometry(xmlhttp.responseText);
  170. callback(myGeometry);
  171. }
  172. }
  173. xmlhttp.onreadystatechange=handler;
  174. xmlhttp.send();
  175. };