Surface_mesh_shortest_path

This commit is contained in:
Andreas Fabri 2018-01-17 21:56:19 +00:00
parent 39b1431fca
commit f723c527e1
6 changed files with 16 additions and 2 deletions

View File

@ -24,6 +24,7 @@
#include <CGAL/license/Surface_mesh_segmentation.h>
#include <CGAL/disable_warnings.h>
/// @cond CGAL_DOCUMENT_INTERNAL
@ -265,4 +266,7 @@ public:
/// @endcond
}//namespace CGAL
#undef CGAL_ANGLE_ST_DEV_DIVIDER
#include <CGAL/enable_warnings.h>
#endif //CGAL_SURFACE_MESH_SEGMENTATION_DISK_SAMPLERS_H

View File

@ -24,6 +24,7 @@
#include <CGAL/license/Surface_mesh_segmentation.h>
#include <CGAL/disable_warnings.h>
/**
* @file mesh_segmentation.h
@ -499,4 +500,6 @@ segmentation_via_sdf_values(const TriangleMesh& triangle_mesh,
}//namespace CGAL
#include <CGAL/enable_warnings.h>
#endif // CGAL_SURFACE_MESH_SEGMENTATION_MESH_SEGMENTATION_H //

View File

@ -23,6 +23,7 @@
#include <CGAL/license/Surface_mesh_shortest_path.h>
#include <CGAL/disable_warnings.h>
#include <iterator>
#include <vector>
@ -2059,7 +2060,6 @@ public:
std::cout << "Final node count: " << m_currentNodeCount << std::endl;
}
return;
CGAL_assertion(m_currentNodeCount == 0);
#endif
}
@ -2808,4 +2808,6 @@ public:
} // namespace CGAL
#include <CGAL/enable_warnings.h>
#endif // CGAL_SURFACE_MESH_SHORTEST_PATH_SURFACE_MESH_SHORTEST_PATH_H

View File

@ -23,6 +23,7 @@
#include <CGAL/license/Surface_mesh_shortest_path.h>
#include <CGAL/disable_warnings.h>
#include <CGAL/Surface_mesh_shortest_path/barycentric.h>
#include <CGAL/Surface_mesh_shortest_path/function_objects.h>
@ -225,5 +226,6 @@ public:
} // namespace CGAL
#include <CGAL/enable_warnings.h>
#endif // CGAL_SURFACE_MESH_SHORTEST_PATH_TRAITS_H

View File

@ -23,6 +23,7 @@
#include <CGAL/license/Surface_mesh_shortest_path.h>
#include <CGAL/disable_warnings.h>
#include <CGAL/number_utils.h>
@ -262,4 +263,6 @@ public:
} // namespace CGAL
#include <CGAL/enable_warnings.h>
#endif // CGAL_SURFACE_MESH_SHORTEST_PATHS_3_BARYCENTRIC_H

View File

@ -90,7 +90,7 @@ struct TestMeshProgramInstance
if (randomizer)
{
return shortestPath.face_location(vertices[randomizer->get_int(0, vertices.size())]);
return shortestPath.face_location(vertices[randomizer->get_int(0, static_cast<int>(vertices.size()))]);
}
else
{