Computing Regions Decomposable into m Stars

  title={Computing Regions Decomposable into m Stars},
  author={Matt Gibson and Kasturi R. Varadarajan and Xiaodong Wu},
Motivated by an approach to image segmentation, we consider an optimization problem on a node-weighted planar grid graph, that of finding a maximum weight subset of nodes that can be partitioned into m subsets, each with a simple geometric structure. The problem has been considered in earlier papers, which give polynomial time algorithms for m = 2. We show that the problem admits a polynomial time algorithm for any fixed m ≥ 3. 


Publications citing this paper.