[julia-users] Re: poly2mask in Julia?

2015-01-28 Thread Andrew McLean
On Wednesday, 28 January 2015 02:50:19 UTC, Steven G. Johnson wrote: > > In Julia for this problem, I would just write a nested loop: loop over > points in the mask, and for each point loop over the (ordered) polygon > edges to check whether the point is in the polygon via the usual algorithm >

Re: [julia-users] Levi-Civita symbol/tensor

2015-02-12 Thread Andrew McLean
On Wednesday, 11 February 2015 20:11:27 UTC, Pablo Zubieta wrote: > > Hi again, > > There were some bugs in my implementations. I updated the gist > > with the corrected versions and added a simpler looking function (but

[julia-users] Re: Hausdorff distance

2015-10-26 Thread Andrew McLean
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.wikipedi

Re: [julia-users] Re: Hausdorff distance

2015-10-26 Thread Andrew McLean
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, pp.