The DistanceTransform package
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 distance transforms in linear time." Parallel versions of both the Euclidean distance transform and squared Euclidean distance transform are also provided.
|Dependencies||base (>=4.5 && <5), primitive, vector (>=0.9) [details]|
|Copyright||(c) Anthony Cowley 2012,2013|
|Source repo||head: git clone git://github.com/acowley/DistanceTransform.git|
|Uploaded||Sat Feb 16 02:35:56 UTC 2013 by AnthonyCowley|
|Downloads||629 total (9 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
For package maintainers and hackage trustees