Abstract
The study of multiple coverings was initiated by Davenport and L. Fejes Tóth more than 50 years ago. In 1980 and 1986, the first named author published the first papers about decomposability of multiple coverings. It was discovered much later that, besides its theoretical interest, this area has practical applications to sensor networks. Now there is a lot of activity in this field with several breakthrough results, although, many basic questions are still unsolved. In this survey, we outline the most important results, methods, and questions.
Research partially supported by Swiss National Science Foundation Grants 200021- 137574 and 200020-144531, by Hungarian Science Foundation Grant OTKA NN 102029 under the EuroGIGA programs ComPoSe and GraDR, and by NSF grant CCF-08-30272.
Supported by János Bolyai Research Scholarship of the Hungarian Academy of Sciences, OTKA PD 104386 and OTKA NN 102029 under EUROGIGA project GraDR 10-EuroGIGA-OP-003. Part of this work was done in Lausanne and supported by Swiss National Science Foundation Grant 200021-125287/1.
Supported by OTKA K 83767 and by OTKA NN 102029 under EUROGIGA project GraDR 10-EuroGIGA-OP-003.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Ács: Síkfedések szétbonthatósága, Master Thesis, Eötvös University Budapest, 2010 (in Hungarian).
G. Aloupis, J. Cardinal, S. Collette, S. Langerman, D. Orden, and P. Ramos: Decomposition of multiple coverings into more parts, Discrete and Computational Geometry 44 (2010), 706–723. Also in: Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), ACM, New York, 2009, 302–310.
A. L. Buchsbaum, A. Efrat, S. Jain, S. Venkatasubramanian, and K. Yi: Restricted strip covering and the sensor cover problem, in: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 07), ACM, New York, 2007, 1056–1063.
P. Brass, J. Pach, and W. Moser: Research Problems in Discrete Geometry, Springer, Berlin, 2005.
M. Elekes, T. Mátrai, and L. Soukup: On splitting infinite-fold covers, Fundamenta Mathematicae 212 (2011), 95–127.
P. Erdős: On a combinatorial problem, Nordisk Matematisk Tidskrift 11 (1963), 5–10.
P. Erdős and L. Lovász: Problems and results on 3-chromatic hypergraphs and some related questions, in: In Infinite and Finite Sets (to Paul Erds on his 60th birthday), II. North-Holland, Amsterdam, 1975, 609–627.
M. Gibson and K. Varadarajan: Optimally decomposing coverings with translates of a convex polygon, Discrete & Computational Geometry 46 (2011), 313–333. Also in: Proc. 50th Annual IEEE Symposium on Foundations of Computer Science, (FOCS 09), IEEE Computer Soc., Los Alamitos, CA, 2009, 159–168.
B. Keszegh and D. Pálvölgyi: Octants are cover decomposable, Discrete & Computational Geometry, DOI 10.1007/s00454-011-9377-1, to appear. Also in: Proc. 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Kyoto, 2011, 217–226.
P. Mani-Levitska, J. Pach: Decomposition problems for multiple coverings with unit balls, manuscript, 1986.
J. Pach: Decomposition of multiple packing and covering, in: Diskrete Geometrie, 2. Kolloq. Math. Inst. Univ. Salzburg, 1980, 169–178.
J. Pach: Covering the plane with convex polygons, Discrete & Computational Geometry 1 (1986), 73–81.
J. Pach, G. Tardos, and G. Tóth: Indecomposable coverings, Canadian Mathematical Bulletin 52 (2009), 451–463. Also in: The China Japan Joint Conference on Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT 2005), Lecture Notes in Computer Science 4381, Springer, Berlin, 2007, 135–148.
J. Pach and G. Tóth: Decomposition of multiple coverings into many parts, Computational Geometry: Theory and Applications 42 (2009), 127–133. Also in: Proc. 23rd ACM Symposium on Computational Geometry, (SoCG07) 2007, 133–137.
D. Pálvölgyi: Indecomposable coverings with concave polygons, Discrete & Computational Geometry 44, (2010), 577–588.
D. Pálvölgyi and G. Tóth: Convex polygons are cover-decomposable, Discrete & Computational Geometry 43 (2010), 483–496.
G. Tardos and G. Tóth: Multiple coverings of the plane with triangles, Discrete & Computational Geometry 38 (2007), 443–450.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 János Bolyai Mathematical Society and Springer-Verlag
About this chapter
Cite this chapter
Pach, J., Pálvölgyi, D., Tóth, G. (2013). Survey on Decomposition of Multiple Coverings. In: Bárány, I., Böröczky, K.J., Tóth, G.F., Pach, J. (eds) Geometry — Intuitive, Discrete, and Convex. Bolyai Society Mathematical Studies, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41498-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-41498-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41497-8
Online ISBN: 978-3-642-41498-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)