On a problem of Danzer

DOI10.4230/LIPIcs.ESA.2018.64OpenAlexW2889155853MaRDI QIDQ5009631

Nabil H. Mustafa, Saurabh Ray

Publication date: 4 August 2021

Full work available at URL: https://hal.archives-ouvertes.fr/hal-01890699

zbMATH Keywords

convex polytopesballsepsilon-netshadwiger-debrunner numbers

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal generalization of the colorful Carathéodory theorem
• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• Improved bounds on the Hadwiger-Debrunner numbers
• Applications of random sampling in computational geometry. II
• Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
• On Center Regions and Balls Containing Many Points
• Über Durchschnittseigenschaften n-dimensionaler Kugelfamilien.
• On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
• Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems

This page was built for publication: On a problem of Danzer