✦ LIBER ✦

Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces

✍ Scribed by Dominique Attali; Jean-Daniel Boissonnat

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Linear Bound on the Complexity of the

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

A Note on Point Location in Delaunay Tri

✍ L. Devroye; E. P. Mücke; Binhai Zhu 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 83 KB

On the average length of Delaunay triang

✍ R. C. Chang; R. C. T. Lee 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 286 KB

On the complexity of polyhedral separabi

✍ Nimrod Megiddo 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 745 KB

STL file generation from digitised data

✍ Y. Zhongwei; J. Shouwei 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 340 KB

On the complexity of four polyhedral set

✍ Robert M. Freund; James B. Orlin 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 309 KB