songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fix compilation errors

This commit is contained in:
Laurent Rineau 2019-06-13 15:32:30 +02:00
parent 2600f39b13
commit 67e73c2324
2 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polyline.h
View File

@ -42,6 +42,7 @@
#include <map> #include <map>
#include <CGAL/boost/iterator/transform_iterator.hpp> #include <CGAL/boost/iterator/transform_iterator.hpp>
#include <boost/next_prior.hpp>
#include <boost/unordered_set.hpp> #include <boost/unordered_set.hpp>
namespace CGAL { namespace CGAL {

4
Skin_surface_3/include/CGAL/marching_tetrahedra_3.h
View File

@ -141,7 +141,7 @@ public:
bool is_inside(T_Cell_iterator ch, int i) { bool is_inside(T_Cell_iterator ch, int i) {
CGAL_assertion(ch != Cell_handle()); CGAL_assertion(ch.operator->() != nullptr);
//return (traits.sign(ch,i) == POSITIVE); //return (traits.sign(ch,i) == POSITIVE);
T_vertex_map_it it = triang_vertex_signs.find((ch->vertex(i))); T_vertex_map_it it = triang_vertex_signs.find((ch->vertex(i)));
@ -149,7 +149,7 @@ public:
bool side = (traits.sign(ch,i) == POSITIVE); bool side = (traits.sign(ch,i) == POSITIVE);
CGAL_assertion(triang_vertex_signs.find((ch->vertex(i))) == CGAL_assertion(triang_vertex_signs.find((ch->vertex(i))) ==
triang_vertex_signs.end()); triang_vertex_signs.end());
CGAL_assertion(ch != Cell_handle()); CGAL_assertion(ch.operator->() != nullptr);
triang_vertex_signs[(ch->vertex(i))] = side; triang_vertex_signs[(ch->vertex(i))] = side;
CGAL_assertion(triang_vertex_signs.find((ch->vertex(i))) != CGAL_assertion(triang_vertex_signs.find((ch->vertex(i))) !=
triang_vertex_signs.end()); triang_vertex_signs.end());