Rend], F. and G. Woeginger, Reconstructing sets of orthogonal line segments in the plane, Discrete Mathematics 119 (1993) 1677174. We show that reconstructing a set of n orthogonal line segments in the plane from the set of their vertices can be done in O(n log n) time, if the segments are allowed
On illuminating line segments in the plane
β Scribed by Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia; Joseph Zaks
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 269 KB
- Volume
- 137
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let F be a family of n convex sets in the plane. A set of light sources S illuminates F if every point on the boundary of each element of F is visible from at least one element in S. We prove that if F is a family of n line segments, n >/11, then [-2n/3 7 light sources are always sufficient to illuminate F. If all the elements in F are parallel to the x or the y-axes, then F can be illuminated by at most [-(n + 1)/2 7 light sources.
π SIMILAR VOLUMES
Given a finite collection L of lines in the hyperbolic plane H, we denote by k = k(L) its Karzanov number, i.e., the maximal number of pairwise intersecting lines in L, and by C(L) and n = n(L) the set and the number, respectively, of those points at infinity that are incident with at least one line
dedicated to the memory of gian-carlo rota ## 1. THE UNIMODALITY CONJECTURE Although Gian-Carlo Rota did not publish much in matroid theory, his influence on the subject is pervasive (see ). Among the many conjectures bearing his name in matroid theory, the unimodality conjecture is perhaps the mo