Consider an O(n) watershed

[0x00b1]

From @LeeKamentsky on April 17, 2015 11:46

This paper (http://www.ncbi.nlm.nih.gov/pubmed/17076410 Building the component tree in quasi-linear time) could give us the connected components at each level of a level set. That would let you examine the tree when creating a seeded watershed. Our watershed operates in N(log N) time and consumes a lot of memory and not in a cache-friendly manner.

Copied from original issue: CellProfiler/CellProfiler#1343