use crate::utils::haversine::project_local_planar_km;
use super::corridor::farthest_feasible_index;
pub fn imai_iri_indices(lats: &[f64], lngs: &[f64], epsilon_km: f64) -> Vec<usize> {
let n = lats.len();
if n <= 2 {
return (0..n).collect();
}
let coords = project_local_planar_km(lats, lngs);
let farthest_reach: Vec<usize> = (0..n - 1)
.map(|i| farthest_feasible_index(&coords, i, epsilon_km))
.collect();
let mut path = vec![0usize];
let mut anchor = 0usize;
while anchor < n - 1 {
let limit = farthest_reach[anchor];
if limit >= n - 1 {
path.push(n - 1);
break;
}
let mut best = anchor + 1;
let mut best_reach = farthest_reach[best];
for (candidate, &reach) in farthest_reach
.iter()
.enumerate()
.take(limit + 1)
.skip(anchor + 2)
{
if reach > best_reach {
best = candidate;
best_reach = reach;
}
}
path.push(best);
anchor = best;
}
path
}