This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.
An n-D distance transform that computes the Euclidean
distance between each element in a discrete field and the nearest cell
containing a zero.
The algorithm implemented is based off of
Meijster et al., "A general algorithm for computing distancetransforms in linear time." Parallel versions of both the Euclidean
distance transform and squared Euclidean distance transform are also
provided.
