# 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.

## Properties

Version | 0.1.2 |
---|---|

Change log | None available |

Dependencies | base (>=4.5 && <5), primitive, vector (>=0.9) |

License | BSD3 |

Copyright | (c) Anthony Cowley 2012,2013 |

Author | Anthony Cowley |

Maintainer | acowley@gmail.com |

Category | Math |

Source repository | head: git clone git://github.com/acowley/DistanceTransform.git |

Uploaded | Sat Feb 16 02:35:56 UTC 2013 by AnthonyCowley |

Distributions | NixOS:0.1.2 |

Downloads | 269 total (13 in last 30 days) |

Status | Docs uploaded by user Build status unknown [no reports yet] |

## Modules

*DistanceTransform*

[Index]

## Downloads

- DistanceTransform-0.1.2.tar.gz [browse] (Cabal source package)
- Package description (included in the package)

#### Maintainers' corner

For package maintainers and hackage trustees