Vea descripciones del problema en Xu (1998),Levcopoulos (2008), y De Loera, Rambau y Santos (2010). Xu, Yin-Feng (1998), «Minimum weight triangulations», Handbook of Combinatorial Optimization, Vol. 2, Boston, MA: Kluwer Academic Publishers, pp. 617-634, MR1665412.. Levcopoulos, Christos (2008), «Minimum Weight Triangulation», en Kao, Ming-Yang, ed., Encyclopedia of Algorithms, Springer, pp. 546-548, ISBN978-0-387-30770-1.. De Loera, Jesús A.; Rambau, Jörg; Santos, Francisco (2010), «3.2.3 Greedy and minimum weight triangulations», Triangulations: Structures for Algorithms and Applications, Algorithms and Computation in Mathematics 25, Springer, pp. 102-107, ISBN978-3-642-12970-4..
See also Manacher y Zobrist (1979). Manacher, Glenn K.; Zobrist, Albert L. (1979), «Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation», Information Processing Letters9 (1): 31-34, MR537055, doi:10.1016/0020-0190(79)90104-2..
See also Manacher y Zobrist (1979). Manacher, Glenn K.; Zobrist, Albert L. (1979), «Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation», Information Processing Letters9 (1): 31-34, MR537055, doi:10.1016/0020-0190(79)90104-2..
Lingas (1986). Lingas, Andrzej (1986), «The Greedy and Delaunay triangulations are not bad in the average case», Information Processing Letters22 (1): 25-31, doi:10.1016/0020-0190(86)90038-4..