论文信息 - Optimally Decomposing Coverings with Translates of a Convex Polygon

Optimally Decomposing Coverings with Translates of a Convex Polygon

We show that any k-fold covering using translates of an arbitrary convex polygon can be decomposed into Ω(k) covers. Such a decomposition can be computed using an efficient (polynomial-time) algorithm.

Matt Gibson | Kasturi R. Varadarajan

[1] János Pach,et al. Indecomposable Coverings , 2005, Canadian Mathematical Bulletin.

[2] J. Pach,et al. Decomposition problems for multiple coverings with unit balls, manuscript. , 1988 .

[3] Imran A. Pirwani,et al. Energy conservation via domatic partitions , 2006, MobiHoc '06.

[4] Sriram V. Pemmaraju,et al. Approximation Algorithms for Domatic Partitions of Unit Disk Graphs , 2009, APPROX-RANDOM.

[5] Géza Tóth,et al. Convex Polygons are Cover-Decomposable , 2010, Discret. Comput. Geom..

[6] János Pach,et al. Decomposition of multiple coverings into many parts , 2009, Comput. Geom..

[7] Gábor Tardos,et al. Multiple Coverings of the Plane with Triangles , 2007, Discret. Comput. Geom..

[8] Suresh Venkatasubramanian,et al. Restricted strip covering and the sensor cover problem , 2007, SODA '07.

[9] Dömötör Pálvölgyi,et al. Indecomposable Coverings with Concave Polygons , 2010, Discret. Comput. Geom..

[10] János Pach,et al. Covering the plane with convex polygons , 1986, Discret. Comput. Geom..

[11] Jean Cardinal,et al. Decomposition of Multiple Coverings into More Parts , 2008, SODA.