In several applications, ranging from computational geometry and finite element analysis to computer graphics, there is a need to approximate functions defined on triangular domains rather than rectangular ones. For this purpose, frequently used interpolation methods include barycentric interpolation, piecewise linear interpolation, and polynomial interpolation. However, the use of polynomial interpolation methods may suffer from the Runge phenomenon, affecting the accuracy of the approximation in the presence of equidistributed data. In these situations, the constrained mock-Chebyshev least squares approximation on rectangular domains was shown to be a successful approximation tool. In this paper, we extend it to triangular domains, by using both Waldron and discrete Leja points.
This paper is dedicated to Len Bos on the occasion of his retirement. Len, for us, is a master of mathematics and also a big friend. He introduced us to the fascinating world of "finding good interpolation nodes and effective interpolation strategies", mostly in the multivariate setting. The set of points we are using in this paper, Waldron and Leja, have been introduced to us by him and we hope that this note can be of some interest for him and all people working on approximation theory.