CGAL users discussion list

[Shrabani Ghosh <>]

Thank you for your reply. 
I tried to do something like this. But it's not working. 

#include <string>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Surface_mesh.h>
#include <boost/foreach.hpp>
#include <fstream>
#include <list>
#include <iostream>
#include <CGAL/Polyhedron_items_with_id_3.h>
#include <boost/graph/kruskal_min_spanning_tree.hpp>
#include <boost/property_map/property_map.hpp>


typedef CGAL::Simple_cartesian<double> K;
typedef CGAL::Surface_mesh<K::Point_3> Mesh;
typedef Mesh::Vertex_index vertex_descriptor;
typedef boost::graph_traits<Mesh>::vertex_iterator   vertex_iterator;
typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
typedef Mesh::Face_index face_descriptor;
typedef boost::graph_traits<Mesh>::edge_descriptor   edge_descriptor;
std::list<edge_descriptor> mst;

int main()
{


  Mesh m;
  std::ifstream is("../data/TwoBoxesEqualSideBySide_MM2M.off") ; is >> m ;
  if (!CGAL::is_triangle_mesh(m)){
    std::cerr << "Input geometry is not triangulated." << std::endl;
    return EXIT_FAILURE;

}


  // retrieve the point property for which exists a convenience function
 
  Mesh::Property_map<vertex_descriptor, std::int> label;
  BOOST_FOREACH( vertex_descriptor vd, m.vertices()) { 
  std::cout <<  get(vd, label) << std:: endl;
   // std::cout << "point " << vd << " location " << location[vd] <<
std::endl;
  }

  return 0;
}



--
Sent from: http://cgal-discuss.949826.n4.nabble.com/