Staircase \(k\)-kernels for orthogonal polygons. (English) Zbl 0742.52006

Let \(S\neq\emptyset\) be a finite union of boxes in \(\mathbb{R}^ 2\) whose edges are parallel to the coordinate axes. If \(S\) is simply connected and starshaped via staircase paths, then the staircase kernel of \(S\), \(\hbox{Ker} S\), as the intersection of all maximal orthogonally convex polygons in \(S\), and \(\hbox{Ker} S\) is an orthogonally convex region. In general, when \(S\) is starshaped via staircase paths, then each component of \(\hbox{Ker} S\) is an orthogonally convex polygon. However, there may be maximal orthogonally convex polygons in \(S\) which fail to contain \(\hbox{Ker} S\).
Reviewer: M.Breen


52A30 Variants of convex sets (star-shaped, (\(m, n\))-convex, etc.)
Full Text: DOI


[1] M. Breen, Staircase kernels in orthogonal polygons. Arch. Math.59, 588-594 (1992). · Zbl 0789.52011
[2] L. Danzer, B. Grünbaum andV. Klee, Helly’s theorem and its relatives. Proc. Sympos. Pure Math.7, 101-180. Providence, R. I. 1962.
[3] M. A. Krasnosel’skii, Sur un critère pour qu’un domaine soit étoile. Mat. Sb.19, 309-310 (1946). · Zbl 0061.37705
[4] S. R.Lay, Convex Sets and Their Applications. New York 1982. · Zbl 0492.52001
[5] R. Motwani, A. Raghunathan andH. Saran, Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. J. Comp. System Sci.40, 19-48 (1990). · Zbl 0705.68082
[6] J.O’Rourke, Art Gallery Theorems and Algorithms. New York 1987.
[7] A. G. Sparks, Characterizations of the generalized convex kernel. Proc. Amer. Math. Soc.27, 563-565 (1971). · Zbl 0209.26401
[8] F. A. Toranzos, Radial functions of convex and star-shaped bodies. Amer. Math. Monthly74, 278-280 (1967). · Zbl 0145.42802
[9] F. A.Valentine, Convex Sets. New York 1964. · Zbl 0129.37203
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.