Reprint of: Weak -nets have basis of size O(1/ (1/)) in any dimension

DOI10.1016/J.COMGEO.2007.02.007MaRDI QIDQ982945zbMATH OpenOpenAlexFDO

Authors Nabil H. Mustafa, Saurabh Ray

Publication date 28 July 2010

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2007.02.007

zbMATH Keywords

combinatorial geometryhitting convex setsweak \(\epsilon\)-nets

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• -nets and simplex range queries
• Equipartition of mass distributions by hyperplanes
• Graph theory.
• Improved bounds on weak ε-nets for convex sets
• New constructions of weak -nets
• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• Point Selections and Weak ε-Nets for Convex Hulls

Cited in

(2)

• A lower bound for weak \(\varepsilon\)-nets in high dimension
• Weak -nets have basis of size O(1/ (1/)) in any dimension

This page was built for publication: Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension

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