✦ LIBER ✦

Computing the convex hull of a simple polygon

✍ Scribed by Chern-Lin Chen

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 337 KB
Volume: 22
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(89)90023-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the convex hull of a simple poly

Finding the convex hull of a simple polygon in linear time

✍ S.Y. Shin; T.C. Woo 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Computing the convex hull in a hammock

✍ Y.L. Wang; R.C.T. Lee; J.S. Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 794 KB

A Note on Computing the Visibility Polyg

A Note on Computing the Visibility Polygon from a Convex Chain

✍ Subir Kumar Ghosh 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 104 KB

A counter-example to a convex hull algor

A counter-example to a convex hull algorithm for polygons

✍ Godfried Toussaint 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Computing a median point of a simple rec

Computing a median point of a simple rectilinear polygon

✍ Victor Chepoi; Feodor Dragan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Optimally Computing the Shortest Weakly

Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon

✍ Danny Z. Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Given an n-vertex simple polygon P, the problem of computing the shortest weakly visible subedge of P is that of finding a shortest line segment s on the Ž . boundary of P such that P is weakly visible from s if s exists . In this paper, we present new geometric observations that are useful for solv