Separating families of convex sets
classification
🧮 math.MG
math.CO
keywords
setsconvexseparatedcontainselementsexactlyfamiliesgeneral
read the original abstract
Two elements, $x$ and $y$, are separated by a set $S$ if it contains exactly one of $x$ and $y$. We prove that any set of $n$ points in general position in the plane can be separated by $O(n\log\log n/\log n)$ convex sets, and for some point sets $\Omega(n/\log n)$ convex sets are necessary.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.