Decomposition of Multiple Coverings into More Parts

Details Decomposition of Multiple Coverings into More Parts Decomposition of Multiple Coverings into More Parts

2008-07-03

arxiv.org/abs/0807.0552v1

Computer Science

Computational Geometry

Scientific paper

We prove that for every centrally symmetric convex polygon Q, there exists a constant alpha such that any 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 Toth (SoCG'07). The question is motivated by a sensor network problem, in which a region has to be monitored by sensors with limited battery lifetime.

Affiliated with

Also associated with

No associations

Rating

Decomposition of Multiple Coverings into More Parts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decomposition of Multiple Coverings into More Parts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposition of Multiple Coverings into More Parts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115766