mesh_boolean.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457
  1. // This file is part of libigl, a simple c++ geometry processing library.
  2. //
  3. // Copyright (C) 2015 Alec Jacobson <[email protected]>
  4. // Qingnan Zhou <[email protected]>
  5. //
  6. // This Source Code Form is subject to the terms of the Mozilla Public License
  7. // v. 2.0. If a copy of the MPL was not distributed with this file, You can
  8. // obtain one at http://mozilla.org/MPL/2.0/.
  9. //
  10. #include "mesh_boolean.h"
  11. #include "assign_scalar.h"
  12. #include "extract_cells.h"
  13. #include "mesh_boolean_type_to_funcs.h"
  14. #include "propagate_winding_numbers.h"
  15. #include "relabel_small_immersed_cells.h"
  16. #include "remesh_self_intersections.h"
  17. #include "string_to_mesh_boolean_type.h"
  18. #include "../../combine.h"
  19. #include "../../cumsum.h"
  20. #include "../../extract_manifold_patches.h"
  21. #include "../../get_seconds.h"
  22. #include "../../parallel_for.h"
  23. #include "../../remove_unreferenced.h"
  24. #include "../../resolve_duplicated_faces.h"
  25. #include "../../slice.h"
  26. #include "../../unique_edge_map.h"
  27. #include "../../unique_simplices.h"
  28. #include "../../C_STR.h"
  29. #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
  30. #include <algorithm>
  31. //#define MESH_BOOLEAN_TIMING
  32. //#define DOUBLE_CHECK_EXACT_OUTPUT
  33. //#define SMALL_CELL_REMOVAL
  34. template <
  35. typename DerivedVA,
  36. typename DerivedFA,
  37. typename DerivedVB,
  38. typename DerivedFB,
  39. typename DerivedVC,
  40. typename DerivedFC,
  41. typename DerivedJ>
  42. IGL_INLINE bool igl::copyleft::cgal::mesh_boolean(
  43. const Eigen::MatrixBase<DerivedVA > & VA,
  44. const Eigen::MatrixBase<DerivedFA > & FA,
  45. const Eigen::MatrixBase<DerivedVB > & VB,
  46. const Eigen::MatrixBase<DerivedFB > & FB,
  47. const MeshBooleanType & type,
  48. Eigen::PlainObjectBase<DerivedVC > & VC,
  49. Eigen::PlainObjectBase<DerivedFC > & FC,
  50. Eigen::PlainObjectBase<DerivedJ > & J)
  51. {
  52. std::function<int(const int, const int)> keep;
  53. std::function<int(const Eigen::Matrix<int,1,Eigen::Dynamic>) > wind_num_op;
  54. mesh_boolean_type_to_funcs(type,wind_num_op,keep);
  55. return mesh_boolean(VA,FA,VB,FB,wind_num_op,keep,VC,FC,J);
  56. }
  57. template <
  58. typename DerivedVA,
  59. typename DerivedFA,
  60. typename DerivedVB,
  61. typename DerivedFB,
  62. typename DerivedVC,
  63. typename DerivedFC,
  64. typename DerivedJ>
  65. IGL_INLINE bool igl::copyleft::cgal::mesh_boolean(
  66. const Eigen::MatrixBase<DerivedVA > & VA,
  67. const Eigen::MatrixBase<DerivedFA > & FA,
  68. const Eigen::MatrixBase<DerivedVB > & VB,
  69. const Eigen::MatrixBase<DerivedFB > & FB,
  70. const std::string & type_str,
  71. Eigen::PlainObjectBase<DerivedVC > & VC,
  72. Eigen::PlainObjectBase<DerivedFC > & FC,
  73. Eigen::PlainObjectBase<DerivedJ > & J)
  74. {
  75. return mesh_boolean(
  76. VA,FA,VB,FB,string_to_mesh_boolean_type(type_str),VC,FC,J);
  77. }
  78. template <
  79. typename DerivedVA,
  80. typename DerivedFA,
  81. typename DerivedVB,
  82. typename DerivedFB,
  83. typename DerivedVC,
  84. typename DerivedFC,
  85. typename DerivedJ>
  86. IGL_INLINE bool igl::copyleft::cgal::mesh_boolean(
  87. const Eigen::MatrixBase<DerivedVA> & VA,
  88. const Eigen::MatrixBase<DerivedFA> & FA,
  89. const Eigen::MatrixBase<DerivedVB> & VB,
  90. const Eigen::MatrixBase<DerivedFB> & FB,
  91. const std::function<int(const Eigen::Matrix<int,1,Eigen::Dynamic>) >& wind_num_op,
  92. const std::function<int(const int, const int)> & keep,
  93. Eigen::PlainObjectBase<DerivedVC > & VC,
  94. Eigen::PlainObjectBase<DerivedFC > & FC,
  95. Eigen::PlainObjectBase<DerivedJ > & J)
  96. {
  97. // Generate combined mesh (VA,FA,VB,FB) -> (V,F)
  98. Eigen::Matrix<size_t,2,1> sizes(FA.rows(),FB.rows());
  99. // TODO: This is a precision template **bug** that results in failure to
  100. // compile. If DerivedVA::Scalar is double and DerivedVB::Scalar is
  101. // CGAL::Epeck::FT then the following assignment will not compile. This
  102. // implies that VA must have the trumping precision (and a valid assignment
  103. // operator from VB's type).
  104. Eigen::Matrix<typename DerivedVA::Scalar,Eigen::Dynamic,3> VV(VA.rows() + VB.rows(), 3);
  105. Eigen::Matrix<typename DerivedFA::Scalar,Eigen::Dynamic,3> FF(FA.rows() + FB.rows(), 3);
  106. // Can't use comma initializer
  107. for(int a = 0;a<VA.rows();a++)
  108. {
  109. for(int d = 0;d<3;d++) VV(a,d) = VA(a,d);
  110. }
  111. for(int b = 0;b<VB.rows();b++)
  112. {
  113. for(int d = 0;d<3;d++) VV(VA.rows()+b,d) = VB(b,d);
  114. }
  115. FF.block(0, 0, FA.rows(), 3) = FA;
  116. // Eigen struggles to assign nothing to nothing and will assert if FB is empty
  117. if(FB.rows() > 0)
  118. {
  119. FF.block(FA.rows(), 0, FB.rows(), 3) = FB.array() + VA.rows();
  120. }
  121. return mesh_boolean(VV,FF,sizes,wind_num_op,keep,VC,FC,J);
  122. }
  123. template <
  124. typename DerivedV,
  125. typename DerivedF,
  126. typename DerivedVC,
  127. typename DerivedFC,
  128. typename DerivedJ>
  129. IGL_INLINE bool igl::copyleft::cgal::mesh_boolean(
  130. const std::vector<DerivedV > & Vlist,
  131. const std::vector<DerivedF > & Flist,
  132. const std::function<int(const Eigen::Matrix<int,1,Eigen::Dynamic>) >& wind_num_op,
  133. const std::function<int(const int, const int)> & keep,
  134. Eigen::PlainObjectBase<DerivedVC > & VC,
  135. Eigen::PlainObjectBase<DerivedFC > & FC,
  136. Eigen::PlainObjectBase<DerivedJ > & J)
  137. {
  138. DerivedV VV;
  139. DerivedF FF;
  140. Eigen::Matrix<size_t,Eigen::Dynamic,1> Vsizes,Fsizes;
  141. igl::combine(Vlist,Flist,VV,FF,Vsizes,Fsizes);
  142. return mesh_boolean(VV,FF,Fsizes,wind_num_op,keep,VC,FC,J);
  143. }
  144. template <
  145. typename DerivedV,
  146. typename DerivedF,
  147. typename DerivedVC,
  148. typename DerivedFC,
  149. typename DerivedJ>
  150. IGL_INLINE bool igl::copyleft::cgal::mesh_boolean(
  151. const std::vector<DerivedV > & Vlist,
  152. const std::vector<DerivedF > & Flist,
  153. const MeshBooleanType & type,
  154. Eigen::PlainObjectBase<DerivedVC > & VC,
  155. Eigen::PlainObjectBase<DerivedFC > & FC,
  156. Eigen::PlainObjectBase<DerivedJ > & J)
  157. {
  158. DerivedV VV;
  159. DerivedF FF;
  160. Eigen::Matrix<size_t,Eigen::Dynamic,1> Vsizes,Fsizes;
  161. igl::combine(Vlist,Flist,VV,FF,Vsizes,Fsizes);
  162. std::function<int(const int, const int)> keep;
  163. std::function<int(const Eigen::Matrix<int,1,Eigen::Dynamic>) > wind_num_op;
  164. mesh_boolean_type_to_funcs(type,wind_num_op,keep);
  165. return mesh_boolean(VV,FF,Fsizes,wind_num_op,keep,VC,FC,J);
  166. }
  167. template <
  168. typename DerivedVV,
  169. typename DerivedFF,
  170. typename Derivedsizes,
  171. typename DerivedVC,
  172. typename DerivedFC,
  173. typename DerivedJ>
  174. IGL_INLINE bool igl::copyleft::cgal::mesh_boolean(
  175. const Eigen::MatrixBase<DerivedVV > & VV,
  176. const Eigen::MatrixBase<DerivedFF > & FF,
  177. const Eigen::MatrixBase<Derivedsizes> & sizes,
  178. const std::function<int(const Eigen::Matrix<int,1,Eigen::Dynamic>) >& wind_num_op,
  179. const std::function<int(const int, const int)> & keep,
  180. Eigen::PlainObjectBase<DerivedVC > & VC,
  181. Eigen::PlainObjectBase<DerivedFC > & FC,
  182. Eigen::PlainObjectBase<DerivedJ > & J)
  183. {
  184. #ifdef MESH_BOOLEAN_TIMING
  185. const auto & tictoc = []() -> double
  186. {
  187. static double t_start = igl::get_seconds();
  188. double diff = igl::get_seconds()-t_start;
  189. t_start += diff;
  190. return diff;
  191. };
  192. const auto log_time = [&](const std::string& label) -> void {
  193. printf("%50s: %0.5lf\n",
  194. C_STR("mesh_boolean." << label),tictoc());
  195. };
  196. tictoc();
  197. #endif
  198. typedef CGAL::Epeck Kernel;
  199. typedef Kernel::FT ExactScalar;
  200. typedef Eigen::Matrix<typename DerivedJ::Scalar,Eigen::Dynamic,1> VectorXJ;
  201. typedef Eigen::Matrix<
  202. ExactScalar,
  203. Eigen::Dynamic,
  204. Eigen::Dynamic,
  205. DerivedVC::IsRowMajor> MatrixXES;
  206. MatrixXES V;
  207. DerivedFC F;
  208. VectorXJ CJ;
  209. {
  210. Eigen::VectorXi I;
  211. igl::copyleft::cgal::RemeshSelfIntersectionsParam params;
  212. params.stitch_all = true;
  213. MatrixXES Vr;
  214. DerivedFC Fr;
  215. Eigen::MatrixXi IF;
  216. igl::copyleft::cgal::remesh_self_intersections(
  217. VV, FF, params, Vr, Fr, IF, CJ, I);
  218. assert(I.size() == Vr.rows());
  219. // Merge coinciding vertices into non-manifold vertices.
  220. std::for_each(Fr.data(), Fr.data()+Fr.size(),
  221. [&I](typename DerivedFC::Scalar& a) { a=I[a]; });
  222. // Remove unreferenced vertices.
  223. Eigen::VectorXi UIM;
  224. igl::remove_unreferenced(Vr, Fr, V, F, UIM);
  225. }
  226. #ifdef MESH_BOOLEAN_TIMING
  227. log_time("resolve_self_intersection");
  228. #endif
  229. Eigen::MatrixXi E, uE;
  230. Eigen::VectorXi EMAP, uEC, uEE;
  231. igl::unique_edge_map(F, E, uE, EMAP, uEC, uEE);
  232. // Compute patches (F,EMAP,uEC,uEE) --> (P)
  233. Eigen::VectorXi P;
  234. const size_t num_patches = igl::extract_manifold_patches(F,EMAP,uEC,uEE,P);
  235. #ifdef MESH_BOOLEAN_TIMING
  236. log_time("patch_extraction");
  237. #endif
  238. // Compute cells (V,F,P,E,uE,EMAP) -> (per_patch_cells)
  239. Eigen::MatrixXi per_patch_cells;
  240. const size_t num_cells =
  241. extract_cells( V, F, P, uE, EMAP, uEC, uEE, per_patch_cells);
  242. #ifdef MESH_BOOLEAN_TIMING
  243. log_time("cell_extraction");
  244. #endif
  245. // Compute winding numbers on each side of each facet.
  246. const size_t num_faces = F.rows();
  247. // W(f,:) --> [w1out,w1in,w2out,w2in, ... wnout,wnint] winding numbers above
  248. // and below each face w.r.t. each input mesh, so that W(f,2*i) is the
  249. // winding number above face f w.r.t. input i, and W(f,2*i+1) is the winding
  250. // number below face f w.r.t. input i.
  251. Eigen::MatrixXi W;
  252. // labels(f) = i means that face f comes from mesh i
  253. Eigen::VectorXi labels(num_faces);
  254. // cumulative sizes
  255. Derivedsizes cumsizes;
  256. igl::cumsum(sizes,1,cumsizes);
  257. const size_t num_inputs = sizes.size();
  258. std::transform(
  259. CJ.data(),
  260. CJ.data()+CJ.size(),
  261. labels.data(),
  262. // Determine which input mesh birth face i comes from
  263. [&num_inputs,&cumsizes](int i)->int
  264. {
  265. for(int k = 0;k<num_inputs;k++)
  266. {
  267. if(i<cumsizes(k)) return k;
  268. }
  269. assert(false && "Birth parent index out of range");
  270. return -1;
  271. });
  272. bool valid = true;
  273. if (num_faces > 0)
  274. {
  275. valid = valid && propagate_winding_numbers(
  276. V,F,uE,uEC,uEE,num_patches,P,num_cells,per_patch_cells,labels,W);
  277. } else
  278. {
  279. W.resize(0, 2*num_inputs);
  280. }
  281. assert((size_t)W.rows() == num_faces);
  282. // If W doesn't have enough columns, pad with zeros
  283. if (W.cols() <= 2*num_inputs)
  284. {
  285. const int old_ncols = W.cols();
  286. W.conservativeResize(num_faces,2*num_inputs);
  287. W.rightCols(2*num_inputs-old_ncols).setConstant(0);
  288. }
  289. assert((size_t)W.cols() == 2*num_inputs);
  290. #ifdef MESH_BOOLEAN_TIMING
  291. log_time("propagate_input_winding_number");
  292. #endif
  293. // Compute resulting winding number.
  294. Eigen::MatrixXi Wr(num_faces, 2);
  295. for (size_t i=0; i<num_faces; i++)
  296. {
  297. // Winding number vectors above and below
  298. Eigen::RowVectorXi w_out(1,num_inputs), w_in(1,num_inputs);
  299. for(size_t k =0;k<num_inputs;k++)
  300. {
  301. w_out(k) = W(i,2*k+0);
  302. w_in(k) = W(i,2*k+1);
  303. }
  304. Wr(i,0) = wind_num_op(w_out);
  305. Wr(i,1) = wind_num_op(w_in);
  306. }
  307. #ifdef MESH_BOOLEAN_TIMING
  308. log_time("compute_output_winding_number");
  309. #endif
  310. #ifdef SMALL_CELL_REMOVAL
  311. igl::copyleft::cgal::relabel_small_immersed_cells(
  312. V, F, num_patches, P, num_cells, per_patch_cells, 1e-3, Wr);
  313. #endif
  314. // Extract boundary separating inside from outside.
  315. auto index_to_signed_index = [&](size_t i, bool ori) -> int
  316. {
  317. return (i+1)*(ori?1:-1);
  318. };
  319. //auto signed_index_to_index = [&](int i) -> size_t {
  320. // return abs(i) - 1;
  321. //};
  322. std::vector<int> selected;
  323. for(size_t i=0; i<num_faces; i++)
  324. {
  325. auto should_keep = keep(Wr(i,0), Wr(i,1));
  326. if (should_keep > 0)
  327. {
  328. selected.push_back(index_to_signed_index(i, true));
  329. } else if (should_keep < 0)
  330. {
  331. selected.push_back(index_to_signed_index(i, false));
  332. }
  333. }
  334. const size_t num_selected = selected.size();
  335. DerivedFC kept_faces(num_selected, 3);
  336. DerivedJ kept_face_indices(num_selected, 1);
  337. for (size_t i=0; i<num_selected; i++)
  338. {
  339. size_t idx = abs(selected[i]) - 1;
  340. if (selected[i] > 0)
  341. {
  342. kept_faces.row(i) = F.row(idx);
  343. } else
  344. {
  345. kept_faces.row(i) = F.row(idx).reverse();
  346. }
  347. kept_face_indices(i, 0) = CJ[idx];
  348. }
  349. #ifdef MESH_BOOLEAN_TIMING
  350. log_time("extract_output");
  351. #endif
  352. // Finally, remove duplicated faces and unreferenced vertices.
  353. {
  354. DerivedFC G;
  355. DerivedJ JJ;
  356. igl::resolve_duplicated_faces(kept_faces, G, JJ);
  357. igl::slice(kept_face_indices, JJ, 1, J);
  358. #ifdef DOUBLE_CHECK_EXACT_OUTPUT
  359. {
  360. // Sanity check on exact output.
  361. igl::copyleft::cgal::RemeshSelfIntersectionsParam params;
  362. params.detect_only = true;
  363. params.first_only = true;
  364. MatrixXES dummy_VV;
  365. DerivedFC dummy_FF, dummy_IF;
  366. Eigen::VectorXi dummy_J, dummy_IM;
  367. igl::copyleft::cgal::SelfIntersectMesh<
  368. Kernel,
  369. MatrixXES, DerivedFC,
  370. MatrixXES, DerivedFC,
  371. DerivedFC,
  372. Eigen::VectorXi,
  373. Eigen::VectorXi
  374. > checker(V, G, params,
  375. dummy_VV, dummy_FF, dummy_IF, dummy_J, dummy_IM);
  376. if (checker.count != 0)
  377. {
  378. throw "Self-intersection not fully resolved.";
  379. }
  380. }
  381. #endif
  382. // `assign` _after_ removing unreferenced vertices
  383. {
  384. Eigen::VectorXi I,J;
  385. igl::remove_unreferenced(V.rows(),G,I,J);
  386. FC = G;
  387. std::for_each(FC.data(),FC.data()+FC.size(),
  388. [&I](typename DerivedFC::Scalar & a){a=I(a);});
  389. const bool slow_and_more_precise = false;
  390. VC.resize(J.size(),3);
  391. igl::parallel_for(J.size(),[&](Eigen::Index i)
  392. {
  393. for(Eigen::Index c = 0;c<3;c++)
  394. {
  395. assign_scalar(V(J(i),c),slow_and_more_precise,VC(i,c));
  396. }
  397. },1000);
  398. }
  399. }
  400. #ifdef MESH_BOOLEAN_TIMING
  401. log_time("clean_up");
  402. #endif
  403. return valid;
  404. }
  405. template <
  406. typename DerivedVA,
  407. typename DerivedFA,
  408. typename DerivedVB,
  409. typename DerivedFB,
  410. typename DerivedVC,
  411. typename DerivedFC>
  412. IGL_INLINE bool igl::copyleft::cgal::mesh_boolean(
  413. const Eigen::MatrixBase<DerivedVA > & VA,
  414. const Eigen::MatrixBase<DerivedFA > & FA,
  415. const Eigen::MatrixBase<DerivedVB > & VB,
  416. const Eigen::MatrixBase<DerivedFB > & FB,
  417. const MeshBooleanType & type,
  418. Eigen::PlainObjectBase<DerivedVC > & VC,
  419. Eigen::PlainObjectBase<DerivedFC > & FC)
  420. {
  421. Eigen::Matrix<typename DerivedFC::Scalar, Eigen::Dynamic,1> J;
  422. return igl::copyleft::cgal::mesh_boolean(VA,FA,VB,FB,type,VC,FC,J);
  423. }
  424. #ifdef IGL_STATIC_LIBRARY
  425. // Explicit template instantiation
  426. // generated by autoexplicit.sh
  427. // generated by autoexplicit.sh
  428. template bool igl::copyleft::cgal::mesh_boolean<Eigen::Matrix<CGAL::Epeck::FT, -1, -1, 1, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<CGAL::Epeck::FT, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<CGAL::Epeck::FT, -1, -1, 1, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, 1, 0, -1, 1> >(Eigen::MatrixBase<Eigen::Matrix<CGAL::Epeck::FT, -1, -1, 1, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<CGAL::Epeck::FT, -1, -1, 0, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, igl::MeshBooleanType const&, Eigen::PlainObjectBase<Eigen::Matrix<CGAL::Epeck::FT, -1, -1, 1, -1, -1> >&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> >&);
  429. // generated by autoexplicit.sh
  430. template bool igl::copyleft::cgal::mesh_boolean<Eigen::Matrix<CGAL::Epeck::FT, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<CGAL::Epeck::FT, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<CGAL::Epeck::FT, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, 1, 0, -1, 1> >(Eigen::MatrixBase<Eigen::Matrix<CGAL::Epeck::FT, -1, 3, 0, -1, 3> > const&, Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<CGAL::Epeck::FT, -1, 3, 0, -1, 3> > const&, Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, igl::MeshBooleanType const&, Eigen::PlainObjectBase<Eigen::Matrix<CGAL::Epeck::FT, -1, 3, 0, -1, 3> >&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> >&);
  431. template bool igl::copyleft::cgal::mesh_boolean<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, 1, 0, -1, 1> >(Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, igl::MeshBooleanType 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<int, -1, 1, 0, -1, 1> >&);
  432. template bool igl::copyleft::cgal::mesh_boolean<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1> >(Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, igl::MeshBooleanType const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);
  433. #ifdef WIN32
  434. #endif
  435. #endif