Coded up the basics of a parallel triangle mesher. So far it can
just simply generate a seed triangle, and a lot of the framework
is there for the more complicated parts of the algorithm to come
Changed up how some data is managed in the triangle complex
Added code to sort and find edges/vertices which are incomplete to
the basic_triangle_mesher algorithm
The basic triangular mesher works!
Wrote delaunay edge flipping algorithm and tested on a bunch of
random vertex sets
Added kd-tree functionality and ran some tests. The code needs to be
reviewed and there are places that speed improvements can be made, but
it doesn't look like any bugs have been introduced to the algorithms
(i.e. the triangulations still look good), and it is a lot faster than
before.
Minor change to the way that the initial kd prism is computed
I forgot to check in the prism code before
Merge branch 'master' of https://github.com/shenron7/TriangleMesher