Near-optimal generalisations of a theorem of Macbeath

DOI10.4230/LIPICS.STACS.2014.578MaRDI QIDQ2965518zbMATH OpenFDO

Authors Nabil H. Mustafa, Saurabh Ray

Publication date 3 March 2017

zbMATH Keywords

epsilon netsconvex geometrycuttingsgeometric set systemsunion complexity

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Recommendations

• \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
• New Lower Bounds for ϵ-nets
• Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
• Shallow packings, semialgebraic set systems, Macbeath regions, and polynomial partitioning
• Improved bounds on weak \(\varepsilon\)-nets for convex sets

Cited in

(7)

• Tighter estimates for -nets for disks
• Near optimal bounds in Freiman's theorem
• A simple proof of the shallow packing lemma
• Economical convex coverings and applications
• The technique of \(M\)-regions and cap coverings: A survey
• Near-optimal lower bounds for \(\epsilon\)-nets for half-spaces and low complexity set systems
• \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets

This page was built for publication: Near-optimal generalisations of a theorem of Macbeath

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965518)