Stronger bounds for weak epsilon-nets in higher dimensions

DOI10.1145/3406325.3451062arXiv2104.12654OpenAlexW3172927295MaRDI QIDQ6065226

Natan Rubin

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.12654

zbMATH Keywords

convex setscomputational geometryepsilon-netsselection theorems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

A note on stabbing convex bodies with points, lines, and flats ⋮ Fractional Helly theorem for Cartesian products of convex sets

This page was built for publication: Stronger bounds for weak epsilon-nets in higher dimensions