Many computer vision problems, such as gure-ground segmentation, simultaneous tting of curves, selection of an optimal set of geometric primitives, can be formulated naturally as discrete optimization problems. The statement of these problems is relatively easy, but to nd techniques that eeciently solve them constitutes a major challenge. In this paper we focus on gure-ground segmentation. We p...