Struct FrechetDistance 

pub struct FrechetDistance;

Discrete Fréchet distance between two polygonal curves.

The Fréchet distance is informally described as the minimum leash length required for a person walking a dog, where person and dog each traverse their respective curve from start to finish without backtracking.

This implementation computes the discrete variant using dynamic programming in O(mn) time and space.

Implementations

impl FrechetDistance

pub fn compute(p: &[Vec<f64>], q: &[Vec<f64>]) -> f64

Compute the discrete Fréchet distance between curves p and q.

Each curve is given as a slice of points in ℝⁿ (represented as Vecf64`). Returns the minimum coupling distance.

pub fn compute_with_metric<M: MetricSpace<Point = Vec<f64>>>( p: &[Vec<f64>], q: &[Vec<f64>], metric: &M, ) -> f64

Compute the discrete Fréchet distance using a custom metric.

pub fn hausdorff(p: &[Vec<f64>], q: &[Vec<f64>]) -> f64

Compute the Hausdorff distance between two finite point sets.

d_H(A, B) = max(sup_{a∈A} inf_{b∈B} d(a,b), sup_{b∈B} inf_{a∈A} d(a,b))