CGAL users discussion list

[Iasonm <>]

What is the fastest way of extracting a graph which connects the segments of
a (segmented) mesh after using the following code to extract the mesh
segments? All in all this graph would represent the adjacency of segments in
a mesh.

*Code I use to segment the mesh:*
  std::cout << "Segmenting mesh.." << std::endl;
  // create a property-map ean are you sure the edge sean are you sure the
  // edge shared by two triangles is not duplicatehared by two triangles is
  // not duplicatefor segment-id
  m_segmentFaceMap =
      m_M.add_property_map<face_descriptor, std::size_t>("f:sid").first;
  ;
  segmentsComputed = true;
  // segment the mesh using default parameters for number of levels, and
  // smoothing lambda
  // Any other scalar values can be used instead of using SDF values
computed
  // using the CGAL function
  std::size_t number_of_segments =
      CGAL::segmentation_via_sdf_values(m_M, m_segmentFaceMap);

  std::cout << "Number of segments: " << number_of_segments << std::endl;




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