scientific article; zbMATH DE number 431986

MaRDI QIDQ3138744zbMATH OpenFDO

Authors Jiří Matoušek

Publication date 29 November 1994

zbMATH Keywords

computational geometry\(\epsilon\)-netsrange spacesfinite VC-dimension

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Construction of \(\epsilon\)-nets
• Cutting hyperplane arrangements
• Tight lower bounds for the size of epsilon-nets
• Almost tight bounds for -nets
• Tight lower bounds for the size of epsilon-nets

Cited in

(9)

• On the coverings of the \(d\)-cube for \(d\leq 6\)
• Epsilon nets and union complexity
• Models and motion planning
• -nets and simplex range queries
• Guarding scenes against invasive hypercubes.
• Subsampling in smoothed range spaces
• Approximations and optimal geometric divide-and-conquer
• Construction of \(\epsilon\)-nets
• Dressing methods for geometric nets: II. Orthogonal and Egorov nets

This page was built for publication:

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