摘要: Many applications like picture processing, data compression or pattern recognition require a covering of set points most often located in the (discrete) plane by rectangles due to some cost constraints. In this paper we introduce and study concept rectangular subset closure point M which is aimed provide insight into combinatorial structure underlying such problem. We show that size O(|M|2) it can be computed time O(|M|2). The concepts results are also generalized d-dimensional case.
springer.com
sci-hub.se 参考文章(6)
John Hershberger, Subhash Suri, Finding tailored partitions Journal of Algorithms. ,vol. 12, pp. 431- 463 ,(1991) , 10.1016/0196-6774(91)90013-O
Dorit S. Hochba, Approximation Algorithms for NP-Hard Problems ,(1996)
Endre Boros, Peter L. Hammer, On clustering problems with connected optima in Euclidean spaces Discrete Mathematics. ,vol. 75, pp. 81- 88 ,(1989) , 10.1016/0012-365X(89)90080-0
Stefan Porschen, On Covering Z-Grid Points by Rectangles Electronic Notes in Discrete Mathematics. ,vol. 8, pp. 80- 83 ,(2001) , 10.1016/S1571-0653(05)80086-1
Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza, Optimal rectangular partitions Networks. ,vol. 41, pp. 51- 67 ,(2003) , 10.1002/NET.10058
Steven L. Tanimoto, Robert J. Fowler, COVERING IMAGE SUBSETS WITH PATCHES. NATO Conference Series, (Series) 4: Marine Sciences. ,vol. 2, pp. 835- 839 ,(1980)