Hello
I was wondering if anyone has any thoughts on how to merge points which are close to one another? Finding the average of close points from a list of points? Perhaps something to do with cull duplicateS?
Thanks again to this forum and all the great help.
‘Vector | Points | Cull Duplicates’, AKA CullPt
Of course, it’s not quite that simple when the points are in separate branches… Which is why posting your GH code/geometry is so important.
P.S. You’ll need to flatten your list of points to cull the duplicates, then use ‘Closest Point’ on the original tree to find the closest point from the culled list.
Amazing thank you, it’s great to add these little tricks to my reportoire.
