The different ways of stabbing disjoint convex sets
نویسندگان
چکیده
منابع مشابه
The combinatorial encoding of disjoint convex sets in the plane
We introduce a new combinatorial object, the double-permutation sequence, and use it to encode a family of mutually disjoint compact convex sets in the plane in a way that captures many of its combinatorial properties. We use this encoding to give a new proof of the Edelsbrunner-Sharir theorem that a collection of n compact convex sets in the plane cannot be met by straight lines in more than 2...
متن کاملDisjoint empty convex pentagons in planar point sets
Harborth [Elemente der Mathematik, Vol. 33 (5), 116–118, 1978] proved that every set of 10 points in the plane, no three on a line, contains an empty convex pentagon. From this it follows that the number of disjoint empty convex pentagons in any set of n points in the plane is least ⌊ n 10 ⌋. In this paper we prove that every set of 19 points in the plane, no three on a line, contains two disjo...
متن کاملOrder Types and Visibility Types of Conngurations of Disjoint Convex Plane Sets Order Types and Visibility Types of Conngurations of Disjoint Convex Plane Sets Extended Abstract
We introduce the notions of order type (or: dual arrangement) and visibility type (or: tangent visibility graph) for conngurations of disjoint convex sets in the plane. We develop optimal algorithms for computing and sweeping the order type, and also give a worst case optimal algorithm for computing the tangent visibility graph. The methods are based on a relation, introduced in this paper, bet...
متن کاملFixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2 2 log n that decides whether π can be partitioned into at most k increasing or decreasing subsequences. Thus we resolve affirmatively the open question of whether the problem is fixed parameter tractable. This NP-complete problem is equivalent to deciding whether the cochromatic number, pa...
متن کاملConvex subdivisions with low stabbing numbers
It is shown that for every subdivision of the d-dimensional Euclidean space, d ≥ 2, into n convex cells, there is a straight line that stabs at least Ω((log n/ log log n)1/(d−1)) cells. In other words, if a convex subdivision of d-space has the property that any line stabs at most k cells, then the subdivision has at most exp(O(kd−1 log k)) cells. This bound is best possible apart from a consta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1992
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02187836