scientific article; zbMATH DE number 431986

zbMATH Open0801.68154MaRDI QIDQ3138744FDOQ3138744

Jiří Matoušek

Publication date: 29 November 1994

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (9)

• Epsilon nets and union complexity
• On the coverings of the \(d\)-cube for \(d\leq 6\)
• Models and motion planning
• \(\epsilon\)-nets and simplex range queries
• Guarding scenes against invasive hypercubes.
• Approximations and optimal geometric divide-and-conquer
• Construction of \(\epsilon\)-nets
• Ham-sandwich cuts for abstract order types
• 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)