Struct FrechetDistanceApprox 

pub struct FrechetDistanceApprox { /* private fields */ }

Compute the discrete Fréchet distance between two polygonal chains P and Q. Uses dynamic programming: O(mn) time and space. The discrete Fréchet distance is an upper bound on the continuous Fréchet distance.

Implementations

impl FrechetDistanceApprox

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

Compute the discrete Fréchet distance between P and Q.

pub fn table(&self) -> &Vec<Vec<f64>>

Return the full DP table (for inspection / debugging)

pub fn decide(p: &[Point2D], q: &[Point2D], delta: f64) -> bool

Decide if the discrete Fréchet distance is at most delta using a decision-version DP (faster in practice when delta is known).