✦ LIBER ✦

Polygonal approximation of 2-D shapes through boundary merging

✍ Scribed by Jia-Guu Leu; Limin Chen

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Shape optimization of elastic homogeneou

Shape optimization of elastic homogeneous 2D bodies by the boundary element method

✍ F. Espiga; L. Gracia; M. Doblare 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 790 KB

Approximate Lagrangian controllability f

Approximate Lagrangian controllability for the 2-D Euler equation. Application to the control of the shape of vortex patches

✍ O. Glass; T. Horsin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 398 KB