Generating a staircase starshaped set from a minimal collection of its subsets (Q536149): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 07:56, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generating a staircase starshaped set from a minimal collection of its subsets |
scientific article |
Statements
Generating a staircase starshaped set from a minimal collection of its subsets (English)
0 references
16 May 2011
0 references
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.
0 references
orthogonal polygons
0 references
staircase path
0 references
staircase convex set
0 references
staircase kernel
0 references
staircase starshaped
0 references