The way the algorithm works is that it builds a full tree before doing
queries on it, so currently there's no way. However, I was thinking
about implementing this in the case where you have pre-determined
targets and interrupt the tree construction as soon as you have
distances over your current minimum.
Alternatively, and already available : since you know which faces of
your mesh will be involved in the shortest path, you can run the
algorithm on a face filtered graph :
This is an adapter around your mesh that will behave as if it were just
a mesh made out of the faces you've selected.
On 2019-11-13 18:03, aseverino wrote:
> Is there a way to limit the search for shortest path? I have a huge mesh, and
> I know the source point is just less than a dozen triangles away from the
> Sent from: http://cgal-discuss.949826.n4.nabble.com/ >