✦ LIBER ✦

Triangulating multiply-connected polygons: A simple, yet efficient algorithm.

✍ Scribed by Remi P. Ronfard; Jarek R. Rossignac

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithm and data structure for triangu

✍ Les A. Piegl; Arnaud M. Richard 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 813 KB

A fast las vegas algorithm for triangula

✍ Kenneth L. Clarkson; Robert E. Tarjan; Christopher J. Wyk 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 572 KB

A Randomized Algorithm for Triangulating

✍ N. M. Amato; M. T. Goodrich; E. A. Ramos 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 220 KB

A simple and fast incremental randomized

✍ Raimund Seidel 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 881 KB

Reprint of: A simple and fast incrementa

✍ Raimund Seidel 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Erratum: An $O(n\log \log n)$-Time Algor

✍ Tarjan, Robert E.; Van Wyk, Christopher J. 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 60 KB