Weave indices from different data trees and test for longest dist b/w items in Python

Hi,

I am fairly new Python in Rhino/GH, but I am very keen to learn more. In a grid-like data tree structure as in the item below, at each point I have 4 duplicate points. There is a top and bottom grid. I would like to test the distance between the 4 duplicate points on top and the 4 on the bottom and use only the longest distance.

In essence, at the intersection between the 4 squares in the image above, I am looking for the yellow line.

Here is GH file that has the data laid out as per the diagram above.