✦ LIBER ✦

On the time complexity for circumscribing a convex polygon

✍ Scribed by Tony C. Woo; Hyun-Chan Lee

Publisher: Elsevier Science
Year: 1985
Weight: 120 KB
Volume: 29
Category: Article
ISSN: 0734-189X
DOI: 10.1016/0734-189x(85)90143-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the time complexity for circumscribin

On the time complexity for circumscribing a convex polygon

✍ Tony C Wood; Hyun-Chan Lee 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 68 KB

A recent article "Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition" by Dori and Ben-Bassat, Comput. Vision Graph. Image Process. 24, 1983, 131-159, raised several interesting questions including the time complexity of their algorithm. In this paper, the time com

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

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

On the uniqueness of the representation

On the uniqueness of the representation of a convex polygon by its Hough transform

✍ Dimitrios Ioannou; Edward T. Dugan; Andrew F. Laine 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 381 KB

On a convex hull algorithm for polygons

On a convex hull algorithm for polygons and its application to triangulation problems

✍ Godfried T. Toussaint; David Avis 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 500 KB

A lower bound on the number of unit dist

A lower bound on the number of unit distances between the vertices of a convex polygon

✍ Herbert Edelsbrunner; Péter Hajnal 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 218 KB