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 ( > https://en.wikipedia.org/wiki/Hausdorff_distance) available in Julia, is > the Distances.jl package a good fit or I should create a separate package > just for this distance between point sets? > > I can think of a very simple (naive) implementation: > > using Distances > > A, B # matrices which columns represent the points in the pointset > D = pairwise(Euclidean(), A, B) > daB = maximum(minimum(D,2)) > dbA = maximum(minimum(D,1)) > result = max(daB, dbA) > > -Júlio >
