Computes the weak Frechet distance between two polygonal curves.

This program first solves the decision problem by computing the free space and then running depth-first search to see if there exists a path from the lower left corner to the upper right corner in the free space. The runtime of the decision procedure is O(mn), where m and n are the numbers of vertices of the input curves. 



Files for weak Frechet distance:
   wfrechet.c          (contains the main program for the decision problem)
   wfrbinsearch.c      (implements a binary search on epsilon by calling the
                      	 wfrechet executable several times)
   processdirectoryWFR (shell script that runs wfrbinsearch for a directory
                      	 of curve files)


Compile with:
   g++ -g -o wfrechet wfrechet.c
   gcc -g -o wfrbinsearch wfrbinsearch.c
   


Sample input files:
  042002022001_1.txt    (curve)
  042002022001_1.txtOUT (another curve)
  
How to run weak Frechet:
  Decision problem (you have to provide an epsilon, and it checks
  whether the weak Frechet distance is at most epsilon):

    ./wfrechet curve1 curve2 error -rev -tb

       -rev if 2nd curve should be reversed
       -tb if traceback should be computed (no need to turn this on;
           currently it does not output the traced back curve/map)

  So, for example:
    ./wfrechet 042002022001_1.txt 042002022001_1.txtOUT 100 -rev
    ./wfrbinsearch 042002022001_1.txt 042002022001_1.txtOUT -rev

  It produces the files:
         curve1WFRSTDOUT -- messages printed to STDOUT by frechet
         wfrnotes        -- contains the filename of inputcurve and
                           the computed weak Frechet distance


