We consider the optimization problem of finding k nonintersecting rectangles and tableaux in n × n pixel plane where each pixel has a real valued weight. We discuss existence of efficient algorithms if a corner point of each rectangle/tableau is specified.
- Combinatorial optimization
- computational geometry
- image segmentation
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics