Lexicographic Fréchet Matchings with Degenerate Inputs
The classical Fréchet distance is the minimal connecting distance needed to monotonically traverse two paths completely. Lexicographic Fréchet matchings utilize the steepest descent and apply the Fréchet distance recursively (i.e. divide and conquer) to minimize the time spent at a distance greater than a threshold. We take a deep dive into degenerate inputs where different matchings appear equal when viewed at a distance. The problem of choosing one of the multiple paths through critical events at the same distance is investigated. Multiple critical events are compared using derivatives and second derivatives.