✦ LIBER ✦

Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation

✍ Scribed by Glenn K. Manacher; Albert L. Zobrist

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note – On the Number of Triangulations o

✍ Raimund Seidel 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 110 KB

A Tight Bound for the Delaunay Triangula

✍ Amenta, Nina; Attali, Dominique; Devillers, Olivier 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 728 KB

An optimal parallel algorithm for triang

✍ Ed Merks 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 510 KB

A Linear Bound on the Complexity of the

✍ Dominique Attali; Jean-Daniel Boissonnat 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 387 KB

Computing the minimum weight triangulati

✍ Henk Meijer; David Rappaport 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Optimal algorithms for finding the symme

✍ P.T. Highnam 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 288 KB