摘要: Presents an iterative parallel procedure for computing concavity trees of a digital shape in multi-resolution structure. The pattern is, at all resolution levels, covered by almost convex polygon, closely fitting the itself. When polygons have been created, hierarchical structure is built, which points out relations among concavities different levels. Also some properties characterizing added regions are computed. On highest level, meta-concavity tree built up. This can be used to analyse and hierarchically rank concavities. >