𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Isothetic polygon representation for contours

✍ Scribed by Bin Yu; Xinggang Lin; Youshou Wu; Baozong Yuan


Publisher
Elsevier Science
Year
1992
Weight
411 KB
Volume
56
Category
Article
ISSN
1049-9660

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Contour codes of isothetic polygons
✍ Prabir Bhattacharya; Azriel Rosenfeld πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science βš– 628 KB
Hierarchical representation of 2-D shape
✍ 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

Raysβ€”New representation for polygons and
✍ W. Randolph Franklin πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science βš– 483 KB

A new data structure for storing polygons and polyhedra is presented. It can handle general cases with multiple disconnected components and nested holes with islands to an arbitrary depth. The advantage of this method is that, as in constructive solid geometry, it can support Boolean operations such