MeshEikonalSolverIFIMLockFree

This class computes the traveling time T using the lock free variant of the fast iterative method for arbitrary triangulated meshes. Compare PhD thesis B. Zoennchen Section 9.5. 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 Zonnchen


Field: nameOldDefiningSimplex [java.lang.String]

---


Field: forkJoinPool [ForkJoinPool]

---


Field: random [Random]

---


Field: calculationFinished [boolean]

Indicates that the computation of T has been completed.


Field: nThreds [int]

---


Field: nameDefiningSimplex [java.lang.String]

---


Field: atomicBooleans [AtomicBoolean>]

---


Field: logger [Logger]

---


Field: speedChange [IVertexContainerBoolean]

---


Field: nameSpeedChanged [java.lang.String]

---


Field: activeLists [LinkedList>]

The narrow-band of the fast marching method.


Field: definingSimplex [Pair>]

---


Field: nameOldSpeed [java.lang.String]

---


Field: oldPotential [IVertexContainerDouble]

---


Field: nameOldPotential [java.lang.String]

---


Field: oldTimeCosts [IVertexContainerDouble]

---


Field: nameAtomicBoolean [java.lang.String]

---


Field: nUpdates [int]

---


Field: iteration [int]

---


Field: epsilon [double]

---


Field: identifier [java.lang.String]

---


Field: oldDefiningSimplex [Pair>]

---