Decomposition of Multiple Packings with Subquadratic Union Complexity

DOI10.1017/S0963548315000280zbMath1371.52017arXiv1312.3215MaRDI QIDQ5364271

János Pach, Bartosz Walczak

Publication date: 4 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.3215

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Local search strikes again: PTAS for variants of geometric covering and packing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangle-free geometric intersection graphs with large chromatic number
• Triangle-free intersection graphs of line segments with large chromatic number
• Improved bounds on the union complexity of fat objects
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• On \(k\)-sets in arrangements of curves and surfaces
• On the union of fat wedges and separating a collection of segments by a line
• On fat partitioning, fat covering and the union size of polygons
• Applications of random sampling in computational geometry. II
• On the complexity of the union of fat convex objects in the plane
• Turan's theorem for \(k\)-graphs
• Lattice double packings in the plane
• A Separator Theorem for String Graphs and its Applications
• Multiple covering of the plane by circles
• Mehrfache gitterförmige Kreislagerungen in der Ebene
• On a Coloring Problem.
• Fat Triangles Determine Linearly Many Holes
• The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
• Applications of a New Separator Theorem for String Graphs

This page was built for publication: Decomposition of Multiple Packings with Subquadratic Union Complexity