Hi!

I would like a way to detect what point in my neighbours array that are across a primitive instead of being on same border.

-Olivier

Anyone?

-Olivier

if your primitives are always a parallelogram then your last point of the array will always be the opposite corner, since it is always the farthest.

neighbours function returns a list from nearest to farthest.

That's good to know!

Thanks.

-Olivier

BabaJ
neighbours function returns a list from nearest to farthest.

I don't think this is true
I'd say neighbours order is dependent on topology rather than distance (unlike distance based point cloud searches pcfind, nearpoints, etc. where this would apply )

but to get the farthest neighbour, you can run them through the loop and find it that way

I don't think this is true

You are right…I was mixing it up with the nearpoints function