The results generated by the graded triangulation routine implemented in ANSI C can be seen here. The routine is integrated with the IITZeus environment which facilitates the input and output of the data. Each result of the graded triangulation routine is compared with the AFM routine already implemented earlier.
For all the results obtained by the graded triangulation shown here,
the same gradation function
is used.
It can be clearly seen from these results that the
triangulation obtained is somewhat dense around the specified boundary and
relatively sparse away from the boundary and this gradation occurs much more
smoothly than the corresponding AFM triangulation.
The time comparison between graded triangulation and AFM is not shown as it greatly depends on the number of triangles generated which is different for both the methods even for the same test data depending on the gradation function. However, in the case of same number of triangles in the output, the time difference between the two is small, AFM being only slightly faster.
It can be further concluded that the user now has a much better control over the triangulation generated by means of the gradation function to be specified, which is absent in both AFM and Delaunay triangulation.