© 2021 Elsevier B.V.We prove that for all positive integers n and k, there exists an integer N=N(n,k) satisfying the following. If U is a set of k nonzero vectors in the plane and JU is the set of all line segments in direction u for some u∈U, then for every N families F1,…,FN, each consisting of n mutually disjoint segments in JU, there is a set {A1,…,An} of n disjoint segments in ⋃1≤i≤NFi and distinct integers p1,…,pn∈{1,…,N} satisfying that Aj∈Fpj for all j∈{1,…,n}. We generalize this property for underlying lines on fixed k directions to k families of simple curves with certain conditions.11Nsciescopu
Let S be a set of n points in the plane and E denote the set of all the line segments with endpoints...
AbstractImproving a result of Károlyi, Pach and Tóth, we construct an arrangement of n segments in t...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
AbstractLet V be a family of even disjoint line segments in Rn of f-equal width for a direction f∈(R...
AbstractLet S be a set of pairwise disjoint line segments in the plane. Consider the figure F (polyg...
Let r(n) denote the largest integer such that every family C of n pairwise disjoint segments in the ...
AbstractIt is shown that for every c>0 there exists c′>0 satisfying the following condition. Let S b...
Given a set of n disjoint line segments in the plane, we show that it is always possible to form a t...
Abstract. We show that every segment endpoint visibility graph on Ò disjoint line segments in the pl...
Abstract. Given a set S of line segments in the plane, we introduce a new family of partitions of th...
AbstractDe Bruijn and Erdös proved that every noncollinear set of n points in the plane determines a...
Abstract. We completely describe the structure of the connected components of transversals to a coll...
We prove that the set of directions of lines intersecting three disjoint balls in R3 in a given orde...
This paper deals with a new deterministic algorithm for finding intersecting pairs from a given set ...
AbstractWe prove that if X1, X2,…, Xk are pairwise disjoint sets of points in a linear space, each o...
Let S be a set of n points in the plane and E denote the set of all the line segments with endpoints...
AbstractImproving a result of Károlyi, Pach and Tóth, we construct an arrangement of n segments in t...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
AbstractLet V be a family of even disjoint line segments in Rn of f-equal width for a direction f∈(R...
AbstractLet S be a set of pairwise disjoint line segments in the plane. Consider the figure F (polyg...
Let r(n) denote the largest integer such that every family C of n pairwise disjoint segments in the ...
AbstractIt is shown that for every c>0 there exists c′>0 satisfying the following condition. Let S b...
Given a set of n disjoint line segments in the plane, we show that it is always possible to form a t...
Abstract. We show that every segment endpoint visibility graph on Ò disjoint line segments in the pl...
Abstract. Given a set S of line segments in the plane, we introduce a new family of partitions of th...
AbstractDe Bruijn and Erdös proved that every noncollinear set of n points in the plane determines a...
Abstract. We completely describe the structure of the connected components of transversals to a coll...
We prove that the set of directions of lines intersecting three disjoint balls in R3 in a given orde...
This paper deals with a new deterministic algorithm for finding intersecting pairs from a given set ...
AbstractWe prove that if X1, X2,…, Xk are pairwise disjoint sets of points in a linear space, each o...
Let S be a set of n points in the plane and E denote the set of all the line segments with endpoints...
AbstractImproving a result of Károlyi, Pach and Tóth, we construct an arrangement of n segments in t...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...