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

DOI10.1016/J.IPL.2010.06.005MaRDI QIDQ407569zbMATH OpenOpenAlexFDO

Authors 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

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)

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

Cites work

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

Cited in

(9)

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

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)