forked from STEMLab/frechet-processor
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathREADME.txt
20 lines (12 loc) · 936 Bytes
/
README.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
## How to compile the program
Go to project folder and compile using maven:
$ mvn package
## How to run
In target directory of project folder you will find run.jar. Run using line command:
$ java -jar run.jar {path to dataset.txt} {path to queries.txt} {path to result folder}
## Main Idea
In order to process queries to find trajectories in given Fréchet distance bounds, our solution use Fréchet distance decision algorithm, R*-index indexing for trajectory start points, Straight Foward Simplification algorithm for line simplification, and discrete Fréchet distance decision algorithm too.
Some useful theory was applied to project :
* Fréchet distance between two trajectories is equal or longer than both distances between start points and end points.
* After simplification, Fréchet distance is bounded by simplification parameter.
* Discrete Fréchet distance must be equal or longer than normal Fréchet distance.