Algorithms for optimal segmentation of regions decomposable into basic shapes

摘要

We consider optimal segmentation problem of a shape decomposable into elementary shapes in n×n pixel grid. We give efficient algorithms for segmenting shapes decomposable into base monotone regions, rectilinear star-convex regions, and digital star shaped regions.