pub fn group_temporal_join(
trajectories: &[(u64, &[(i64, &[f32])])],
epsilon: f32,
min_entities: usize,
window_us: i64,
) -> Result<Vec<GroupJoinResult>, AnalyticsError>Expand description
Find time windows where at least min_entities from the group converge.
For each window, computes all pairwise distances and finds the largest
subset within distance epsilon of each other.
§Arguments
trajectories—(entity_id, trajectory)pairsepsilon— Maximum distance thresholdmin_entities— Minimum number of entities that must convergewindow_us— Sliding window size in microseconds
§Errors
Returns AnalyticsError::InsufficientData if fewer than min_entities
trajectories are provided.