✦ LIBER ✦

On Polygons circumscribed about a Cuspidal Cubic

✍ Scribed by Roberts, R. A.

Book ID: 120104963
Publisher: Oxford University Press
Year: 1881
Tongue: English
Weight: 175 KB
Volume: s1-13
Category: Article
ISSN: 0024-6115
DOI: 10.1112/plms/s1-13.1.148

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Polygons Circumscribed about a Conic

On Polygons Circumscribed about a Conic and Inscribed in a Cubic

✍ Roberts, R. A. 📂 Article 📅 1885 🏛 Oxford University Press 🌐 English ⚖ 422 KB

On Polygons circumscribed about a Tricus

On Polygons circumscribed about a Tricuspidal Quartic

✍ Roberts, R. A. 📂 Article 📅 1882 🏛 Oxford University Press 🌐 English ⚖ 236 KB

On Polygons inscribed in a Quadric and c

On Polygons inscribed in a Quadric and circumscribed about two Confocal Quadrics

✍ Roberts, R. A. 📂 Article 📅 1886 🏛 Oxford University Press 🌐 English ⚖ 305 KB

On polygons circumscribing a closed conv

On polygons circumscribing a closed convex curve

✍ Waldemar CieŚlak; Maria Maksym; Duane DeTemple 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 308 KB

On the time complexity for circumscribin

On the time complexity for circumscribing a convex polygon

✍ Tony C. Woo; Hyun-Chan Lee 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 120 KB

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