Improving the first selection lemma in R 3

DOI10.1145/1810959.1811017zbMath1284.68582OpenAlexW2132552936MaRDI QIDQ5405900

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

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

location depthcenterpointsfirst selection lemmahitting simplices

Mathematics Subject Classification ID

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

Related Items (4)

A new lower bound based on Gromov's method of selecting heavily covered points ⋮ Upper bounds for stabbing simplices by a line ⋮ 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 R ³