One-sided epsilon-approximants

@article{Bukh2016OnesidedE,
  title={One-sided epsilon-approximants},
  author={B. Bukh and Gabriel Nivasch},
  journal={ArXiv},
  year={2016},
  volume={abs/1603.05717}
}
  • B. Bukh, Gabriel Nivasch
  • Published 2016
  • Mathematics, Computer Science
  • ArXiv
  • Given a finite point set \(P \subset \mathbb{R}^{d}\), we call a multiset A a one-sided weak ɛ-approximant for P (with respect to convex sets), if \(\vert P \cap C\vert /\vert P\vert -\vert A \cap C\vert /\vert A\vert \leq \varepsilon\) for every convex set C. 

    Topics from this paper.

    Erdős–Szekeres-type statements: Ramsey function and decidability in dimension $1$
    • 22
    • PDF
    Classifying unavoidable Tverberg partitions
    • 7
    • PDF
    Tverberg's theorem is 50 years old: a survey
    • 22
    • PDF
    Extending the centerpoint theorem to multiple points
    • 3
    • Highly Influenced
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 36 REFERENCES
    Lectures on Polytopes
    • 2,963
    • PDF
    Lectures on discrete geometry
    • 1,265
    Lower bounds for weak epsilon-nets and stair-convexity
    • 33
    Point Selections and Weak e-Nets for Convex Hulls
    • 135
    • PDF
    A Randomized Algorithm for Closest-Point Queries
    • 257
    Overlap properties of geometric expanders
    • 90
    • PDF
    A deterministic view of random sampling and its use in geometry
    • 123
    • PDF
    Weak ε-nets and interval chains
    • 28
    • PDF
    Stabbing Simplices by Points and Flats
    • 43
    • PDF