For a given distance matrix D, we determine an optimal cutoff distance τ * by analyzing the mutual information between points at varying distance thresholds. We first discretize the distance domain into a set of potential thresholds τ that span the point distances. For each threshold, we construct a binary relationship matrix R ∈ {0, 1} n×n defined as: