Dimensions of staircase kernels in orthogonal polygons
Krasnoselskij's art gallery theorem asserts that if a planar set \(S\) is such that every triple of points in \(S\) can see (i.e. can be connected by line segments in \(S\) to) a common point, then all points of \(S\) can see a common point \(x\), i.e. \(S\) is star-shaped with respect to \(x\). All points \(x\) of \(S\) with respect to which \(S\) is star-shaped form the kernel of \(S\). The author explores this idea in a plane with two distinguished directions, horizontal and vertical. So she restricts the sets to orthogonal polygons, which are connected unions of finitely many rectangles (possibly degenerated) and replaces straight light rays by stairway paths, which are monotone arcs in computer graphics. In particular she investigates the dimension of the staircase kernel and finds 1. If \(S \neq \emptyset\) is a simply connected orthogonal polygon such that every 4 points of \(S\) see (via staircase paths in \(S\)) a common line segment, then the staircase kernel of \(S\) contains a line segment. 2. If \(S \neq \emptyset\) is a simply connected orthogonal polygon such that every 4 points of \(S\) see a rectangle, then the staircase kernel of \(S\) contains a rectangle. Examples show that in each case 4 is best possible. A set is called orthogonally convex if the intersection with every horizontal or vertical line is connected. An example shows that there is no analogue of Helly's theorem for orthogonally convex polygons.
- A Krasnosel'skii theorem for orthogonal polygons starshaped via staircase \((n + 1)\)-paths
- An improved Krasnosel'skij type theorem for orthogonal polygons which are starshaped via staircase paths
- Covering orthogonal polygons with star polygons: The perfect graph approach
- scientific article; zbMATH DE number 3774429 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- Improved Krasnosel'skij theorems for the dimension of the kernel of a starshaped set
- Staircase kernels in orthogonal polygons
- The dimension of kernel of a planar set
- A Krasnosel'skij theorem for staircase paths in orthogonal polygons
- Staircase visibility and computation of kernels
- Optimizing generalized kernels of polygons
- A staircase illumination theorem for orthogonal polygons
- Krasnosel'skii numbers and non simply connected orthogonal polygons.
- A staircase illuminator for simply connected orthogonal polygons
- Staircase kernels
- Components of the kernel in a staircase starshaped polygon
- Staircase two-guard kernels of orthogonal polygons
This page was built for publication: Dimensions of staircase kernels in orthogonal polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1326544)
