𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Guarding a set of line segments in the plane

✍ Scribed by Valentin E. Brimkov; Andrew Leach; Michael Mastroianni; Jimmy Wu

Book ID
108281669
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
274 KB
Volume
412
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A Problem of Guarding Line Segment
A Problem of Guarding Line Segment
✍ Rzymowski, Witold πŸ“‚ Article πŸ“… 2009 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 515 KB
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