Decomposition of Multiple Coverings into More Parts

作者:Aloupis Greg; Cardinal Jean; Collette Sebastien*; Langerman Stefan; Orden David; Ramos Pedro
来源:Discrete & Computational Geometry, 2010, 44(3): 706-723.
DOI:10.1007/s00454-009-9238-3

摘要

We prove that for every centrally symmetric convex polygon Q, there exists a constant alpha such that any locally finite alpha k-fold covering of the plane by translates of Q can be decomposed into k coverings. This improves on a quadratic upper bound proved by Pach and Tth. The question is motivated by a sensor network problem, in which a region has to be monitored by sensors with limited battery life.

  • 出版日期2010-10