𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Helly-type theorem for simple polygons

✍ Scribed by Marilyn Breen

Publisher
Springer
Year
1996
Tongue
English
Weight
321 KB
Volume
60
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

✦ Synopsis

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{C:C in d) will be another orthogonally convex polygon, and, in certain circumstances, the dimension of this intersection can be determined.

πŸ“œ SIMILAR VOLUMES

A Helly theorem for convexity in graphs
A Helly theorem for convexity in graphs
✍ Robert E. Jamison; Richard Nowakowski πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 561 KB
A Helly theorem for geodesic convexity i
A Helly theorem for geodesic convexity in strongly dismantlable graphs
✍ Norbert Polat πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 476 KB

A (finite or infinite) graph G is strongly dismantlable if its vertices can be linearly ordered x o ..... x~ so that, for each ordinal fl < ~, there exists a strictly increasing finite sequence (i~)0~<j~<n of ordinals such that i o = fl, i, = ct and xi~ +1 is adjacent with x~j and with all neighbors