I have two sets of points- list A and list B. I need to efficiently select the points from list B that are furthest from points in list A.
The reason Near Table isn't working out is because of the number of (redundant) records showing the distance of each point on list B to every single point on list A. That's 9000 entries (A) x 500 entries (B) for a total of 4,500,000 records generated by the near table.
I would like to end up with an ordered list of points from list B that are furthest away from any points on list A.
It seems like a simple thing to ask but not so simple to do.
How can I approach this?