✦ LIBER ✦

Contour codes of isothetic polygons

✍ Scribed by Prabir Bhattacharya

Publisher: Elsevier Science
Year: 1990
Weight: 76 KB
Volume: 49
Category: Article
ISSN: 0734-189X
DOI: 10.1016/0734-189x(90)90118-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Prabir Bhattacharya; Azriel Rosenfeld 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 628 KB

Isothetic polygon representation for con

Isothetic polygon representation for contours

✍ Bin Yu; Xinggang Lin; Youshou Wu; Baozong Yuan 📂 Article 📅 1992 🏛 Elsevier Science ⚖ 411 KB

Equilateral polygon approximation of clo

Equilateral polygon approximation of closed contours

✍ Fernando Rannou; Jens Gregor 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 741 KB

On the performance of a contour coding a

On the performance of a contour coding algorithm in the context of image coding part I: Contour segment coding

✍ Murray Eden; Michel Kocher; Member Eurasip 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 408 KB

Restoration of binary images using conto

Restoration of binary images using contour direction chain codes description

✍ Zuguang Cai 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 327 KB

Hierarchical representation of 2-D shape

Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach

✍ O. El Badawy; M.S. Kamel 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 688 KB

A concavity tree is a data structure for hierarchically representing the shape of two-dimensional silhouettes using convex polygons. In this paper, we present a new algorithm for concavity tree extraction. The algorithm is fast, works directly on the pixel grid of the shape, and uses exact convex hu