𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Forcing Disjoint Segments in the Plane

✍ Scribed by Wayne Goddard; Meir Katchalski; Daniel J. Kleitman

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
194 KB
Volume
17
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On illuminating line segments in the pla
On illuminating line segments in the plane
✍ Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia; Joseph Zaks πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 269 KB

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 illum

Note on disjoint blocking sets in Galois
Note on disjoint blocking sets in Galois planes
✍ JΓ‘nos BarΓ‘t; Stefano Marcugini; Fernanda Pambianco; TamΓ‘s SzΕ‘nyi πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 118 KB

## Abstract In this paper, we show that there are at least __cq__ disjoint blocking sets in PG(2,__q__), where __c__β€‰β‰ˆβ€‰1/3. The result also extends to some non‐Desarguesian planes of order __q__. Β© 2005 Wiley Periodicals, Inc. J Combin Designs 14: 149–158, 2006

Pairwise disjoint eight-shaped curves in
Pairwise disjoint eight-shaped curves in hybrid planes
✍ Camillo Costantini πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 121 KB

## Abstract We introduce a suitable notion of eight‐shaped curve in the product __S__ Γ— ℝ of a Suslin line __S__ for the real line ℝ, and we prove that if __S__ is dense in itself, then every collection of pairwise disjoint eight‐shaped curves in __S__ Γ— ℝ is countable. This parallels a folklore re

Reconstructing sets of orthogonal line s
Reconstructing sets of orthogonal line segments in the plane
✍ Franz Rendl; Gerhard Woeginger πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 550 KB

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