✦ LIBER ✦

An algorithm for polygonal approximation of a digital object

✍ Scribed by Abolfazl Sirjani; George R Cross

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 274 KB
Volume: 7
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(88)90070-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 O(N) algorithm for polygonal approxim

An O(N) algorithm for polygonal approximation

✍ L.P Cordella; G Dettori 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 263 KB

An algorithm for polygonal approximation

An algorithm for polygonal approximation based on iterative point elimination

✍ Arie Pikaz; Its'hak Dinstein 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Algorithms for testing convexity of digi

Algorithms for testing convexity of digital polygons

✍ Reinhard Klette; E.V Krishnamurthy 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 448 KB

A fast sequential method for polygonal a

A fast sequential method for polygonal approximation of digitized curves

✍ Karin Wall; Per-Erik Danielsson 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 95 KB

An Optimal Algorithm for the Straight Se

An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs

✍ Y.M. Sharaiha; N. Christofides 📂 Article 📅 1993 🏛 Elsevier Science ⚖ 842 KB

In this paper, we define the straight segment approximation problem (SSAP) for a given digital arc as that of locating a minimum subset of vertices on the arc such that they form a connected sequence of digital straight segments. Sharaiha (Ph.D. thesis, Imperial College, London, 1991) introduced the