A generalization of staircase visibility
[For the entire collection see Zbl 0753.00016.] The authors discuss for some sets of orientations generalizations of staircase-visibility. Curves that are monotone with respect to the given set \(\mathcal O\) of orientations are called \(\mathcal O\)-staircases. The \(\mathcal O\)-kernel of a polygon \(P\) is the set of all points \(p\) in \(P\) for which for all other points \(q\) in \(P\) there exists an \(\mathcal O\)-staircase from \(p\) to \(q\) that is completely contained in \(P\). A fast algorithm for computing the \(\mathcal O\)-kernel of a polygon is given.
- VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
- Staircase visibility and computation of kernels
- A characterization of generalized staircases
- A visible shoreline theorem for staircase paths
- Generalising the staircase models
- A sum of squares theorem for visibility (extended abstract)
- Visibility in semi-convex spaces
- A general notion of visibility graphs
- The visibility function revisited
- Genetic algorithms, teleological conservatism, and the emergence of optimal demand relations: The case of stable preferences
- On starshapedness in products of interval spaces
- Staircase visibility and computation of kernels
- Optimizing generalized kernels of polygons
- VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
- Finding the largest area axis-parallel rectangle in a polygon
This page was built for publication: A generalization of staircase visibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035765)
