✦ LIBER ✦

Topics on line segments and polygons

✍ Scribed by Kiyoshi Hosono; Masatsugu Urabe; Mamoru Watanabe

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 217 KB
Volume: 151
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00087-y

No coin nor oath required. For personal study only.

✦ Synopsis

Let S be a set of pairwise disjoint line segments in the plane. Consider the figure F (polygon, tree or path) whose every edge goes through endpoints of elements in S as many as possible, where F does not intersect itself and any element of S. We construct some figures under the preceding conditions.

📜 SIMILAR VOLUMES

Hamiltonian triangulations and circumscr

Hamiltonian triangulations and circumscribing polygons of disjoint line segments

✍ Andranik Mirzaian 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 994 KB

Relationship of uncertainty between poly

Relationship of uncertainty between polygon segment and line segment for spatial data in GIS

✍ Liu Chun; Tong Xiaohua 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 501 KB

On cellular straight line segments

✍ Chul E. Kim 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 887 KB

Location game on disjoint line segments

✍ Marcin Dziubiński 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 408 KB

The limit shape of convex lattice polygo

The limit shape of convex lattice polygons and related topics

✍ A. M. Vershik 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 654 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