The traversal distance is a generalization of Fréchet distance for the graph vs graph case. More formally, given two embedded, connected graphs
To run the program, run a command line execution in the package with format:
python3 main.py <graph 1 filename: str> <graph 2 filename: str> <epsilon: float>
Flags:
-l
type: str logs the computation of the Traversal Distance to .log files.-p
plots graph 1 and graph 2.
Sample graph and curve files can be copied and pasted into the command line.
- samples/paris/arc_de_triomphe samples/paris/vehicle
- samples/athens/groundtruth samples/athens/kevin
- samples/chicago/groundtruth samples/chicago/james
python3 main.py samples/athens/groundtruth samples/athens/kevin 300.0 -p
Dr. Carola Wenk Tulane University [email protected]
Erfan Hosseini Sereshgi Tulane University [email protected]
Will Rodman Tulane University [email protected]
Rena Repenning Morgan Stanley renarepenning.com
Emily Powers Tulane University [email protected]
Alt H., Efrat A., Rote G., and Wenk C., Matching Planer maps, Journal of Algorithms, Volume 49, Issue 2, November 2003, Pages 262-283 https://doi.org/10.1016/S0196-6774(03)00085-3
MIT License • Copyright (c) 2022 Computational Geometry @ Tulane