CGAL users discussion list

[Andreas Fabri <>]

See also

https://stackoverflow.com/questions/62066583/find-all-the-faces-between-a-source-and-a-target-faces/62071300#62071300

andreas

On 5/28/2020 4:11 PM, "Sebastien Loriot (GeometryFactory)" ( via cgal-discuss Mailing List) wrote:

    Try
      calling boost::dijkstra_shortest_paths on the dual.
      
      See a dual mesh example here:
      
https://doc.cgal.org/latest/BGL/BGL_surface_mesh_2surface_mesh_dual_8cpp-example.html
      
      
      Sebastien.
      
      
      On 5/28/20 4:02 PM, aseverino ( via
      cgal-discuss Mailing List) wrote:
      
> I've used the
>         CGAL::Surface_mesh_shortest_path before to find the exact
>         
>         shortest path in a topological manner. But now I want something
>         simpler that
>         
>         seem to be missing from the library that is finding the logical
>         path from
>         
>         one face to another, returning a list of the faces in between.
>         
>         
>         Is there any way to do it without having to implement a tree
>         search from
>         
>         scratch?
>         
>         
>         
>         
>         --
>         
>         Sent from: http://cgal-discuss.949826.n4.nabble.com/
>         
>         
>       
      
    
-- 
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project

phone: +33.492.954.912    skype: andreas.fabri