✦ LIBER ✦

The linear time recognition of digital arcs

✍ Scribed by Peter Damaschke

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 414 KB
Volume: 16
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(95)00127-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the recognition of digital circles in

On the recognition of digital circles in linear time

✍ Peter Sauer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 792 KB

Simple linear time recognition of unit i

Simple linear time recognition of unit interval graphs

✍ Derek G Corneil; Hiryoung Kim; Sridhar Natarajan; Stephan Olariu; Alan P Sprague 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 560 KB

Recognition of q-Horn formulae in linear

Recognition of q-Horn formulae in linear time

✍ Endre Boros; Peter L. Hammer; Xiaorong Sun 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 839 KB

Finite-time-domain synthesis of linear t

Finite-time-domain synthesis of linear time-variant digital filters by difference equations

✍ Dongning Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 648 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

A simple linear-time algorithm for the r

A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs

✍ Fillia Makedon; Dafna Sheinwald; Yaron Wolfsthal 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 382 KB