Staircase kernels for orthogonal d-polytopes
The author considers special \(d\)-polytopes in connection with a special kind of starshapeness. The result is a generalization of a theorem for 2-polytopes given in a former note by the author [J. Geom. 51, No. 1-2, 22-30 (1994; Zbl 0815.52004)]. \textit{L. Danzer}, \textit{B. Grünbaum} and \textit{V. Klee}, Proc. Symp. Pure Math. 7, 101-180 (1963; Zbl 0132.17401)] had discussed ordinary starshaped sets with the help of visibility via straight line segments. Now, following \textit{R. Motwani}, \textit{A. Raghunathan} and \textit{H. Saran} [J. Comput. Syst. Sci. 40, No. 1, 19-48 (1990; Zbl 0705.68082)], the author uses visibility via staircase paths. An (oriented) path with edges parallel to the coordinate axes will be called a staircase path if no two of its edges have opposite directions. Then for two points \(x\) and \(y\) in a polytope \(S\) one says \(x\) is visible from \(y\) via staircase paths if there is a staircase path in \(S\) which contains both \(x\) and \(y\). Sharper, \(x\) is clearly visible from \(y\) via staircase paths if for some neighborhood \(N\) of \(x\) each point of \(S\) which belongs to \(N\) is visible from \(y\) via staircase paths. The polytope \(S\) in question is an orthogonal \(d\)-polytope, that is a connected union of finitely many convex polytopes, whose edges are parallel to the coordinate axes. Such a polytope is starshaped via staircase paths if for some point \(p\) in \(S\) each point of \(S\) is visible from \(p\) via staircase paths. The set of all such points \(p\) is called the staircase kernel of \(S\). For these staircase kernels of orthogonal \(d\)-polytopes the author gives a simple representation using clearly visibility. Furthermore she shows how to change the result by using only visibility. Namely, for clearly visibility it suffices to consider only those points of \(S\) being points of local nonconvexity, while only visibility needs all the points of the boundary of \(S\).
- Unions of sets starshaped via staircase paths or via paths of bounded length
- Krasnosel'skii-type theorems for dent edges in orthogonal polygones
- Simply connected orthogonal polygons as unions of two orthogonally starshaped sets
- A Krasnosel'skii theorem for orthogonal polygons starshaped via staircase \((n + 1)\)-paths
- Characterizing compact unions of two starshaped sets in \({\mathbb{R}}^ d\)
- Intersection of maximal orthogonally starshaped polygons
- A visible shoreline theorem for staircase paths
- Unions of orthogonally convex or orthogonally starshaped polygons
- A Krasnosel'skij theorem for staircase paths in orthogonal polygons
- A Krasnosel'skii-Type Theorem for Points of Local Nonconvexity
- A Krasnosel'skij theorem for staircase paths in orthogonal polygons
- 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 3211481 (Why is no real title available?)
- scientific article; zbMATH DE number 3271295 (Why is no real title available?)
- Points of local nonconvexity, clear visibility, and starshaped sets in \(R^ n\)
- Staircase kernels in orthogonal polygons
- On staircase starshapedness in rectilinear spaces
- Unions of sets starshaped via staircase paths or via paths of bounded length
- Dimensions of staircase kernels in orthogonal polygons
- Staircase visibility and computation of kernels
- Suitable families of boxes and kernels of staircase starshaped sets in \(\mathbb{R}^d\)
- scientific article; zbMATH DE number 7399675 (Why is no real title available?)
- Visible shoreline results for staircase paths in R^d
- Maximal visibility and unions of orthogonally starshaped sets
- Staircase two-guard kernels of orthogonal polygons
This page was built for publication: Staircase kernels for orthogonal \(d\)-polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921386)
