A triangulation method for the interpolation of a scattered data set
This thesis is devoted to the study of numerical comparison with respect to the efficiency, storage requirements, and accuracy of various Triangulation methods for the problem of fitting a function to a set of scattered data. In particular, we propose a Triangulation algorithm that is more efficient than C. L. Lawson's Triangulation Method, one of the bestknown methods available in the literature. An attractive feature of the proposed algorithm is the small on-line storage requirement. Even with a fairly large amount of data, no external reads or writes to disk are required. It is believed that the study, especially the software presented in this thesis, will be of some practical value to the engineering community.