AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked for bounds on the maximum number of subsets of size k cut off by a line. By generalizing to a combinatorial problem, we show that for 2k < n the number of such sets of size at most k is at most 2nk − 2k2 − k. By duality, the same bound applies to the number of cells at distance at most k from a base cell in the cell complex determined by an arrangement of n lines in P2
AbstractIn this paper we prove a conjecture of Metsch about the maximum number of lines intersecting...
AbstractIn this paper we present two different results dealing with the number of (≤k)-facets of a s...
A new upper bound is given on the number of ways in which a set of N points in R^n can be partition...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
AbstractLet S denote a set of n points in the Euclidean plane. A subset S′ of S is termed a k-set of...
AbstractFor a configuration S of n points in the plane, let gk(S) denote the number of subsets of ca...
AbstractLower bounds are given for the number of lines blocked by a set of q + 2 points in a project...
Lower bounds are given for the number of lines blocked by a set of q + 2 points in a projective plan...
Let G be a finite set of points in the plane. A line M is a (k, k)-line, if M is determined by G, an...
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...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
A k-set of a nite set S of points in the plane is a subset of car-dinality k that can be separated f...
Erdős asked what is the maximum number α(n) such that every set of n points in the plane with no fou...
AbstractA k-projection of a set of n points N in the plane is an orthogonal projection revealing at ...
In this paper we present three different results dealing with the number of ( ≤ k)-facets of a set o...
AbstractIn this paper we prove a conjecture of Metsch about the maximum number of lines intersecting...
AbstractIn this paper we present two different results dealing with the number of (≤k)-facets of a s...
A new upper bound is given on the number of ways in which a set of N points in R^n can be partition...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
AbstractLet S denote a set of n points in the Euclidean plane. A subset S′ of S is termed a k-set of...
AbstractFor a configuration S of n points in the plane, let gk(S) denote the number of subsets of ca...
AbstractLower bounds are given for the number of lines blocked by a set of q + 2 points in a project...
Lower bounds are given for the number of lines blocked by a set of q + 2 points in a projective plan...
Let G be a finite set of points in the plane. A line M is a (k, k)-line, if M is determined by G, an...
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...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
A k-set of a nite set S of points in the plane is a subset of car-dinality k that can be separated f...
Erdős asked what is the maximum number α(n) such that every set of n points in the plane with no fou...
AbstractA k-projection of a set of n points N in the plane is an orthogonal projection revealing at ...
In this paper we present three different results dealing with the number of ( ≤ k)-facets of a set o...
AbstractIn this paper we prove a conjecture of Metsch about the maximum number of lines intersecting...
AbstractIn this paper we present two different results dealing with the number of (≤k)-facets of a s...
A new upper bound is given on the number of ways in which a set of N points in R^n can be partition...