COMPUTING OPTIMAL TRIANGULATIONS USING SIMULATED ANNEALING

Triangulations play an important role in approximation, CAGD, numerical analysis, and elsewhere. In this paper we are concerned with the problem of constructing triangulations which are optimal in some sense. Our aim is to show how simulated annealing can be used to search for globally optimal triangulations for a wide class of optimality criteria. We also give several examples to illustrate its performance on a variety of problems of interest in CAGD and surface fitting.