A simple polygon is a connected, simply connected union of finitely many convex polygons, some of which may be degenerate. This is not a very strong condition and the existence of any Helly-type theorem for such polygons is perhaps surprising. The author shows that if any three (not necessarily distinct) members of a family \(P\) of simple polygons have a simple connected union, and every two intersect, then there is a point common to the whole family. A special, and important, class of simple polygons is that of orthogonally convex polygons. A polygon is orthogonally convex if all its edges are horizontal or vertical, and if its intersection with every horizontal or vertical line is connected. The author proves two further Helly-type theorems that guarantee the existence of a one- or two-dimensional intersection for suitable families of orthogonally convex polygons.
- Helly-type theorems for polygonal curves
- Settling the bound on the rectilinear link radius of a simple rectilinear polygon
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
- Relatively convex subsets of simply connected planar sets
- The Hausdorff core problem on simple polygons
- scientific article; zbMATH DE number 1553617 (Why is no real title available?)
- The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
This page was built for publication: A Helly-type theorem for simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1912366)
