✦ LIBER ✦

Counting thin and bushy triangulations of convex polygons

✍ Scribed by S. Chattopadhyay; P.P. Das

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing bushy and thin triangulations

✍ Thomas Shermer 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 739 KB

On Minimal Triangulations of Products of

✍ Michelle Bucher-Karlsson 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 393 KB

Automatic generation of triangular grid:

✍ A. Bykat 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 636 KB

A Linear-Time Approximation Scheme for M

✍ C. Levcopoulos; D. Krznaric 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 320 KB

A Linear-Time Approximation Scheme for M

✍ Jianbo Qian; Cao An Wang 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 249 KB

On a convex hull algorithm for polygons

✍ Godfried T. Toussaint; David Avis 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 500 KB