AbstractLet P be a set of n points in general position in the plane. For every x∈P let D(x,P) be the maximum number such that there are at least D(x,P) points of P in each of two opposite quadrants determined by some two perpendicular lines through x. Define D(P)=maxx∈PD(x,P). In this paper we show that D(P)⩾c|P| for every set P in general position in the plane where c is an absolute constant that is strictly greater than 18. This answers a question raised by Stefan Felsner, and, as it turns out, also independently raised by Brönnimann, Lenchner, and Pach
We give the structure of discrete two-dimensional finite sets A, B ⊆ ℝ 2 which are extremal for the ...
Given a set S = , the depth #(Q) of a point Q is the minimum number of points of S that ...
AbstractLet P be a finite point set in general position in the plane. We consider empty convex subse...
Let P be a set of n points in general position in the plane. For every x ∈ P let D(x, P) be the maxi...
Abstract. Given a set S of n points in the plane, the opposite-quadrant depth of a point p ∈ S is de...
Given a set P of points in the plane we are interested in points that are `deep' in the set in the s...
AbstractWe show that for every ϵ>0 there exists an angle α=α(ϵ) between 0 and π, depending only on ϵ...
We show that for any ǫ> 0 there exists an angle α = α(ǫ) between 0 and π, depending only on ǫ, wi...
A collection of n hyperplanes in R d forms a hyperplane arrangement. The depth of a point ` 2 R d...
We show the following two results on a set of n points in the plane, thus answering questions posed ...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
AbstractLet d, n be positive integers, and P a set of n points in the d-dimensional Euclidean space....
Let Π = (P,L,I) denote a rank two geometry. In this paper, we are interested in the largest value of...
This abstract reports first the study of upper and lower bounds for the maximum number of all the co...
Abstract. Let P be a set of n points in the plane, not all on a line. We show that if n is large the...
We give the structure of discrete two-dimensional finite sets A, B ⊆ ℝ 2 which are extremal for the ...
Given a set S = , the depth #(Q) of a point Q is the minimum number of points of S that ...
AbstractLet P be a finite point set in general position in the plane. We consider empty convex subse...
Let P be a set of n points in general position in the plane. For every x ∈ P let D(x, P) be the maxi...
Abstract. Given a set S of n points in the plane, the opposite-quadrant depth of a point p ∈ S is de...
Given a set P of points in the plane we are interested in points that are `deep' in the set in the s...
AbstractWe show that for every ϵ>0 there exists an angle α=α(ϵ) between 0 and π, depending only on ϵ...
We show that for any ǫ> 0 there exists an angle α = α(ǫ) between 0 and π, depending only on ǫ, wi...
A collection of n hyperplanes in R d forms a hyperplane arrangement. The depth of a point ` 2 R d...
We show the following two results on a set of n points in the plane, thus answering questions posed ...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
AbstractLet d, n be positive integers, and P a set of n points in the d-dimensional Euclidean space....
Let Π = (P,L,I) denote a rank two geometry. In this paper, we are interested in the largest value of...
This abstract reports first the study of upper and lower bounds for the maximum number of all the co...
Abstract. Let P be a set of n points in the plane, not all on a line. We show that if n is large the...
We give the structure of discrete two-dimensional finite sets A, B ⊆ ℝ 2 which are extremal for the ...
Given a set S = , the depth #(Q) of a point Q is the minimum number of points of S that ...
AbstractLet P be a finite point set in general position in the plane. We consider empty convex subse...