CGAL users discussion list

[David Rochera <>]

Thank you, Sebastien, your comments have been very helpful.

Best wishes,

David

On Thu, 11 Feb 2021 at 09:33, Sebastien Loriot <> wrote:

If you only want to build an AABB-tree of a subset of edge of a mesh,
simply put the edges inside a std::vector for example and pass the
.begin/end() range to the constructor of the tree.

Note that if you should not modified the mesh if you are still planning
to use the AABB-tree as it will not be updated.

Best,

Sebastien.

On 2/10/21 6:08 PM, David Rochera wrote:
> Hello everyone,
>
> I want to use the AABB Tree to find intersections with the edges of a
> surface mesh "sm" by doing something like:
>
> Tree tree(CGAL::edges(sm).first, CGAL::edges(sm).second, sm);
>
> But I don't want to do it for the whole surface "sm", I just want to do
> it for a face given by a face index. Is there any way to replace "sm" in
> the line above for something similar indicating the face to be considered?
>
> I managed to do it by extracting each face as a single surface mesh "sm"
> and then running the algorithm. The problem is that after finding these
> intersections I do some Euler operations (splitting edges and faces) and
> I want the changes to be done in the original whole mesh "sm", not just
> in each face as separated surface meshes. Any idea on how could this be
> done?
>
> Thank you very much and best regards,
>
> David
>
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss
>

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss