CGAL 5.1 - CGAL and the Boost Graph Library
Property_map/dynamic_properties.cpp
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Surface_mesh.h>
#include <string>
typedef K::Point_3 Point_3;
int main()
{
Mesh mesh;
CGAL::make_triangle(Point_3(0,0,0),Point_3(1,0,0),Point_3(1,1,0), mesh);
typedef boost::property_map<Mesh, CGAL::dynamic_vertex_property_t<std::string> >::type VertexNameMap;
VertexNameMap vnm = get(CGAL::dynamic_vertex_property_t<std::string>(), mesh);
put(vnm, *(vertices(mesh).first), "Paris");
std::cout << get(vnm, *(vertices(mesh).first)) << std::endl;
typedef boost::property_map<Mesh, CGAL::dynamic_halfedge_property_t<double> >::type TrafficDensityMap;
TrafficDensityMap tdm = get(CGAL::dynamic_halfedge_property_t<double>(), mesh);
put(tdm, *(halfedges(mesh).first), 0.7);
std::cout << get(tdm, *(halfedges(mesh).first)) << std::endl;
return 0;
}
VertexListGraph::vertices
std::pair< boost::graph_traits< VertexListGraph >::vertex_iterator, boost::graph_traits< VertexListGraph >::vertex_iterator > vertices(const VertexListGraph &g)
CGAL::Surface_mesh
CGAL::dynamic_vertex_property_t
Definition: properties.h:59
HalfedgeListGraph::halfedges
std::pair< boost::graph_traits< HalfedgeListGraph >::halfedge_iterator, boost::graph_traits< HalfedgeListGraph >::halfedge_iterator > halfedges(const HalfedgeListGraph &g)
CGAL::dynamic_halfedge_property_t
Definition: properties.h:68
CGAL::make_triangle
boost::graph_traits< Graph >::halfedge_descriptor make_triangle(const P &p0, const P &p1, const P &p2, Graph &g)
Creates an isolated triangle with its vertices initialized to p0, p1 and p2, and adds it to the graph...
Definition: generators.h:134
CGAL::Simple_cartesian