MeshEikonalSolverDFMM

This class computes the traveling time T using the fast marching method for arbitrary triangulated meshes. If the equation is solved multiple times, computation time is saved by re-using unchanged values. 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 @author Benedikt Zoennchen


Field: iteration [int]

---


Field: avoidedUpdates [int]

---


Field: oldPotential [IVertexContainerDouble]

---


Field: nameOldSpeed [java.lang.String]

---


Field: timeCostFunction [ITimeCostFunction]

The time cost function defined on the geometry.


Field: speedChange [IVertexContainerBoolean]

---


Field: prevOrder [LinkedList]

---


Field: logger [Logger]

---


Field: order [LinkedList]

The narrow-band of the fast marching method.


Field: oldTimeCosts [IVertexContainerDouble]

---


Field: identifier [java.lang.String]

---


Field: nameSpeedChanged [java.lang.String]

---


Field: nameOldPotential [java.lang.String]

---


Field: nUpdates [int]

---


Field: maxValidOldPotential [double]

---