Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation
Document Type
Conference Proceeding
Publication Date
1-1-2003
Description
Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points.
Citation Information
Dyer, Bradley W.; and Hong, Don. 2003. Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation. Journal of Computational Analysis and Applications. Vol.5(1). 25-43. https://doi.org/10.1023/A:1021474005094 ISSN: 1521-1398