✦ LIBER ✦

Algorithms for testing convexity of digital polygons

✍ Scribed by Reinhard Klette; E.V Krishnamurthy

Publisher: Elsevier Science
Year: 1981
Weight: 448 KB
Volume: 16
Category: Article
ISSN: 0146-664X
DOI: 10.1016/0146-664x(81)90055-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new linear algorithm for intersecting

A new linear algorithm for intersecting convex polygons

✍ Joseph O'Rourke; Chi-Bin Chien; Thomas Olson; David Naddor 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 82 KB

A new linear algorithm for intersecting

A new linear algorithm for intersecting convex polygons

✍ Joseph O'Rourke; Chi-Bin Chien; Thomas Olson; David Naddor 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 520 KB

An algorithm for polygonal approximation

An algorithm for polygonal approximation of digitized curves

✍ Bimal Kr. Ray; Kumar S. Ray 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 602 KB

An algorithm for polygonal approximation

An algorithm for polygonal approximation of a digital object

✍ Abolfazl Sirjani; George R Cross 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 274 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

An exact construction of digital convex

An exact construction of digital convex polygons with minimal diameter

✍ Sneẑana Matić-Kekić; Dragan M. Acketa; Joviša D. Žunić 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 489 KB

Given a natural number n, an exact formula is derived for the minimal possible size MD(n) of a square grid, in which a digital convex n-gon can be inscribed. An exact construction of a digital convex n-gon which can be inscribed into a square grid of size MD(n) is also given.