CloudCompare forum

Thank you for your answer. I recognize that my first request with 2 conditions is not simple to achieve if one wants to remain efficient. I've been thinking for quite some time about how to get around this problem, for example by using octree levels (one representative per cell, working with the n³ ...

Hello, If it existed, I would also like to work with a defined number of k-nearest neighbors in a given radius. This would be very useful when working with multi-scale detection and would probably reduce the computation time (200 - 400 mio points). I am also looking for a tool that allows me to comp...

Yes, it works!
Thank's
Daniel

Hello,
Thank you very much for your fantastic product.
I have a question about the "cross-section" function:
Is it possible to calculate the projection of the selected points by "cross-section" on the defined plane?
Do you have a tipp to efficiently produce this operation?
DanielR