𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Illuminating Disjoint Line Segments in the Plane

✍ Scribed by Csaba D. Tóth

Publisher
Springer
Year
2003
Tongue
English
Weight
280 KB
Volume
30
Category
Article
ISSN
0179-5376

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

On illumination in the plane by line seg
On illumination in the plane by line segments
✍ A. Bezdek; K. Bezdek; T. Bisztriczky 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 504 KB

We show that S c E 2 contains a line segment illuminator if any two points of S are illuminated by a line segment of S in a given direction or if any eight points of S are illuminated by a connected set of line segments of S and a certain connectedness condition is fulfilled. We also show that if an

Forcing Disjoint Segments in the Plane
Forcing Disjoint Segments in the Plane
✍ Wayne Goddard; Meir Katchalski; Daniel J. Kleitman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 194 KB
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