A note about weak -nets for axis-parallel boxes in d-space

DOI10.1016/J.IPL.2010.06.005zbMATH Open1234.68441OpenAlexW1557417121MaRDI QIDQ407569FDOQ407569

Esther Ezra

Publication date: 27 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.06.005

Recommendations

• Small-size ε-nets for axis-parallel rectangles and boxes
• Small-size \(\varepsilon\)-nets for axis-parallel rectangles and boxes
• An Improved Bound for Weak Epsilon-nets in the Plane
• Weak \(\varepsilon\)-nets for points on a hypersphere
• New constructions of weak \(\varepsilon\)-nets
• Improved bounds on weak \(\varepsilon\)-nets for convex sets
• On weak \(\epsilon\)-nets and the Radon number
• scientific article; zbMATH DE number 739012
• Weak ε-nets and interval chains
• Point Selections and Weak ε-Nets for Convex Hulls

zbMATH Keywords

computational geometry\(\epsilon \)-nets\(d\)-layer range-treesgeometric range spaces

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cites Work

• \(\epsilon\)-nets and simplex range queries
• Almost tight bounds for \(\epsilon\)-nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• A deterministic view of random sampling and its use in geometry
• Efficient Colored Orthogonal Range Counting
• A non-linear lower bound for planar epsilon-nets
• Computing Many Faces in Arrangements of Lines and Segments
• Small-size ε-nets for axis-parallel rectangles and boxes
• Polynomial-time approximation schemes for packing and piercing fat objects
• Improved approximation algorithms for geometric set cover
• Improved bounds on weak \(\varepsilon\)-nets for convex sets
• New constructions of weak \(\varepsilon\)-nets
• Lower bounds for weak epsilon-nets and stair-convexity
• Dynamic data structures for fat objects and their applications
• The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
• Improved bounds on the union complexity of fat objects

Cited In (8)

• Piercing axis-parallel boxes
• Weak \(\varepsilon\)-nets for points on a hypersphere
• On weak \(\epsilon\)-nets and the Radon number
• Small-size ε-nets for axis-parallel rectangles and boxes
• Title not available (Why is that?)
• A Danzer set for axis parallel boxes
• Tight lower bounds for the size of epsilon-nets
• Small candidate set for translational pattern search

This page was built for publication: A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space

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