✦ LIBER ✦

Convex transversals

✍ Scribed by Arkin, Esther M.; Dieckmann, Claudia; Knauer, Christian; Mitchell, Joseph S.B.; Polishchuk, Valentin; Schlipf, Lena; Yang, Shang

Book ID: 121375988
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 450 KB
Volume: 47
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2012.10.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Topological transversals to a family of

Topological transversals to a family of convex sets

✍ L. Montejano; R. N. Karasev 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 601 KB

Line Transversals to Translates of a Con

Line Transversals to Translates of a Convex Body

✍ J. Jerónimo-Castro; E. Roldán-Pensado 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 511 KB

Line Transversals of Convex Polyhedra in

Line Transversals of Convex Polyhedra in $\mathbb{R}^3$

✍ Kaplan, Haim; Rubin, Natan; Sharir, Micha 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 606 KB

Transversals of Families of Translations

Transversals of Families of Translations of a Planar Convex Compact

✍ R. N. Karasev 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 318 KB

Two counterexamples concerning transvers

Two counterexamples concerning transversals for convex subsets of the plane

✍ Ted Lewis 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 204 KB

Transversal of disjoint convex polygons

✍ Francis Y.L. Chin; Hong Shen; Fu Lee Wang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Given a set S of n disjoint convex polygons {P i | 1 i n} in a plane, each with k i vertices, the transversal problem is to find, if there exists one, a straight line that goes through every polygon in S. We show that the transversal problem can be solved in O(N + n log n) time, where N = n i=1 k i