Parallel Detection of Concavities in Cellular Blobs

摘要: This paper reports some results on the use of parallel-structured computers to detect and describe concavities in simply connected planar regions (``domains'' or ``blobs''). We show, particular, how these may be obtained by a parallel filling-in process-somewhat like pouring liquid into several cups simultaneously. It has been shown that concavity tree regular cellular blob (i.e., digitized region) can sequential algorithm finds minimum-perimeter polygon (MPP) passing through boundary cells blob. In this we show any such MPP computed sequence simultaneous local operations computer. also ratio computation times for algorithms those operating image large circular is approximately proportional square root blob's perimeter, assuming size vertex-detecting window fixed enough one more vertices MPP. filling terminates an approximation hull digitization convex original blob) finite time, subset hull.