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.
|Change log||None available|
|Dependencies||base (>=4.5 && <5), primitive, vector (>=0.9) [details]|
|Copyright||(c) Anthony Cowley 2012,2013|
|Source repository||head: git clone git://github.com/acowley/DistanceTransform.git|
|Uploaded||Sat Feb 16 02:35:56 UTC 2013 by AnthonyCowley|
|Downloads||366 total (5 in last 30 days)|
|Status||Docs uploaded by user|
Build status unknown [no reports yet]
- DistanceTransform-0.1.2.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees