Terrain mesh generator in C++

1:

2:

3:

4:

4-variations.

5:

6 a: Point location GS-style. Suppose that you had a triangle that contained p and want a triangle that contains q. Or, more specifically, you have an edge of this triangle that has p on or to the left and q to the right. Implement the point location suggested by Guibas and Stolfi's paper. Demonstrate a triangulation that is not a Delaunay triangulation for which this scheme can go into an infinite loop.

CMU Quad Edge Data Structure http://www.cs.cmu.edu/afs/andrew/scs/cs/15-463/2001/pub/src/a2/quadedge.html

Cambridge Point Location http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-728.pdf

Guibas-Stolfi Paper https://sakai.unc.edu/access/content/group/cbdbd856-c63e-49aa-a4b0-9e0c88939b76/Lecture%20material/05%20Planar%20Subdivisions/guibasstolfi-85.pdf

6 b:

6 b-

6 c:

7: