No Selection Lemma for Empty Triangles

10/02/2022
by   Ruy Fabila-Monroy, et al.
0

Let S be a set of n points in general position in the plane. The Second Selection Lemma states that for any family of Θ(n^3) triangles spanned by S, there exists a point of the plane that lies in a constant fraction of them. For families of Θ(n^3-α) triangles, with 0≤α≤ 1, there might not be a point in more than Θ(n^3-2α) of those triangles. An empty triangle of S is a triangle spanned by S not containing any point of S in its interior. Bárány 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(n^2); in such a case, on average, every edge spanned by S is incident to a constant number of empty triangles. The conjecture of Bárány 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≤α≤ 1 there exists a point set of size n with Θ(n^3-α) empty triangles such that any point of the plane is only in O(n^3-2α) empty triangles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/21/2019

An Upper Bound for the Number of Rectangulations of a Planar Point Set

We prove that every set of n points in the plane has at most 17^n rectan...
research
09/21/2022

The Upper Bound for the Lebesgue Constant for Lagrange Interpolation in Equally Spaced Points of the Triangle

An upper bound for the Lebesgue constant (the supremum norm) of the oper...
research
08/31/2021

Non-homotopic Loops with a Bounded Number of Pairwise Intersections

Let V_n be a set of n points in the plane and let x ∉ V_n. An x-loop is ...
research
03/24/2022

Geometric Dominating Sets

We consider a minimizing variant of the well-known No-Three-In-Line Prob...
research
03/08/2023

Improved Bounds for Covering Paths and Trees in the Plane

A covering path for a planar point set is a path drawn in the plane with...
research
10/07/2017

A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations

Given a triangulation of a point set in the plane, a flip deletes an edg...
research
06/21/2017

Art Gallery Localization

We study the problem of placing a set T of broadcast towers in a simple ...

Please sign up or login with your details

Forgot password? Click here to reset