Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

No Selection Lemma for Empty Triangles (2210.00630v1)

Published 2 Oct 2022 in cs.CG

Abstract: Let $S$ be a set of $n$ points in general position in the plane. The Second Selection Lemma states that for any family of $\Theta(n3)$ triangles spanned by $S$, there exists a point of the plane that lies in a constant fraction of them. For families of $\Theta(n{3-\alpha})$ triangles, with $0\le \alpha \le 1$, there might not be a point in more than $\Theta(n{3-2\alpha})$ of those triangles. An empty triangle of $S$ is a triangle spanned by $S$ not containing any point of $S$ in its interior. B\'ar\'any conjectured that there exist an edge spanned by $S$ that is incident to a super constant number of empty triangles of $S$. The number of empty triangles of $S$ might be $O(n2)$; in such a case, on average, every edge spanned by $S$ is incident to a constant number of empty triangles. The conjecture of B\'ar\'any suggests that for the class of empty triangles the above upper bound might not hold. In this paper we show that, somewhat surprisingly, the above upper bound does in fact hold for empty triangles. Specifically, we show that for any integer $n$ and real number $0\leq \alpha \leq 1$ there exists a point set of size $n$ with $\Theta(n{3-\alpha})$ empty triangles such that any point of the plane is only in $O(n{3-2\alpha})$ empty triangles.

Summary

We haven't generated a summary for this paper yet.