![]() |
Fréchet View
1.6.0
A Tool for Exploring Fréchet Distance Algorithms
|
Go to the source code of this file.
Classes | |
| class | frechet::poly::DoubleEndedQueue< T > |
| A double ended queue, or "Funnel". Used by the algorithm for Shortest Paths Trees (Guibas et al.). More... | |
| struct | frechet::poly::DoubleEndedQueue< T >::Frame |
| a stack frame that tracks the necessary information for backtracking More... | |
Namespaces | |
| frechet | |
| global definitions for all algorithms. | |
| frechet::poly | |
| classes for computing the Fréchet Distance on simple polygons. | |