MeshEikonalSolverFMMRefined

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 type of the vertices of the triangulation @param the type of the half-edges of the triangulation @param the type of the faces of the triangulation


Field: refinePredicate [PredicateEdgeRefineCurvature]

---


Field: narrowBand [PriorityQueue]

The narrow-band of the fast marching method.


Field: namePathFindingTag [java.lang.String]

---


Field: nameVirtualSupport [java.lang.String]

---


Field: logger [Logger]

---


Field: nameNonAccuteEdge [java.lang.String]

---


Field: localSover [LocalSover]

---


Field: identifier [java.lang.String]

---


Field: refiner [GenRegularRefinement]

---


Field: timeCostFunction [ITimeCostFunction]

The time cost function defined on the geometry.


Field: calculationFinished [boolean]

Indicates that the computation of T has been completed.


Field: pointComparator [Comparator]

Comparator for the heap. Vertices of points with small potentials are at the top of the heap.


Field: distFunc [IDistanceFunction]

Gives the distance to the boundary i.e. the targets


Field: targetVertices [Collection]

---


Field: triangulation [IIncrementalTriangulation]

The triangulation the solver uses.


Field: namePotential [java.lang.String]

---