im trying to find the closest point to a collection point using the “brute force” method of finding all distances to all points (cross product lacing) and get the minimum (sort distances and take first), but now i dont know how to take the points that correspond to that minimum distance. I think i need to use “sort by key” to synchronously sync the distance list and the second point lists, but t i dont know how to use it and i couldnt open examples files in https://github.com/ikeough/Dynamo/tree/master/test/core/list
any help? or maybe another way to find closest points to a point collection?
here screen and file: