This class computes the traveling time T using the fast marching method for arbitrary triangulated meshes.
The quality of the result depends on the quality of the triangulation. For a high accuracy the triangulation
should not contain too many non-acute triangles.
@param
The time cost function defined on the geometry.
---
---
---
Indicates that the computation of T has been completed.
Gives the distance to the boundary i.e. the targets
---
---
---
---
---
The narrow-band of the fast marching method.
Comparator for the heap. Vertices of points with small potentials are at the top of the heap.
---
---
The triangulation the solver uses.