✦ LIBER ✦

Computing the external geodesic diameter of a simple polygon

✍ Scribed by D. Samuel; G. T. Toussaint

Publisher: Springer Vienna
Year: 1990
Tongue: English
Weight: 836 KB
Volume: 44
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02247961

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the geodesic center of a simpl

Computing the geodesic center of a simple polygon

✍ R. Pollack; M. Sharir; G. Rote 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 945 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

Computing the link center of a simple po

Computing the link center of a simple polygon

✍ W. Lenhart; R. Pollack; J. Sack; R. Seidel; M. Sharir; S. Suri; G. Toussaint; S. 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 778 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

Computing a maxian point of a simple rec

Computing a maxian point of a simple rectilinear polygon

✍ D.P. Wang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 189 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