use crate::utils::haversine::{
haversine_km, point_to_segment_distance_km, project_local_planar_km,
};
pub fn min_distance_indices(lats: &[f64], lngs: &[f64], min_distance_km: f64) -> Vec<usize> {
let n = lats.len();
if n == 0 {
return Vec::new();
}
let mut keep = vec![0usize];
let mut prev = 0usize;
for i in 1..n {
let dist = haversine_km(lats[prev], lngs[prev], lats[i], lngs[i]);
if dist >= min_distance_km {
keep.push(i);
prev = i;
}
}
if *keep.last().expect("keep always has at least one index") != n - 1 {
keep.push(n - 1);
}
keep
}
pub fn min_time_delta_indices(times: &[f64], min_time_delta_s: f64) -> Vec<usize> {
let n = times.len();
if n == 0 {
return Vec::new();
}
let mut keep = vec![0usize];
let mut prev = 0usize;
for i in 1..n {
let delta = times[i] - times[prev];
if delta >= min_time_delta_s {
keep.push(i);
prev = i;
}
}
if *keep.last().expect("keep always has at least one index") != n - 1 {
keep.push(n - 1);
}
keep
}
pub fn max_distance_indices(lats: &[f64], lngs: &[f64], max_distance_km: f64) -> Vec<usize> {
let n = lats.len();
if n == 0 {
return Vec::new();
}
if n == 1 {
return vec![0];
}
let coords = project_local_planar_km(lats, lngs);
let mut keep_rows = vec![0usize];
let mut anchor = coords[0];
let mut buffered: Vec<(f64, f64)> = Vec::new();
for (idx, ¤t) in coords.iter().enumerate().skip(1) {
let exceeds = buffered
.iter()
.any(|&p| point_to_segment_distance_km(p, anchor, current) > max_distance_km);
if exceeds {
anchor = current;
buffered.clear();
keep_rows.push(idx - 1);
}
buffered.push(current);
}
keep_rows.push(n - 1);
keep_rows
}