摘要: 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 provide exact dynamic programming algorithms for point sets regular rectangles, that have obey certain boundary conditions. The objective function is minimize sum area, circumference and number patches used. This may be motivated requirements numerically solving PDE’s discretization over (adaptive multi-)grids.