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
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
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