✦ LIBER ✦

On polygons circumscribing a closed convex curve

✍ Scribed by Waldemar CieŚlak; Maria Maksym; Duane DeTemple

Book ID: 112499801
Publisher: Springer
Year: 1991
Tongue: English
Weight: 308 KB
Volume: 40
Category: Article
ISSN: 0047-2468
DOI: 10.1007/bf01225869

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. 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

Polygons inscribed in a closed curve and

Polygons inscribed in a closed curve and a three-dimensional convex body

✍ V. V. Makeev 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 188 KB

Expansions of functions into Dirichlet s

Expansions of functions into Dirichlet series on closed convex polygons

✍ A. M. Sedletskii 📂 Article 📅 1979 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 602 KB

Pentagons inscribed in a closed convex c

Pentagons inscribed in a closed convex curve

✍ V. V. Makeev 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 314 KB

On a class of locally convex closed curv

On a class of locally convex closed curves

✍ Fr. Fabricius-Bjerre 📂 Article 📅 1961 🏛 Springer 🌐 English ⚖ 458 KB