06 May 2020 12:22:16 PM TRIANGULATION_DELAUNAY_DISCREPANCY: C++ version: Compiled on May 6 2020 at 12:21:55. 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 "ten3_nodes.txt". Spatial dimension DIM_NUM = 2 Number of nodes NODE_NUM = 10 Read the data in "ten3_nodes.txt". First 5 nodes: Row: 1 2 Col 1 0 4 2 1 13 3 4 7 4 5 2 5 6 15 Read the header of "ten3_elements.txt". Triangle order TRIANGLE_ORDER = 3 Number of triangles TRIANGLE_NUM = 10 Read the data in "ten3_elements.txt". First 10 triangles: Row: 1 2 3 Col 1 1 4 7 2 1 7 3 3 3 7 9 4 1 3 2 5 3 10 6 6 2 3 6 7 3 9 10 8 2 6 10 9 2 10 5 10 5 10 8 MESH_BASE_ZERO: The element indexing appears to be 1-based! This will be converted to 0-based. First 10 triangle neighbors: Row: 1 2 3 Col 1 -2 1 -2 2 2 3 0 3 -2 6 1 4 5 -2 1 5 7 5 6 6 4 7 3 7 -2 4 2 8 4 8 5 9 9 -2 7 10 -2 -2 8 Discrepancy (degrees) = 0 Minimum angle (degrees) = 9.97771 occurred in triangle 4 Maximum angle (degrees) = 156.161 occurred in triangle 4 TRIANGULATION_DELAUNAY_DISCREPANCY: Normal end of execution. 06 May 2020 12:22:16 PM 06 May 2020 12:22:16 PM TRIANGULATION_DELAUNAY_DISCREPANCY: C++ version: Compiled on May 6 2020 at 12:21:55. 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". First 5 nodes: Row: 1 2 Col 1 0 4 2 1 13 3 4 7 4 5 2 5 6 15 Read the header of "ted3_elements.txt". Triangle order TRIANGLE_ORDER = 3 Number of triangles TRIANGLE_NUM = 10 Read the data in "ted3_elements.txt". First 10 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 6 6 3 7 7 6 7 9 8 5 6 8 9 10 6 9 10 8 6 10 MESH_BASE_ZERO: The element indexing appears to be 1-based! This will be converted to 0-based. First 10 triangle neighbors: Row: 1 2 3 Col 1 1 3 -2 2 -2 2 0 3 -2 5 1 4 4 -2 0 5 5 7 3 6 2 6 4 7 -2 8 5 8 9 -2 4 9 6 -2 9 10 8 -2 7 Discrepancy (degrees) = 0 Minimum angle (degrees) = 26.9958 occurred in triangle 6 Maximum angle (degrees) = 100.305 occurred in triangle 0 TRIANGULATION_DELAUNAY_DISCREPANCY: Normal end of execution. 06 May 2020 12:22:16 PM