12 December 2006 05:13:11 PM TRIANGULATION_BOUNDARY_NODES C++ version: Identify triangulation nodes that lie on the boundary. * Read a node dataset of NODE_NUM points in 2 dimensions; * Read an associated triangulation dataset of triangles using 3 or 6 nodes; * Determine which nodes are on the boundary; * Print a list of the node coordinates and indices; * Write a file of the node coordinates. Compiled on Dec 12 2006 at 16:49:19. Read the header of "channel.65.nodes.txt". Spatial dimension DIM_NUM = 2 Number of nodes NODE_NUM = 65 Read the data in "channel.65.nodes.txt". Portion of coordinate data from file: Row: 1 2 Col 1 0 0 2 1 0 3 2 0 4 3 0 5 0 1 Read the header of "channel.65.triangles6.txt". Triangle order TRIANGLE_ORDER = 6 Number of triangles TRIANGLE_NUM = 24 Read the data in "channel.65.triangles6.txt". Portion of data read from file: Row: 1 2 3 4 5 6 Col 1 5 9 11 22 23 24 2 1 10 9 25 26 27 3 2 11 10 28 29 30 4 9 10 11 26 29 23 5 5 11 13 24 31 32 Boundary nodes: New Old Index Index X and Y Coordinates 0 0 0 0 1 1 1 0 2 2 2 0 3 3 3 0 4 4 0 1 5 5 1 1 6 6 2 1 7 7 3 1 8 8 0 0.5 9 9 0.5 0 10 12 0.5 1 11 13 1.5 0 12 16 1.5 1 13 17 2.5 0 14 19 3 0.5 15 20 2.5 1 16 21 0 0.75 17 24 0.25 0 18 26 0 0.25 19 29 0.75 0 20 31 0.25 1 21 34 0.75 1 22 39 1.25 0 23 43 1.75 0 24 45 1.25 1 25 48 1.75 1 26 53 2.25 0 27 57 2.75 0 28 59 2.25 1 29 60 3 0.25 30 62 2.75 1 31 64 3 0.75 Created the boundary node coordinate file "boundary_nodes.txt" TRIANGULATION_BOUNDARY_NODES: Normal end of execution. 12 December 2006 05:13:11 PM