There's a [Point Groups] component which finds all clusters within a point collection whose members are at most x units away from neighbouring points. However it doesn't ensure the entire group is smaller than some threshold.
You may also be interested in [Proximity 3D] component which finds neighbours for each point with possible constraints on number of neighbours and lower/upper distances.
David Rutten
There's a [Point Groups] component which finds all clusters within a point collection whose members are at most x units away from neighbouring points. However it doesn't ensure the entire group is smaller than some threshold.
You may also be interested in [Proximity 3D] component which finds neighbours for each point with possible constraints on number of neighbours and lower/upper distances.
Oct 28, 2016