Algorithms for rectangular covering problems

Authors:
Stefan Porschen
Affiliations:
Institut für Informatik, Universität zu Köln, Köln, Germany
Venue:
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Year:
2006

Citing 7
Cited 1

Probing Convex polygons with half-planes

Journal of Algorithms
Finding tailored partitions

Journal of Algorithms
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Load Balancing for Adaptive Multigrid Methods

SIAM Journal on Scientific Computing
A parallel rendezvous algorithm for interpolation between multiple grids

Journal of Parallel and Distributed Computing
Covering polygons is hard

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
On the rectangular subset closure of point sets

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I

Optimal parameterized rectangular coverings

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many applications like picture processing, data compression or pattern recognition require a covering of a set of 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 covering point sets by regular rectangles, that have to obey certain boundary conditions. The objective function is to minimize sum of area, circumference and number of patches used. This objective function may be motivated by requirements of numerically solving PDE’s by discretization over (adaptive multi-)grids.