-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathfrechet.h
41 lines (23 loc) · 847 Bytes
/
frechet.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#ifndef FRECHET_H
#define FRECHET_H
#include <cstdlib>
#include <vector>
#include <map>
#include <cassert>
#include <geometry.h>
#include <input.h>
#include <spatial.h>
using namespace std;
namespace mmatch
{
static const size_t NN_NUMBER_GLOBAL = 50;
static const double MAX_ERROR_GLOBAL = 200;
static const double MAX_CONSIDERED_AREA = 150*150;
const size_t NUM_PARTS = 10;
static const size_t BUCKETS = 100000;
//! frechet-based algorithm
Output match_frechet(const RoadGraph &graph, ISpatialIndex *index, const Input &input, const double max_error2 = MAX_CONSIDERED_AREA);
//! frechet-based algorithm, based on the output, can re-split the input into several parts
Output match_frechet_smart(const RoadGraph &graph, ISpatialIndex *index, const Input &input, size_t num_retries = 1);
} // namespace mmatch
#endif // FRECHET_H