CGAL 6.0.2 - CGAL and the Boost Graph Library

Loading...
Searching...
No Matches
BGL_polyhedron_3/range.cpp
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Polyhedron_3.h>
#include <CGAL/Iterator_range.h>
#include <iostream>
#include <fstream>
#include <list>
#include <algorithm>
typedef CGAL::Simple_cartesian<double> Kernel;
typedef CGAL::Polyhedron_3<Kernel> Polyhedron;
typedef boost::graph_traits<Polyhedron>::vertex_descriptor vertex_descriptor;
typedef boost::graph_traits<Polyhedron>::vertex_iterator vertex_iterator;
typedef CGAL::Iterator_range<vertex_iterator> vertex_range;
vertex_range vertices_range(const Polyhedron& p)
{
return vertex_range(vertices(p));
}
struct Fct
{
void operator()(const vertex_descriptor& vd) const
{
std::cout << vd->point() << std::endl;
}
};
void fct(const Polyhedron& p)
{
vertex_range vr(vertices(p));
std::cout << "new for loop" << std::endl;
for(vertex_descriptor vd : vr){
std::cout << vd->point() << std::endl;
}
std::cout << "boost::tie + std::for_each" << std::endl;
vertex_iterator vb, ve;
boost::tie(vb,ve) = vertices_range(p);
std::for_each(vb,ve, Fct());
}
int main(int argc, char** argv)
{
Polyhedron P;
std::ifstream in((argc>1)?argv[1]:CGAL::data_file_path("meshes/cube_poly.off"));
in >> P ;
fct(P);
return 0;
}
CGAL::Iterator_range
CGAL::Polyhedron_3
Kernel
CGAL::Simple_cartesian