pith. sign in

arxiv: 1603.05717 · v2 · pith:ESTLJRYLnew · submitted 2016-03-17 · 🧮 math.CO · cs.CG

One-sided epsilon-approximants

classification 🧮 math.CO cs.CG
keywords varepsilonone-sidedweakapproximantconvexeverymathbbsubset
0
0 comments X
read the original abstract

Given a finite point set $P\subset\mathbb{R}^d$, we call a multiset $A$ a one-sided weak $\varepsilon$-approximant for $P$ (with respect to convex sets), if $|P\cap C|/|P|-|A\cap C|/|A|\leq\varepsilon$ for every convex set $C$. We show that, in contrast with the usual (two-sided) weak $\varepsilon$-approximants, for every set $P\subset \mathbb{R}^d$ there exists a one-sided weak $\varepsilon$-approximant of size bounded by a function of $\varepsilon$ and $d$.

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.