✦ LIBER ✦

Computing the convex hull of line intersections

✍ Scribed by Mikhail J Atallah

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 173 KB
Volume: 7
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(86)90010-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the convex hull in a hammock

✍ Y.L. Wang; R.C.T. Lee; J.S. Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 794 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

On the computer generation of random con

On the computer generation of random convex hulls

✍ Luc Devroye 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 929 KB

The Convex-hull-and-k-line Travelling Sa

The Convex-hull-and-k-line Travelling Salesman Problem

✍ Vladimir G. Deĭneko; Gerhard J. Woeginger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 651 KB

On the definition and computation of rec

On the definition and computation of rectilinear convex hulls

✍ Thomas Ottmann; Eljas Soisalon-Soininen; Derick Wood 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 747 KB

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