The problem of decomposing a pixel grid into base-monotone regions was first studied in the context of image segmentation. It is known that for a given pixel grid and baselines, one can compute in polynomial time a maximum-weight region that can be decomposed into disjoint base-monotone regions [Chun et al. ISAAC 2009]. We continue this line of research and show the NP-hardness of the problem of optimally locating k baselines in a given n ×n pixel grid. We also present an O(n3)-time 2-approximation algorithm for this problem. We then study two related problems, the k base-segment problem and the quad-decomposition problem, and present some complexity results for them. © 2013 Springer-Verlag.
CITATION STYLE
Chun, J., Horiyama, T., Ito, T., Kaothanthong, N., Ono, H., Otachi, Y., … Uno, T. (2013). Base location problems for base-monotone regions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7748 LNCS, pp. 53–64). https://doi.org/10.1007/978-3-642-36065-7_7
Mendeley helps you to discover research relevant for your work.