This test requires a directory called polygons in the current working directory, filled with polygon files that follow the naming convention: <string>,<int>,<int>.

The polygon file format contains an arbitrary number of 2d polygons, with each polygon following the given format:

<vertex-count>
<vertex-x> <vertex-y>
...

The intial line of the vertex count are followed by an extra line for each vertex, containing the x and y coordinates of that vertex.

This program should be ran via the command line with java -jar. It will tesselate all the files it can find as fast as possible, then output the time results.