Loading...
research article
Decomposition of Multiple Packings with Subquadratic Union Complexity
Suppose k is a positive integer and X is a k-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most k sets. Suppose there is a function f(n) = o(n(2)) with the property that any n members of X determine at most f(n) holes, which means that the complement of their union has at most f(n) bounded connected components. We use tools from extremal graph theory and the topological Helly theorem to prove that X can be decomposed into at most p (1-fold) packings, where p is a constant depending only on k and f.
Type
research article
Web of Science ID
WOS:000367821900007
Authors
Publication date
2016
Publisher
Published in
Volume
25
Issue
1
Start page
145
End page
153
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
February 16, 2016
Use this identifier to reference this record