Stabbing Convex Bodies with Lines and Flats

07/20/2020
by   Sariel Har-Peled, et al.
0

We study the problem of constructing weak -nets where the stabbing elements are lines or k-flats instead of points. We study this problem in the simplest setting where it is still interesting –namely, the uniform measure of volume over the hypercube [0,1]^d.. Specifically, a (k,)-net is a set of k-flats, such that any convex body in [0,1]^d of volume larger than is stabbed by one of these k-flats. We show that for k ≥ 1, one can construct (k,)-nets of size O(1/^1-k/d). We also prove that any such net must have size at least Ω(1/^1-k/d). As a concrete example, in three dimensions all -heavy bodies in [0,1]^3 can be stabbed by Θ(1/^2/3) lines. Note, that these bounds are sublinear in 1/, and are thus somewhat surprising.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2022

Halving by a Thousand Cuts or Punctures

For point sets P_1, …, P_, a set of lines L is halving if any face of t...
research
12/08/2017

How to Net a Convex Shape

We revisit the problem of building weak -nets for convex ranges over...
research
04/26/2021

Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions

Given a finite point set P in ℝ^d, and ϵ>0 we say that N⊆ℝ^d is a weak ϵ...
research
02/20/2020

Weighted Epsilon-Nets

Motivated by recent work of Bukh and Nivasch on one-sided ε-approximants...
research
09/13/2017

The shortest way to visit all metro lines in Paris

What if {a tourist, a train addict, Dr. Sheldon Cooper, somebody who lik...
research
11/02/2021

Unfoldings and Nets of Regular Polytopes

Over a decade ago, it was shown that every edge unfolding of the Platoni...
research
04/01/1990

A note on digitized angles

We study the configurations of pixels that occur when two digitized stra...

Please sign up or login with your details

Forgot password? Click here to reset