✦ LIBER ✦

Helly-type theorems for polygonal curves

✍ Scribed by Konrad J. Swanepoel

Book ID: 108315717
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 162 KB
Volume: 254
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00379-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Helly-type theorem for simple polygons

✍ Marilyn Breen 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 321 KB

Let P be a family of simple polygons in the plane. If every three (not necessarily distinct) members of P have a simply connected union and every two members of P have a nonempty intersection, then N{P:P in P) ¢ ¢. Applying the result to a finite family C of orthogonally convex polygons, the set fq{

Helly-type theorems for spheres

✍ Hiroshi Maehara 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 359 KB

Helly-type Theorems for Varieties

✍ Frankl, P. 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Helly-Type Theorems for Approximate Cove

Helly-Type Theorems for Approximate Covering

✍ Julien Demouth; Olivier Devillers; Marc Glisse; Xavier Goaoc 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 526 KB

Tolerance in Helly-Type Theorems

✍ L. Montejano; D. Oliveros 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 336 KB

Helly-type theorems about sets

✍ Steve Fisk; Daniel Abbw-Jackson; Dan Kleitman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 724 KB

Suppose that G ifn a graph. A l-factor is a set of edges of G such that every vertex of G meets exactly one of its edges. Suppose that we have a set Y of l-factors of G such that any two l-factors vf Y have an edge in common. We investigate the following questions: (1) How large may Y be? (2) When