6 September 2009 2:33:19.753 PM TRIANGULATION_DELAUNAY_DISCREPANCY FORTRAN90 version Read a node dataset of NODE_NUM points in 2 dimensions. Read an associated triangulation dataset of TRIANGLE_NUM triangles using 3 or 6 nodes. Determine the Delaunay discrepancy, that is, the amount by which the minimum angle in the triangulation could be changed by a single adjustment of a pair of triangles. If this discrepancy is negative, then the triangulation is not a Delaunay triangulation. If this discrepancy is 0 or essentially so, then the triangulation is a Delaunay triangulation. Read the header of "ted3_nodes.txt". Spatial dimension DIM_NUM = 2 Number of nodes NODE_NUM = 10 Read the data in "ted3_nodes.txt". Coordinates of first 5 nodes: Row 1 2 Col 1 0.00000 4.00000 2 1.00000 13.0000 3 4.00000 7.00000 4 5.00000 2.00000 5 6.00000 15.0000 Read the header of "ted3_triangles.txt". Triangle order TRIANGLE_ORDER = 3 Number of triangles TRIANGLE_NUM = 10 Read the data in "ted3_triangles.txt". First 5 triangles: Row 1 2 3 Col 1 2 1 3 2 3 1 4 3 3 4 7 4 2 3 5 5 5 3 6 First 5 triangle neighbors: Row 1 2 3 Col 1 2 4 -1 2 -1 3 1 3 -1 6 2 4 5 -1 1 5 6 8 4 Delaunay discrepancy = 0.00000 Minimum angle (degrees) = 26.9958 occurred in triangle 7 Maximum angle (degrees) = 100.305 occurred in triangle 1 TRIANGULATION_DELAUNAY_DISCREPANCY: Normal end of execution. 6 September 2009 2:33:19.759 PM