Transversals with Residue in Moderately Overlapping T(k)-Families of Translates

Let K denote an oval, a centrally symmetric compact convex domain with non-empty interior. A family of translates of K is said to have property T(k) if for every subset of at most k translates there exists a common line transversal intersecting all of them. The integer k is the stabbing level of the family. Two translates Ki = K + ci and Kj = K + cj are said to be σ-disjoint if σK + ci and σK + cj are disjoint. A recent Helly-type result claims that for every σ > 0 there exists an integer k(σ) such that if a family of σ-disjoint unit diameter discs has property T(k)|k ≥ k(σ), then there exists a straight line meeting all members of the family. In the first part of the paper we give the extension of this theorem to translates of an oval K. The asymptotic behavior of k(σ) for σ → 0 is considered as well.Katchalski and Lewis proved the existence of a constant r such that for every pairwise disjoint family of translates of an oval K with property T(3) a straight line can be found meeting all but at most r members of the family. In the second part of the paper σ-disjoint families of translates of K are considered and the relation of σ and the residue r is investigated. The asymptotic behavior of r(σ) for σ → 0 is also discussed.

AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS

This paper gives an optimal O(n log n+nk) time algorithm for constructing the levels 1,…, k in an arrangement of n lines in the plane. This algorithm is extended to compute these levels in an arrangement of n unbounded x-monotone polygonal convex chains, of which each pair intersects at most a constant number of times. We then show how these results can be used to solve several geometric optimization problems including the weak separation problem for sets of red and blue points or polygons, the maximum line transversal problem for sets of line segments, the densest hemisphere problem for sets of points on a sphere and the optimal corridor problem for sets of points in the plane. All of the algorithms are quality-sensitive; they run faster if the optimal solution is a good one.

COMPUTING SHORTEST TRANSVERSALS OF SETS

Given a family of objects in the plane, the line transversal problem is to compute a line that intersects every member of the family. In this paper we examine a variation of the line transversal problem that involves computing a shortest line segment that intersects every member of the family. In particular, we give O(n log n) time algorithms for computing a shortest transversal of a family of n lines, a family of n line segments, and a family of convex polygons with a total of n vertices. In general, finding a line transversal for a family of n objects takes Ω(n log n) time. This time bound holds for a family of n line segments as well as for a family of convex polygons with a total of n vertices. Hence, our shortest transversal algorithms for these families are optimal.

The projective invariants of four mediale

The theory of four particular linear forms, or matrices of k columns and 2k rows, occurred to me many years ago in an attempt to study the invariants of any number of compound linear forms, or subspaces within a space of n dimensions. In what follows, the invariant theory is given, and its significance for a study of the general matrix of k rows and columns is suggested. The collineation used in §4 was considered by Mr J. H. Grace, who emphasized the importance of the k cross ratios upon transversal lines of four [k−1]'s in [2k−1]. It seemed appropriate to examine these cross ratios which are irrational invariants μi, of the figure of four such spaces, and to work out their relation to the known rational invariants Xi. The main result is given in § 5 (7). In § 5 (10) it is shewn that the harmonic section of a line transversal of the four spaces exists when a linear relation holds between the invariants.