20 September 2024 02:40:46 PM TRIANGULATION_CORNER C++ version: Read a node file of NODE_NUM point coordinates in 2 dimensions. Read an associated triangle file of TRIANGLE_NUM triangles, listing 3 or 6 node indices. Any triangle which has exactly two sides on the boundary is a corner triangle. If there are any corner triangles this program tries to eliminate them. The "repaired" triangle file is written out. Compiled on Sep 20 2024 at 14:36:26. Read the header of "p10_nodes.txt". Spatial dimension DIM_NUM = 2 Number of nodes NODE_NUM = 130 Read the data in "p10_nodes.txt". First 5 nodes: Row: 1 2 Col 1 0 0 2 0 1 3 1 0 4 1 1 5 0.084188 -0 Read the header of "p10_elements.txt". Triangle order TRIANGLE_ORDER = 3 Number of triangles TRIANGLE_NUM = 212 Read the data in "p10_elements.txt". First 5 triangles: Row: 1 2 3 Col 1 16 15 2 2 21 10 22 3 21 10 9 4 27 16 15 5 27 16 28 MESH_BASE_ZERO: The element indexing appears to be 1-based! This will be converted to 0-based. Number of boundary sides Number of triangles 0 172 1 36 2 4 3 0 TRIANGULATION_CORNER: Reoriented 103 triangles. Adjusting triangle 1 using triangle 4 Adjusting triangle 9 using triangle 55 Adjusting triangle 67 using triangle 68 Adjusting triangle 118 using triangle 50 TRIANGULATION_CORNER: New triangle file with repaired corners written to "p10_corner_triangles.txt". TRIANGULATION_CORNER: New node coordinate file with adjusted midside nodes written to "p10_corner_nodes.txt". TRIANGULATION_CORNER: Normal end of execution. 20 September 2024 02:40:46 PM