✦ LIBER ✦

The expected convex hull trimmed regions of a sample

✍ Scribed by Ignacio Cascos

Publisher: Springer
Year: 2007
Tongue: English
Weight: 327 KB
Volume: 22
Category: Article
ISSN: 0943-4062
DOI: 10.1007/s00180-007-0095-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ON THE COMPUTATION OF THE DIGITAL CONVEX

ON THE COMPUTATION OF THE DIGITAL CONVEX HULL AND CIRCULAR HULL OF A DIGITAL REGION

✍ B.B. CHAUDHURI; A. ROSENFELD 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 250 KB

The problems of defining convexity and circularity of a digital region are considered. A new definition of digital convexity, called DL-(digital line) convexity, is proposed. A region is DL-convex if, for any two pixels belonging to it, there exists a digital straight line between them all of whose

On the Expected Number of Shadow Vertice

On the Expected Number of Shadow Vertices of the Convex Hull of Random Points

✍ K.-H. Küfer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 287 KB

Finding the convex hull of a simple poly

Finding the convex hull of a simple polygon

✍ Ronald L Graham; F Frances Yao 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Finding the convex hull of a simple poly

Finding the convex hull of a simple polygon

✍ Jack Sklansky 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Computing the convex hull of a simple po

Computing the convex hull of a simple polygon

✍ Chern-Lin Chen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 337 KB

The convex hull of a typical compact set

✍ J. A. Wieacker 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 422 KB