MeshEikonalSolverFIMLockFree

This class computes the traveling time T using a (multi threaded) lock free variant of the fast iterative 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 @author Benedikt Zoennchen


Field: forkJoinPool [ForkJoinPool]

---


Field: iteration [int]

---


Field: random [Random]

---


Field: nUpdates [int]

---


Field: logger [Logger]

---


Field: nThreds [int]

---


Field: identifier [java.lang.String]

---


Field: activeLists [LinkedList>]

The narrow-band of the fast marching method.


Field: calculationFinished [boolean]

Indicates that the computation of T has been completed.


Field: nameAtomicBoolean [java.lang.String]

---


Field: atomicBooleans [AtomicBoolean>]

---