An algorithm for constructing locally optimal min-max triangulation
M. Shrivastava · Bulletin of the Australian Mathematical Society · 1996
Several interesting criteria for constructing triangulations associated with a given set of points in a plane have been introduced. In order to obtain optimal triangula-tion with respect to the min-max-angle criterion, it is essential to study the nature of neutral cases with respect to the criterion. Our aim in this paper is to establish precise equations for neutral set curves with respect to the min-max-angle criterion and to develop an algorithm to obtain a locally optimal triangulation with respect to the criterion.