✦ LIBER ✦

Location game on disjoint line segments

✍ Scribed by Marcin Dziubiński

Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 408 KB
Volume: 40
Category: Article
ISSN: 0020-7276
DOI: 10.1007/s00182-010-0236-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Alternating paths through disjoint line

Alternating paths through disjoint line segments

✍ Michael Hoffmann; Csaba D Tóth 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 265 KB

We show that every segment endpoint visibility graph on n disjoint line segments in the plane admits an alternating path of length (log n), and this bound is optimal apart from a constant factor.

On Locating Disjoint Segments with Maxim

On Locating Disjoint Segments with Maximum Sum of Densities

✍ Hsiao-Fei Liu; Kun-Mao Chao 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 288 KB

Illuminating Disjoint Line Segments in t

Illuminating Disjoint Line Segments in the Plane

✍ Csaba D. Tóth 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 280 KB

Polynomial approximations on disjoint se

Polynomial approximations on disjoint segments

✍ K. G. Mezhevich; N. A. Shirokov 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 442 KB

Hamiltonian triangulations and circumscr

Hamiltonian triangulations and circumscribing polygons of disjoint line segments

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

Every Set of Disjoint Line Segments Admi

Every Set of Disjoint Line Segments Admits a Binary Tree

✍ P. Bose; M. E. Houle; G. T. Toussaint 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 132 KB