Piercing quasi-rectangles-on a problem of Danzer and Rogers

DOI10.1016/j.jcta.2012.03.011zbMath1245.05016OpenAlexW1993463637MaRDI QIDQ439049

János Pach, Gábor Tardos

Publication date: 1 August 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2012.03.011

zbMATH Keywords

epsilon-netsDanzerpiercingquasi-rectanglesRogers problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other designs, configurations (05B30) Combinatorial aspects of finite geometries (05B25)

Related Items

Around the Danzer problem and the construction of dense forests, On optimal piercing of a square, On the Beer index of convexity and its variants, Large Area Convex Holes in Random Point Sets

Cites Work

• \(\epsilon\)-nets and simplex range queries
• Almost tight bounds for \(\epsilon\)-nets
• Unsolved problems in geometry
• Improved bounds on weak \(\varepsilon\)-nets for convex sets
• Weak \(\varepsilon\)-nets for points on a hypersphere
• Weak ε-nets and interval chains
• Tight lower bounds for the size of epsilon-nets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item