CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

I think the best way to do it is to collect all of them per segment_id
in the same loop and then you can work with each collection independently.

Sebastien.

On 07/12/2017 06:54 PM, Iasonm wrote:
> Hello,
> I used the mesh segmentation algorithm
> http://doc.cgal.org/latest/Surface_mesh_segmentation/index.html
> <http://doc.cgal.org/latest/Surface_mesh_segmentation/index.html>   . What I
> have got now is a CGALSurfaceMesh::Property_map<face_descriptor,
> std::size_t> which connects faces with segment indices using the boost
> property maps. Now I want to compute the Laplace operator of a segment.
> To do that I need, given a segment index, to be able :
> 1) to know the number of vertices which belong to the given segment. Is
> there a faster way doing that instead of iterating over all faces and
> counting how many vertices belong to the given segment?
>
> 2) to iterate over all edges that belong to the given segment. My first
> guess was to iterate over all faces that belong to the given segment and
> iterate over all three edges of each face. But by doing that I would
> reprocess some edges. Is there a faster way?
>
>
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Property-Maps-tp4662825.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.