Generating a staircase starshaped set from a minimal collection of its subsets (Q536149): Difference between revisions

Let \(S\) be a planar simply connected orthogonal polygon which is starshaped via staircase paths and \(K\) be its staircase kernel. Assume \(K\neq S\), and for \(x\in S\setminus K\) define \(W_x\) as the set of all points lying on some staircase path in \(S\) from \(x\) to a point of \(K\). The author proves that there exists a minimal (in sense of inclusion) collection of \(W_x\) sets whose union is \(S\) and, moreover, that such a collection is finite.