Class FillerThread

All Implemented Interfaces:
Runnable, SearchInterface

public class FillerThread extends SearchThread
Seeded-volume segmentation via single-source shortest paths. Path nodes are used as seed points in an open-ended variant of Dijkstra's algorithm. The threshold sets the maximum allowable distance for a node to be included in the Fill. This distance is represented in the g-score of a node, which is the length of the shortest path from a seed point to that node. The magnitudes of these distances are heavily dependent on the supplied cost function Cost, so the threshold should be set with a particular cost function in mind. It often helps to adjust the threshold interactively.
Author:
Cameron Arshadi, Tiago Ferreira, Mark Longair