English

One-sided epsilon-approximants

Combinatorics 2016-05-31 v2 Computational Geometry

Abstract

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

Keywords

Cite

@article{arxiv.1603.05717,
  title  = {One-sided epsilon-approximants},
  author = {Boris Bukh and Gabriel Nivasch},
  journal= {arXiv preprint arXiv:1603.05717},
  year   = {2016}
}

Comments

14 pages

R2 v1 2026-06-22T13:13:39.711Z