One strike against the min-max degree triangulation problem

Bern, 1992, Edge insertion for optimal triangulations, Proc. Latin America Theoretical Informat. Edelsbrunner, 1990, An O(n2logn) time algorithm for the min-max angle triangulation, Proc. 6th Ann. Sympos. Comput. Geom., 44 Edelsbrunner, 1991, A quadratic time algorithm for the min-max length triangulation, Proc. 32nd Ann. Sympos. Found. Comp. Sci., 414, 10.1109/SFCS.1991.185400 Edelsbrunner, 1991 Frey, 1991, Mesh relaxation: a new technique for improving triangulations, Internat. J. Numer. Methods Engrg., 31, 1121, 10.1002/nme.1620310607 Garey, 1979 Kant, 1992, Triangulating planar graphs while minimizing the maximum degree, Proc. 3rd Sca. Workshop Algorithm Theory, LNCS 621, 258 Lichtenstein, 1982, Planar formulae and their uses, SIAM J. Comput., 11, 320, 10.1137/0211025 Lloyd, 1977, On triangulations of a set of points in the plane, Proc. 18th Ann. IEEE Sympos. Found. Comput. Sci., 228 Rosenstiehl, 1986, Rectilinear planar layouts of planar graphs and bipolar orientations, Discrete Comput. Geom., 1, 343, 10.1007/BF02187706