#include <CGAL/Simple_cartesian.h>
#include <CGAL/Surface_mesh.h>
#include <CGAL/boost/graph/graph_traits_Polyhedron_3.h>
#include <CGAL/boost/graph/properties_Polyhedron_3.h>
#include <CGAL/extract_mean_curvature_flow_skeleton.h>
#include <fstream>
#include <boost/foreach.hpp>
typedef boost::graph_traits<Triangle_mesh>::vertex_descriptor vertex_descriptor;
typedef Skeletonization::Skeleton Skeleton;
typedef Skeleton::vertex_descriptor Skeleton_vertex;
typedef Skeleton::edge_descriptor Skeleton_edge;
int main(int argc, char* argv[])
{
std::ifstream input((argc>1)?argv[1]:"data/elephant.off");
Triangle_mesh tmesh;
input >> tmesh;
Skeleton skeleton;
std::cout << "Number of vertices of the skeleton: " << boost::num_vertices(skeleton) << "\n";
std::cout << "Number of edges of the skeleton: " << boost::num_edges(skeleton) << "\n";
std::ofstream output("skel.cgal");
BOOST_FOREACH(Skeleton_edge e,
edges(skeleton))
{
const Point& s = skeleton[
source(e, skeleton)].point;
const Point& t = skeleton[
target(e, skeleton)].point;
output << "2 " << s << " " << t << "\n";
}
output.close();
output.open("correspondance.cgal");
BOOST_FOREACH(Skeleton_vertex v,
vertices(skeleton))
BOOST_FOREACH(vertex_descriptor vd, skeleton[v].
vertices)
return 0;
}