The naïve algorithm is O(N^2), I think the most efficient algorithms come
close to O(N). There is quite a lot of literature on efficient algorithms.
- Andrew
On Friday, 23 October 2015 23:28:46 UTC+1, Júlio Hoffimann wrote:
> Hi,
>
> I want to make the Hausdorff distance (
>
Thanks, will take a look.
-Júlio
This is not exactly my area of expertise, but this recently published paper
looks like a good starting point.
[1]
A. A. Taha and A. Hanbury, ‘An Efficient Algorithm for Calculating the
Exact Hausdorff Distance’, *IEEE Transactions on Pattern Analysis and
Machine Intelligence*, vol. 37, no. 11,
