✦ LIBER ✦

On bit reduction of chain coded line drawings

✍ Scribed by P.A Sundar Raj; Jack Koplowitz

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 231 KB
Volume: 4
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(86)90030-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vectograph coding; Efficient coding of l

Vectograph coding; Efficient coding of line drawing

✍ Michael S Landy; Yoav Cohen 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 99 KB

On the efficiency of two-bit link chain-

On the efficiency of two-bit link chain-code

✍ Per-Erik Danielsson 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 75 KB

On combinatorial structures of line draw

On combinatorial structures of line drawings of polyhedra

✍ Hiroshi Imai 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 672 KB

Note on the determination of a digital s

Note on the determination of a digital straight line from chain codes

✍ R Shoucri; R Benesch; S Thomas 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 52 KB

A note on graphics editing of curved lin

A note on graphics editing of curved line drawings

✍ D.J Walton 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 387 KB

Editing of curved line drawings such as contour maps is operationally different than the editing of text or patterns. Existing techniques for the editing of line drawings are based on locating, replacing, and deleting blocks of patterns. Such techniques are not always convenient for users who wish t

On-line chain partitions of orders

✍ Stefan Felsner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 698 KB

We analyze the on-line chain partitioning problem as a two-person game. One person builds an order one point at a time. The other person responds by making an irrevocable assignment of the new point to a chain of a chain partition. Kierstead gave a strategy showing that width k orders can be on-line