![]() |
Fréchet View
1.6.0
A Tool for Exploring Fréchet Distance Algorithms
|
#include <freespace.h>
#include <app/workerthread.h>
#include <exception>
#include <stack>
#include <functional>
#include <QMutex>
Go to the source code of this file.
Classes | |
class | frechet::k::MappedInterval |
attaches a component ID to an interval More... | |
class | frechet::k::kAlgorithm |
The k-Frechet algorithm. More... | |
struct | frechet::k::kAlgorithm::WorkingSet |
Current working set of mapped intervals. Horizontal intervals are mapped to the range [0..n] Vertical intervals are mapped to the range [n..n+m]. More... | |
struct | frechet::k::kAlgorithm::Greedy |
Results of the Greedy algorithm. More... | |
struct | frechet::k::kAlgorithm::BruteForce |
results of the brute-force algorithm More... | |
class | frechet::k::KWorkerJob |
background worker job for running the k-Frechet brute-force algorithm. More... | |
Namespaces | |
frechet | |
global definitions for all algorithms. | |
frechet::k | |
classes for computing the k-Fréchet Distance. | |
Typedefs | |
typedef std::vector< MappedInterval > | frechet::k::IntervalMap |
a vector of MappedInterval objects. Usually these are sorted according to the natural ordering imposed by MappedInterval::operator< More... | |