AbstractConsider all arrangements of lines in the plane with r distinct slopes. What is the smallest number of lines f(r) in which there are at least f(r) + 1 points, each defined by the intersection of r lines? We improve the previous lower bound, showing f(r) = Θ(r3)
AbstractLet P be a set of n points in R3, not all of which are in a plane and no three on a line. We...
Let $S$ be a set of $n$ points in the projective $d$-dimensional real space $\mathbb{RP}^d$ such tha...
We seek for lines of minimal distance to finitely many given points in the plane. The distance betwe...
For an arrangement of $n$ lines in the real projective plane, we denote by $f$ the number of regions...
Lower bounds are given for the number of lines blocked by a set of q + 2 points in a projective plan...
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 demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudo-li...
AbstractLower bounds are given for the number of lines blocked by a set of q + 2 points in a project...
Given a set of n points in the plane and a collection of k halving lines of P ℓ1,..., ℓk indexed acc...
Given an arrangement of n not all coincident, not all parallel lines in the (projective or) Euclidea...
We study the structure of planar point sets that determine a small number of distinct distances. Spe...
AbstractLet S denote a set of n points in the Euclidean plane. A subset S′ of S is termed a k-set of...
Fix an n ≥ 3. Consider the following two operations: given a line with a specified point on the line...
AbstractHere it is shown that n points in the plane, no three on a line, always determine at least n...
AbstractGiven a polygon P in the Euclidean plane, what can be said about the number of lines in the ...
AbstractLet P be a set of n points in R3, not all of which are in a plane and no three on a line. We...
Let $S$ be a set of $n$ points in the projective $d$-dimensional real space $\mathbb{RP}^d$ such tha...
We seek for lines of minimal distance to finitely many given points in the plane. The distance betwe...
For an arrangement of $n$ lines in the real projective plane, we denote by $f$ the number of regions...
Lower bounds are given for the number of lines blocked by a set of q + 2 points in a projective plan...
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 demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudo-li...
AbstractLower bounds are given for the number of lines blocked by a set of q + 2 points in a project...
Given a set of n points in the plane and a collection of k halving lines of P ℓ1,..., ℓk indexed acc...
Given an arrangement of n not all coincident, not all parallel lines in the (projective or) Euclidea...
We study the structure of planar point sets that determine a small number of distinct distances. Spe...
AbstractLet S denote a set of n points in the Euclidean plane. A subset S′ of S is termed a k-set of...
Fix an n ≥ 3. Consider the following two operations: given a line with a specified point on the line...
AbstractHere it is shown that n points in the plane, no three on a line, always determine at least n...
AbstractGiven a polygon P in the Euclidean plane, what can be said about the number of lines in the ...
AbstractLet P be a set of n points in R3, not all of which are in a plane and no three on a line. We...
Let $S$ be a set of $n$ points in the projective $d$-dimensional real space $\mathbb{RP}^d$ such tha...
We seek for lines of minimal distance to finitely many given points in the plane. The distance betwe...
DOI
Add to ORKG