On the union complexity of families of axis-parallel rectangles with a low packing number

zbMath1403.52014arXiv1702.00849MaRDI QIDQ1627208

Shakhar Smorodinsky, Chaya Keller

Publication date: 22 November 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

packing numbercombinatorial complexityunion complexityaxis-parallel rectangles

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial complexity of geometric structures (52C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the union complexity of diametral disks
• Improved approximation algorithms for geometric set cover
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
• On the union of fat wedges and separating a collection of segments by a line
• Improved bounds for planar \(k\)-sets and related problems
• Applications of random sampling in computational geometry. II
• On The Chromatic Number of Geometric Hypergraphs
• Point sets with many \(k\)-sets

This page was built for publication: On the union complexity of families of axis-parallel rectangles with a low packing number