readSTL.cpp 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222
  1. // This file is part of libigl, a simple c++ geometry processing library.
  2. //
  3. // Copyright (C) 2014 Alec Jacobson <alecjacobson@gmail.com>
  4. //
  5. // This Source Code Form is subject to the terms of the Mozilla Public License
  6. // v. 2.0. If a copy of the MPL was not distributed with this file, You can
  7. // obtain one at http://mozilla.org/MPL/2.0/.
  8. #include "readSTL.h"
  9. #include "list_to_matrix.h"
  10. #include <iostream>
  11. template <typename DerivedV, typename DerivedF, typename DerivedN>
  12. IGL_INLINE bool igl::readSTL(
  13. const std::string & filename,
  14. Eigen::PlainObjectBase<DerivedV> & V,
  15. Eigen::PlainObjectBase<DerivedF> & F,
  16. Eigen::PlainObjectBase<DerivedN> & N)
  17. {
  18. using namespace std;
  19. vector<vector<typename DerivedV::Scalar> > vV;
  20. vector<vector<typename DerivedN::Scalar> > vN;
  21. vector<vector<typename DerivedF::Scalar> > vF;
  22. if(!readSTL(filename,vV,vF,vN))
  23. {
  24. return false;
  25. }
  26. if(!list_to_matrix(vV,V))
  27. {
  28. return false;
  29. }
  30. if(!list_to_matrix(vF,F))
  31. {
  32. return false;
  33. }
  34. if(!list_to_matrix(vN,N))
  35. {
  36. return false;
  37. }
  38. return true;
  39. }
  40. template <typename TypeV, typename TypeF, typename TypeN>
  41. IGL_INLINE bool igl::readSTL(
  42. const std::string & filename,
  43. std::vector<std::vector<TypeV> > & V,
  44. std::vector<std::vector<TypeF> > & F,
  45. std::vector<std::vector<TypeN> > & N)
  46. {
  47. using namespace std;
  48. // Should test for ascii
  49. // Open file, and check for error
  50. FILE * stl_file = fopen(filename.c_str(),"r");
  51. if(NULL==stl_file)
  52. {
  53. fprintf(stderr,"IOError: %s could not be opened...\n",
  54. filename.c_str());
  55. return false;
  56. }
  57. V.clear();
  58. F.clear();
  59. N.clear();
  60. #ifndef IGL_LINE_MAX
  61. # define IGL_LINE_MAX 2048
  62. #endif
  63. char solid[IGL_LINE_MAX];
  64. if(fscanf(stl_file,"%s",solid)!=1)
  65. {
  66. // file too short
  67. cerr<<"IOError: "<<filename<<" too short."<<endl;
  68. goto close_false;
  69. }
  70. if(string("solid") == solid)
  71. {
  72. // Eat file name
  73. char name[IGL_LINE_MAX];
  74. if(NULL==fgets(name,IGL_LINE_MAX,stl_file))
  75. {
  76. cerr<<"IOError: "<<filename<<" too short."<<endl;
  77. goto close_false;
  78. }
  79. // ascii
  80. while(true)
  81. {
  82. int ret;
  83. char facet[IGL_LINE_MAX],normal[IGL_LINE_MAX];
  84. vector<TypeN > n(3);
  85. ret = fscanf(stl_file,"%s %s %lg %lg %lg",facet,normal,&n[0],&n[1],&n[2]);
  86. if(string("endsolid") == facet)
  87. {
  88. break;
  89. }
  90. if(ret != 5 || string("facet") != facet || string("normal") != normal)
  91. {
  92. cerr<<"IOError: "<<filename<<" bad format (1)."<<endl;
  93. goto close_false;
  94. }
  95. N.push_back(n);
  96. char outer[IGL_LINE_MAX], loop[IGL_LINE_MAX];
  97. ret = fscanf(stl_file,"%s %s",outer,loop);
  98. if(ret != 2 || string("outer") != outer || string("loop") != loop)
  99. {
  100. cerr<<"IOError: "<<filename<<" bad format (2)."<<endl;
  101. goto close_false;
  102. }
  103. vector<TypeF> f;
  104. while(true)
  105. {
  106. char word[IGL_LINE_MAX];
  107. int ret = fscanf(stl_file,"%s",word);
  108. if(ret == 1 && string("endloop") == word)
  109. {
  110. break;
  111. }else if(ret == 1 && string("vertex") == word)
  112. {
  113. vector<TypeV> v(3);
  114. int ret = fscanf(stl_file,"%lg %lg %lg",&v[0],&v[1],&v[2]);
  115. if(ret != 3)
  116. {
  117. cerr<<"IOError: "<<filename<<" bad format (3)."<<endl;
  118. goto close_false;
  119. }
  120. f.push_back(V.size());
  121. V.push_back(v);
  122. }else
  123. {
  124. cerr<<"IOError: "<<filename<<" bad format (4)."<<endl;
  125. goto close_false;
  126. }
  127. }
  128. F.push_back(f);
  129. char endfacet[IGL_LINE_MAX];
  130. ret = fscanf(stl_file,"%s",endfacet);
  131. if(ret != 1 || string("endfacet") != endfacet)
  132. {
  133. cerr<<"IOError: "<<filename<<" bad format (5)."<<endl;
  134. goto close_false;
  135. }
  136. }
  137. // read endfacet
  138. fclose(stl_file);
  139. goto close_true;
  140. }else
  141. {
  142. // Binary
  143. fclose(stl_file);
  144. stl_file = fopen(filename.c_str(),"rb");
  145. if(NULL==stl_file)
  146. {
  147. fprintf(stderr,"IOError: %s could not be opened...\n",
  148. filename.c_str());
  149. return false;
  150. }
  151. // Read 80 header
  152. char header[80];
  153. if(fread(header,sizeof(char),80,stl_file)!=80)
  154. {
  155. cerr<<"IOError: "<<filename<<" bad format (1)."<<endl;
  156. goto close_false;
  157. }
  158. // Read number of triangles
  159. unsigned int num_tri;
  160. if(fread(&num_tri,sizeof(unsigned int),1,stl_file)!=1)
  161. {
  162. cerr<<"IOError: "<<filename<<" bad format (2)."<<endl;
  163. goto close_false;
  164. }
  165. V.resize(num_tri*3,vector<TypeV >(3,0));
  166. N.resize(num_tri,vector<TypeN >(3,0));
  167. F.resize(num_tri,vector<TypeF >(3,0));
  168. for(int t = 0;t<(int)num_tri;t++)
  169. {
  170. // Read normal
  171. float n[3];
  172. if(fread(n,sizeof(float),3,stl_file)!=3)
  173. {
  174. cerr<<"IOError: "<<filename<<" bad format (3)."<<endl;
  175. goto close_false;
  176. }
  177. // Read each vertex
  178. for(int c = 0;c<3;c++)
  179. {
  180. F[t][c] = 3*t+c;
  181. N[t][c] = n[c];
  182. float v[3];
  183. if(fread(v,sizeof(float),3,stl_file)!=3)
  184. {
  185. cerr<<"IOError: "<<filename<<" bad format (4)."<<endl;
  186. goto close_false;
  187. }
  188. V[3*t+c][0] = v[0];
  189. V[3*t+c][1] = v[1];
  190. V[3*t+c][2] = v[2];
  191. }
  192. // Read attribute size
  193. unsigned short att_count;
  194. if(fread(&att_count,sizeof(unsigned short),1,stl_file)!=1)
  195. {
  196. cerr<<"IOError: "<<filename<<" bad format (5)."<<endl;
  197. goto close_false;
  198. }
  199. }
  200. goto close_true;
  201. }
  202. close_false:
  203. fclose(stl_file);
  204. return false;
  205. close_true:
  206. fclose(stl_file);
  207. return true;
  208. }
  209. #ifdef IGL_STATIC_LIBRARY
  210. // Explicit template specialization
  211. // generated by autoexplicit.sh
  212. template bool igl::readSTL<Eigen::Matrix<double, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, 3, 0, -1, 3>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> >&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> >&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&);
  213. // generated by autoexplicit.sh
  214. template bool igl::readSTL<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&);
  215. #endif