You are going to have to get into some serious algebraic equations here.
Unfortunately, LabVIEW does not contain any intersecting points algorithms. Additionally, unless you have a library of good math books, they are quite difficult to find.
I did find a website that had a great number of mathematical algoritms on it but I cannot remember the URL for it, or even a title or other information that may lead to this website. I'm sure you could find it if you did a search for it.
I did create an algorithm for finding the intersection of two points, but as it took my over 10 hours to create, troubleshoot and test, I cannot just give it away. I will say that it was rather difficult, and involved the use of a formula node. Of course, this algorithm was o
nly to find the intersection of two straight lines.
A trick you could use to get around this is to do a search algorithm in your two arrays to find the point between (or at) two points in the arrays where the values would be the same for each axis. It won't be easy, but it can be done. Then, an interpolation method can be applied to find the intersection, but it won't be accurate, as the points would be based on straight lines, not curves. Still, it may be close enough, unless you need higher accuracy.
I hope this helps. Good luck, and let us know how you do. Also, if you find a good website for formulae like this, please post it here.