pub fn euclidean_cluster_roots_from_segments(
x: &[f32],
y: &[f32],
z: &[f32],
cluster_tolerance: f32,
keys: &[(i64, i64, i64)],
point_indices: &[u32],
cell_starts: &[u32],
cell_counts: &[u32],
) -> SpatialResult<Vec<u32>>Expand description
Computes Euclidean component roots from pre-built sparse grid segments.
This is the shared component-labeling phase for GPU-backed clustering: a
backend may build and sort the sparse grid on an accelerator, then pass the
compact segment metadata here for deterministic host-side union-find. The
distance predicate and minimum-root semantics are identical to
euclidean_cluster_roots.