I have a list of point from intersection of elements. I want to filter out the points that are above each other (X and Y same) and their Z distance is not more than a value.
To be architectural if a duct goes through on two floor element I need only the point of the upper slab intersection so lets say:
Point 1 is X=1,Y=1,Z=0
Point 2 is X=1,Y=1,Z=0,3
I need only point 2.
I’m going to have around 150000 points in the end so I think the Cartesian Product may not the best solution this case, also I was not 100% able to figure out how to filter with that.
Here is my case:
Can we do this for near by values , meaning i needs all the points in along x in one group - yet not al points are same but close , similllarlty there are many rows of points , i need to group then by the x