✦ LIBER ✦

A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces

✍ Scribed by Dominique Attali; Jean-Daniel Boissonnat

Publisher: Springer
Year: 2004
Tongue: English
Weight: 387 KB
Volume: 31
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-003-2870-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of the Delaunay Triangulation

Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces

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

Tight bounds on the complexity index of

Tight bounds on the complexity index of one-point iterations

✍ J.M. Trojan 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 516 KB

Piecewise-linear bounds on the yield-poi

Piecewise-linear bounds on the yield-point load of shells∗

✍ P.G. Hodge Jr. 📂 Article 📅 1963 🏛 Elsevier Science 🌐 English ⚖ 620 KB

A Complexity Bound on Faces of the Hull

A Complexity Bound on Faces of the Hull Complex

✍ Mike Develin 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 189 KB

On the complexity of the projective clas

On the complexity of the projective classification of surfaces

✍ A. Biancofiore; E. Laura Livorni; A. J. Sommese 📂 Article 📅 1995 🏛 Springer Vienna 🌐 English ⚖ 844 KB

A bound on the plurigenera of projective

A bound on the plurigenera of projective surfaces

✍ Vincenzo Di Gennaro 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 101 KB

We exhibit a sharp Castelnuovo bound for the ith plurigenus of a smooth minimal surface of general type and of given degree d in the projective space P r , and classify the surfaces attaining the bound, at least when dr. We give similar results for surfaces not necessarily minimal or of general type