6.2             Run TRIANGLE

‘TRIANGLE’ developed by Shewchuk [2001] is one of the efficient implementation of this algorithm which provides several flexibility and options to a user. It is also computationally efficient. It takes planner straight line graph (PSLG) as input. The algorithm works in such a way that it refines the Delaunay triangulation by inserting carefully placed vertices until the generated mesh meets a provided quality and size criterion.

 

In the Options section of the dialog there are several options we can provide for the execution of the TRIANGLE. At the same time Other options can be used for the options which are not listed directly on the dialog. The available options and their purpose are listed in the table x.x. In the input poly file section browse the poly file generated in the section 6.1. A click on Run executes TRIANGLE. TRIANGLE generates four (4) output files: (1) .poly file; (2) .node file; (3) .ele file; and (4) .neigh file. They are stored in the same directory as the input poly file. It is advised to note that the value provided as minimum angle and maximum area has tremendous influence on the number of triangles generated.