Improving the first selection lemma in R^3

DOI10.1145/1810959.1811017MaRDI QIDQ5405900zbMATH OpenOpenAlexFDO

Authors Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza

Publication date 3 April 2014

Published in Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1810959.1811017

zbMATH Keywords

centerpointsfirst selection lemmahitting simpliceslocation depth

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Hitting simplices with points in \(\mathbb R^{3}\)
• Selection lemmas for various geometric objects
• Selecting Heavily Covered Points
• An improved bound for \(k\)-sets in three dimensions
• scientific article; zbMATH DE number 1544962

Cited in

(5)

• Upper bounds for stabbing simplices by a line
• Selection lemmas for various geometric objects
• A new lower bound based on Gromov's method of selecting heavily covered points
• A slight improvement to the colored Bárány's theorem
• On Gromov's method of selecting heavily covered points

This page was built for publication: Improving the first selection lemma in \(\mathbb{R}^3\)

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