CGAL 5.4.4 - Triangulated Surface Mesh Shortest Paths
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Surface_mesh.h>
#include <CGAL/AABB_face_graph_triangle_primitive.h>
#include <CGAL/AABB_traits.h>
#include <CGAL/AABB_tree.h>
#include <cstdlib>
#include <iostream>
#include <fstream>
typedef Kernel::Point_3 Point_3;
typedef Kernel::Ray_3 Ray_3;
typedef CGAL::Surface_mesh<Point_3> Triangle_mesh;
typedef CGAL::Surface_mesh_shortest_path<Traits> Surface_mesh_shortest_path;
typedef boost::graph_traits<Triangle_mesh> Graph_traits;
typedef Graph_traits::vertex_iterator vertex_iterator;
typedef Graph_traits::face_iterator face_iterator;
typedef typename Surface_mesh_shortest_path::Barycentric_coordinates Barycentric_coordinates;
typedef typename Surface_mesh_shortest_path::Face_location Face_location;
int main(int argc, char** argv)
const std::string filename = (argc>1) ? argv[1] : CGAL::data_file_path("meshes/");
Triangle_mesh tmesh;
if(!CGAL::IO::read_polygon_mesh(filename, tmesh) ||
std::cerr << "Invalid input file." << std::endl;
Surface_mesh_shortest_path shortest_paths(tmesh);
// The source point is a 3D point. We must convert it to a face location (that is,
// a face ID and three barycentric coordinates)
const Point_3 source_pt(-0.06, -0.145, 0.182);
Face_location source_loc = shortest_paths.locate<AABB_face_graph_traits>(source_pt); // this builds an AABB tree of the mesh
// Add the source point
shortest_paths.add_source_point(source_loc.first, source_loc.second);
// The target will be defined by the first intersection of the following ray with the input mesh
const Ray_3 ray(Point_3(0.126, 0.387, 0.324), Point_3(0.126, 0.387, 0.124));
// If you intend to call `locate` many times, you should cache the AABB tree
// that is used internally to avoid it being recomputed at each call, as follows:
AABB_tree tree;
Face_location target_loc = shortest_paths.locate<AABB_face_graph_traits>(ray, tree);
if(target_loc.first == boost::graph_traits<Triangle_mesh>::null_face())
std::cerr << "They ray does not intersect the mesh!" << std::endl;
// Compute the shortest path between the source and the target
std::vector<Point_3> points;
shortest_paths.shortest_path_points_to_source_points(target_loc.first, target_loc.second,
// Print the points
std::cout << points.size() << " ";
for (std::size_t i = 0; i < points.size(); ++i)
std::cout << " " << points[i];
std::cout << std::endl;