Line Transversals for Homothetical Systems of Polygons in R
نویسنده
چکیده
The problem considered in this article is: ‘for given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c > 1 that the transformed system has a transversal’. We prove that in this ‘minimal configuration’, we can always find three polygons (two of them lying in distinct halfplanes determined by the transversal), for which the transversal is also the tangent line.
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملThe number of transversals to line segments in R^3
We completely describe the structure of the connected components of transversals to a collection of n line segments in R. We show that n > 3 arbitrary line segments in R admit 0, 1, . . . , n or infinitely many line transversals. In the latter case, the transversals form up to n connected components.
متن کاملTransversals to line segments in R3
We completely describe the structure of the connected components of transversals to a collection of n arbitrary line segments in R. We show that n 3 line segments in R admit 0, 1, . . . , n or infinitely many line transversals. In the latter case, the transversals form up to n connected components.
متن کاملComputing shortest transversals of sets
Given a family of objecte 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(nlogn) time algorithms for computing a shortest transversal of a family of n ...
متن کاملTransversals to Line Segments in Three-Dimensional Space
We completely describe the structure of the connected components of transversals to a collection of n line segments in R. Generically, the set of transversal to four segments consist of zero or two lines. We catalog the non-generic cases and show that n > 3 arbitrary line segments in R admit at most n connected components of line transversals, and that this bound can be achieved in certain conf...
متن کامل